Memory coherence in shared virtual memory systems
ACM Transactions on Computer Systems (TOCS)
Functional programming: practice and theory
Functional programming: practice and theory
PVM: a framework for parallel distributed computing
Concurrency: Practice and Experience
Operating system concepts (3rd ed.)
Operating system concepts (3rd ed.)
An empirical comparison of monitoring algorithms for access anomaly detection
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Strand: new concepts in parallel programming
Strand: new concepts in parallel programming
An introduction to parallel programming
An introduction to parallel programming
Communicating sequential processes
Communications of the ACM
Programming semantics for multiprogrammed computations
Communications of the ACM
Efficient Implementation of high-level parallel programs
ASPLOS IV Proceedings of the fourth international conference on Architectural support for programming languages and operating systems
Comparative Study of Parallel Programming Languages: The Salishan Problems
Comparative Study of Parallel Programming Languages: The Salishan Problems
Portable Programs for Parallel Processors
Portable Programs for Parallel Processors
Protection in the Hydra Operating System
SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
Protection in programmed systems.
Protection in programmed systems.
Compositional parallel programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Detection of Implicit Parallelisms in the Task Parallel Language
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Yada: Straightforward parallel programming
Parallel Computing
| Hi-index | 0.00 |
This paper proposes extensions of sequential programming languages for parallel programming that have the following features:Dynamic Structures: The process structure is dynamic. Processes and variables can be created and deleted.Paradigm Integration: The programming notation supports shared memory and message passing models.Determinism: Demonstrating that a program is deterministic_all executions with the same input produce the same output驴is straightforward. Programs can be written so that compilers can verify that the programs are deterministic. Nondeterministic constructs can be introduced in a sequence of refinement steps to obtain greater efficiency if required.The ideas have been incorporated in an extension of Fortran, but the underlying sequential imperative language is not central to the ideas described here. A compiler for the Fortran extension, called Fortran M, is available by anonymous ftp from Argonne National Laboratory. Fortran M has been used for a variety of parallel applications.