Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
A programmable interface language for heterogeneous distributed systems
ACM Transactions on Computer Systems (TOCS)
Communications of the ACM
Process migration: effects on scientific computation
ACM SIGPLAN Notices
A survey of process migration mechanisms
ACM SIGOPS Operating Systems Review
Process-originated migration in a heterogeneous environment
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Native code process-originated migration in a heterogeneous environment
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Preemptable remote execution facilities for the V-system
Proceedings of the tenth ACM symposium on Operating systems principles
Implementing remote procedure calls
ACM Transactions on Computer Systems (TOCS)
Preemptable remote execution facilities for loosely-coupled distributed systems (migration, transparency, scheduling)
Data collection and restoration for heterogenenous process migration
Software—Practice & Experience
Data Collection and Restoration for Heterogeneous Process Migration
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Communication State Transfer for the Mobility of Concurrent Heterogeneous Computing
IEEE Transactions on Computers
Execution migration in a heterogeneous-ISA chip multiprocessor
ASPLOS XVII Proceedings of the seventeenth international conference on Architectural Support for Programming Languages and Operating Systems
| Hi-index | 0.00 |
The execution of a program on a processor is viewed as a representation of that program going through a sequence of states. Each state change is manifested by the execution of a single instruction. Models that depend on this perspective are presented. The first is a static model of a description of a procedural computation. This model formalizes the description of the information in an executable module. Following this dynamic model of a procedural computation is given. This second model describes how a computation transitions from state to state and how the states of a computation are represented. Next, the state of a procedural computation is defined at certain well-defined points in its progression. These points represent potential points of correspondence to another instance of the computation. Then, the equivalence of these well-defined computation states is described. This refinement eliminates the nonmatching potential correspondences. The remaining points describe where the two computations are in the same state. These are precisely the points of equivalence of procedural computations. This final model of pointwise equivalence can be applied to the problem of migrating a computation from one processor to another (possibly architecturally dissimilar) processor.