A New Concurrent Checkpoint Mechanism for Real-Time and Interactive Processes

Liao, Jianwei; Ishikawa, Yutaka

doi:10.1109/compsac.2010.12

Cited by 6 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Regarding the functionality of process migration, we have integrated the MPICH2 library [MPI 2012] with the transparent kernel-level checkpoint/restart library implemented in our previous work [Liao 2012] after certain modifications on the checkpoint/restart library, according to the idea presented in Wang et al [2008]. Thus, we can save the consistent state of the process running on the source node, and transfer the process image to the destination computing node by using MPI communication facilities, in order to resume the execution of the migrated process.…”

Section: Methodsmentioning

confidence: 99%

“…The fundamental principle of checkpoint/restart is to periodically save the state of the target process. If, for some reason, the process crashes, then the most recent checkpointed state is read and the process execution restarts from there [Liao 2012]. Although the idea of checkpoint/restart is quite straightforward, it adopts many variants in the specified application contexts [Meneses et al 2015;Dong et al 2011].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic Process Migration Based on Block Access Patterns Occurring in Storage Servers

Liao

Xiao

2016

ACM Trans. Archit. Code Optim.

View full text Add to dashboard Cite

An emerging trend in developing large and complex applications on today's high-performance computers is to couple independent components into a comprehensive application. The components may employ the global file system to exchange their data when executing the application. In order to reduce the time required for input/output (I/O) data exchange and data transfer in the coupled systems or other applications, this article proposes a dynamic process migration mechanism on the basis of block access pattern similarity for utilizing the local file cache to exchange the data. We first introduce the scheme of the block access counting diagram to profile the process access pattern during a time period on the storage server. Next, we propose an algorithm that compares the access patterns of processes running on different computing nodes. Last, processes are migrated in order to group processes with similar access patterns. Consequently, the processes on the computing node can exchange their data by accessing the local file cache, instead of the global file system. The experimental results show that the proposed process migration mechanism can reduce the execution time required by the application because of the shorter I/O time, as well as yield attractive I/O throughput. In summary, this dynamic process migration technique can work fairly well for distributed applications whose data dependency rely on distributed file systems.

show abstract

Section: Methodsmentioning

confidence: 99%