Experience with Charlotte: Simplicity and Function in a Distributed Operating System
IEEE Transactions on Software Engineering
A unified model of pointwise equivalence of procedural computations
ACM Transactions on Programming Languages and Systems (TOPLAS)
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
The freeze free algorithm for process migration
The freeze free algorithm for process migration
Limitations of cycle stealing for parallel processing on a network of homogeneous workstations
Journal of Parallel and Distributed Computing
Exploiting process lifetime distributions for dynamic load balancing
ACM Transactions on Computer Systems (TOCS)
Heterogeneous process migration: the Tui system
Software—Practice & Experience
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Quasi-asynchronous migration: a novel migration protocol for PVM tasks
ACM SIGOPS Operating Systems Review
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Performance Modeling and Prediction of Nondedicated Network Computing
IEEE Transactions on Computers
Data collection and restoration for heterogenenous process migration
Software—Practice & Experience
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Process Introspection: A Heterogeneous Checkpoint/Restart Mechanism Based on Automatic Code Modification
| Hi-index | 14.98 |
In a dynamic environment where a process can migrate from one host to another host, communication state transfer is a key issue of process coordination. This paper presents a set of data communication and process migration protocols to support communication state transfer in a dynamic, distributed parallel environment. The protocols preserve the semantics of point-to-point communication; they guarantee message delivery, maintain message ordering, and do not introduce deadlock when blocking send or receive operations are performed during process migration. Analytical proofs and prototype implementation are conducted to confirm the correctness of the protocols. Analytical and experimental results show the proposed design is valid and has a true potential in network computing.