|
ABSTRACT
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
|
| |
2
|
ATTARDZ, G., BALDY, A., BONI, U., CARIGNANI, F., COZ~I, G., PhiL, A., DUROCH~R, E., FILOTTI, I., QUNG, W., HUNTBR, M., MARKS, J., RICHARDSON, C., AND WATSON, A. 1988. Techniques for dynamic software migration. In Proceedings oj the 5th Annual Esprit Conference. North-Holland, Amsterdam, 475-491.
|
 |
3
|
|
| |
4
|
CHERITON, D. R. 1984. The v kernel: A software base for distributed systems. IEEE Soflw. 1, 2 (Apr.), 19-42.
|
 |
5
|
|
| |
6
|
DUBACH, F. B. 1990. Code-point and data mapping in dynamic native-code cross-architectural process ndgration. M.S. thesis, Univ. of Colorado at Colorado Springs, Colorado Springs, Colorado.
|
 |
7
|
|
 |
8
|
|
| |
9
|
HOLLANDER, Y. AND SILBERMAN, G. 1987. A mechanism for the migration of tasks in heterogeneous d~strlbuted processing systems. In Internai~onal Conference on Parallel Processing and Applications. North-Holland, Amsterdam, 93-98.
|
 |
10
|
|
| |
11
|
SHARP, S. E. 1989. Register mismatch in heterogeneous process originated migration. UCCS CS-650 Proj. Rep, Univ. of Colorado at Colorado Springs, Colorado Springs, Colorado.
|
 |
12
|
|
 |
13
|
|
| |
14
|
|
| |
15
|
THBIMBR, M. M. AND HAYES, B. 1992. Heterogeneous migration by recompilation. Tech. Rep. CSL-92-3 (Mar.), Xerox Corporation, Palo Alto, CIMf.
|
 |
16
|
|
| |
17
|
VON BANK, D. G. 1990. Gnu c language system support for dynamic native code heterogeneous process-originated migration in the v system. M.S. thesis, Univ. of Colorado at Colorado Springs, Colorado Springs, Colorado.
|
REVIEW
"R. Sambasiva Rao : Reviewer"
The migration of an executing process from one machine to a
different one where it is to be executed is a fascinating and
challenging task. A source program in any high-level language is
compiled, and it runs on a processor under an operating
more...
|