default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTaesoon Park
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j13]Taesoon Park:
Agent Based Fault Tolerance for the Mobile Environment. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(4): 846-849 (2010)
2000 – 2009
- 2009
- [c29]Duksung Jang, Seungchan Choi, Taesoon Park:
Development of Collapse-Sensing Phone for Emergency Positioning System. ITNG 2009: 1649-1652 - 2008
- [j12]Taesoon Park, Kwangho Kim:
Fault-Tolerance for the Mobile Ad-Hoc Environment. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(1): 413-416 (2008) - 2006
- [c28]Taesoon Park, Jaehwan Youn, Dongryung Kim:
Using Adaptive Agents for the Fault-Tolerant Mobile Computing System. International Conference on Computational Science (3) 2006: 807-814 - 2005
- [c27]Taesoon Park:
Mobile Agent Based Fault-Tolerance Support for the Reliable Mobile Computing Systems. COORDINATION 2005: 173-187 - [c26]Namyoon Woo, Hyungsoo Jung, Dongin Shin, Hyuck Han, Heon Young Yeom, Taesoon Park:
Performance Evaluation of Consistent Recovery Protocols Using MPICH-GF. EDCC 2005: 167-178 - 2004
- [j11]Inseon Lee, Heon Young Yeom, Taesoon Park:
A New Approach for Distributed Main Memory Database Systems: A Causal Commit Protocol. IEICE Trans. Inf. Syst. 87-D(1): 196-204 (2004) - [j10]Namyoon Woo, Hyungsoo Jung, Heon Young Yeom, Taesoon Park, Hyungwoo Park:
MPICH-GF: Transparent Checkpointing and Rollback-Recovery for Grid-Enabled MPI Processes. IEICE Trans. Inf. Syst. 87-D(7): 1820-1828 (2004) - [c25]Taesoon Park, Ilsoo Byun, Heon Young Yeom:
Lazy Agent Replication and Asynchronous Consensus for the Fault-Tolerant Mobile Agent System. NETWORKING 2004: 1060-1071 - [c24]Taesoon Park, Jaehwan Youn:
The K-Fault-Tolerant Checkpointing Scheme for the Reliable Mobile Agent System. PDCAT 2004: 577-581 - 2003
- [j9]Taesoon Park, Namyoon Woo, Heon Young Yeom:
An efficient recovery scheme for fault-tolerant mobile computing systems. Future Gener. Comput. Syst. 19(1): 37-53 (2003) - [j8]Taesoon Park:
Fault-Tolerant Execution of Collaborating Mobile Agents. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(11): 2897-2900 (2003) - [j7]Jae-Heung Yeo, Heon Young Yeom, Taesoon Park:
An Asynchronous Protocol for Release Consistent Distributed Shared Memory Systems. J. Supercomput. 24(1): 25-41 (2003) - [c23]Taesoon Park, Ilsoo Byun:
Low Overhead Agent Replication for the Reliable Mobile Agent System. Euro-Par 2003: 1170-1179 - [c22]Inseon Lee, Heon Young Yeom, Taesoon Park, Hyoung-Woo Park:
A Lightweight Message Logging Scheme for Fault Tolerant MPI. PPAM 2003: 397-404 - [c21]Sangbum Kim, Namyoon Woo, Heon Young Yeom, Taesoon Park, Hyoung-Woo Park:
Design and Implementation of Dynamic Process Management for Grid-Enabled MPICH. PVM/MPI 2003: 653-656 - 2002
- [j6]Taesoon Park, Inseon Lee, Heon Young Yeom:
An efficient causal logging scheme for recoverable distributed shared memory systems. Parallel Comput. 28(11): 1549-1572 (2002) - [j5]Taesoon Park, Namyoon Woo, Heon Young Yeom:
An Efficient Optimistic Message Logging Scheme for Recoverable Mobile Computing Systems. IEEE Trans. Mob. Comput. 1(4): 265-277 (2002) - [c20]Hyunjoo Kim, Heon Young Yeom, Taesoon Park, Hyoung-Woo Park:
The Cost of Checkpointing, Logging and Recovery for the Mobile Agent Systems. PRDC 2002: 45-50 - [c19]Taesoon Park, Ilsoo Byun, Hyunjoo Kim, Heon Young Yeom:
The Performance of Checkpointing and Replication Schemes for Fault Tolerant Mobile Agent Systems. SRDS 2002: 256-261 - 2001
- [c18]Jiman Hong, Sangsu Kim, Juwon Park, Taesoon Park, Heon Young Yeom, Yookun Cho:
An efficient checkpoint scheme based on memory profile and time series analysis. CATA 2001: 74-77 - [c17]Taesoon Park, Namyoon Woo, Heon Young Yeom:
An Efficient Recovery Scheme for Mobile Computing Environments. ICPADS 2001: 53-60 - [c16]Jiman Hong, Sangsu Kim, Yookun Cho, Heon Young Yeom, Taesoon Park:
On the Choice of Checkpoint Interval Using Memory Usage Profile and Adaptive Time Series Analysis. PRDC 2001: 45-48 - [c15]Taesoon Park, Namyoon Woo, Heon Young Yeom:
Efficient Recovery Information Management Schemes for the Fault Tolerant Mobile Computing Systems. SRDS 2001: 202- - 2000
- [j4]Taesoon Park, Heon Young Yeom:
An efficient logging and recovery scheme for lazy release consistent distributed shared memory systems. Future Gener. Comput. Syst. 17(3): 265-278 (2000) - [j3]Taesoon Park, Heon Young Yeom:
Application controlled checkpointing coordination for fault-tolerant distributed computing systems. Parallel Comput. 26(4): 467-482 (2000) - [j2]Taesoon Park, Heon Young Yeom:
A Low Overhead Logging Scheme for Fast Recovery in Distributed Shared Memory Systems. J. Supercomput. 15(3): 295-320 (2000) - [c14]Jiman Hong, Heon Young Yeom, Yookun Cho, Taesoon Park:
Kckpt: An efficient checkpoint and recovery facility on unixware kernel. CATA 2000: 303-308 - [c13]Taesoon Park, Heon Young Yeom:
An Asynchronous Recovery Scheme based on Optimistic Message Logging for Mobile Computing Systems. ICDCS 2000: 436-443 - [c12]Taesoon Park, Heon Young Yeom:
A Lightweight Casual Logging Scheme for Recoverable Distributed Shared Memory. SAC (2) 2000: 661-666 - [c11]Jae-Heung Yeo, Heon Young Yeom, Taesoon Park:
An Asynchronous Protocol for Release Consistent Distributed Shared Memory Systems. SAC (2) 2000: 716-721
1990 – 1999
- 1998
- [c10]Yunjung Yi, Taesoon Park, Heon Young Yeom:
A Causal Logging Scheme for Lazy Release Consistent Distributed Shared Memory Systems. ICPADS 1998: 139-146 - [c9]Taesoon Park, Heon Young Yeom:
An Efficient Logging Scheme for Lazy Release Consistent Distributed Shared Memory Systems. IPPS/SPDP 1998: 670-674 - [c8]Byoungjoo Lee, Taesoon Park, Heon Young Yeom, Yookun Cho:
An Efficient Algorithm for Causal Message Logging. SRDS 1998: 19-25 - 1997
- [c7]Taesoon Park, Sung Bok Cho, Heon Young Yeom:
An Efficient Logging Scheme for Recoverable Distributed Shared Memory System. ICDCS 1997: 305-313 - 1996
- [c6]Taesoon Park, Sung Bok Cho, Heon Young Yeom:
An Improved Logging and Checkpointing Scheme for Recoverable Distributed Shared Memory. ASIAN 1996: 74-83 - 1994
- [c5]Junguk L. Kim, Taesoon Park:
An Efficient Recovery Scheme for Locking-Based Distributed Database Systems. SRDS 1994: 116-125 - 1993
- [j1]Junguk L. Kim, Taesoon Park:
An Efficient Protocol for Checkpointing Recovery in Distributed Systems. IEEE Trans. Parallel Distributed Syst. 4(8): 955-960 (1993) - [c4]Junguk L. Kim, Taesoon Park, Prabaharan I. Swarnam, M.-J. Kim:
A Protocol for Consistent Checkpointing Recovery for Time-Critical Distributed Database Systems. DASFAA 1993: 227-234 - 1992
- [c3]Junguk L. Kim, Jyh-Charn Liu, Prabaharan I. Swarnam, Taesoon Park, Ying Hao, Thomas Urbanik:
The area-wide real-time traffic control system (ARTC): a distributed computing system. COMPSAC 1992: 263-268 - [c2]Junguk L. Kim, Taesoon Park, Heon Young Yeom:
A Reliable, Replicated Distributed Database System on a Bus Local Area Network. Future Databases 1992: 93-96 - [c1]Taesoon Park, Junguk L. Kim:
A checkpointing recovery approach in a distributed system on the CSMA/CD network. SAC 1992: 614-623
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
