Architecture-Independent Parallel Computation

Computer

Volumn 23, Issue 12, 1990, Pages 38-50

  Skillicorn, David B ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY - PROGRAMMING THEORY; DATA PROCESSING - DATA STRUCTURES; MATHEMATICAL PROGRAMMING, DYNAMIC;

ARCHITECTURE-INDEPENDENT PARALLEL COMPUTATION; BIRD-MEERTENS FORMALISM; KESTREL INTERACTIVE DEVELOPMENT SYSTEM; MIMD COMPUTERS; PARALLEL RANDOM ACCESS MACHINE; SIMD COMPUTERS;

COMPUTER SYSTEMS, DIGITAL;

EID: 0025559241     PISSN: 00189162     EISSN: None     Source Type: Trade Journal    
DOI: 10.1109/2.62092     Document Type: Article

References (11)

1. D.B. Skillicorn, “A Taxonomy for Computer Architectures,” Computer, Vol. 21, No. 11, Nov. 1988, pp. 46–57.
2. L.G. Valiant, “General-Purpose Parallel Architecture,” Tech. Report TR-07-89, Computer Science Dept., Harvard Univ., 1989.
3. K. Mehlhorn and U. Vishkin, “Randomized and Deterministic Simulation of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories,” Acta lnformatica, Vol. 21, 1984, pp. 339–374.
4. L.G. Valiant, “Optimally Universal Parallel Computers,” Proc. Royal Soc., 1987.
5. S.H. Bokhari and A.D. Raza, “Augmenting Computer Networks,” in Proc. Int’l Conf. Parallel Processing, IEEE Computer Soc., Aug. 1984, pp. 338–345.
6. A. Aiken and A. Nicolau, “Optimal Loop Parallelization,” in Proc. SIGPlan 88: ACM Conf. on Programming Language Design and Implementation, R. Wexelblat, ed., 1988, pp. 308–317.
7. R.S. Bird, “Algebraic Identities for Program Calculation,” The Computer J., Vol. 32, No. 2, Feb. 1989, pp. 122–126.
8. J.A. Goguen and T. Winkler, “Introducing OBJ3,” Tech. Report SRI-CSL-88-9, Computer Science Lab., SRI Int’l, Aug. 1988.
9. D.R. Smith and M.R. Lowry, “Algorithm Theories and Design Tactics,” in Math. Program Construction, Springer-Verlag Lecture Notes in Computer Science 375, June 1989, pp. 379–398.
10. R.E. Ladner and M.J. Fisher, “Parallel Prefix Computation,” J. ACM, Vol. 27, 1980, pp. 831–838.
11. J.M. Spivey, “A Categorical Approach to Theory of Lists,” in Math. Program Construction, Springer-Verlag Lecture Notes in Computer Science 373, June 1989, pp. 399–408.