Journal of the ACM (JACM)
Journal of the ACM (JACM)
Journal of the ACM (JACM)
The Organization of Computations for Uniform Recurrence Equations
Journal of the ACM (JACM)
Scheduling Parallel Computations
Journal of the ACM (JACM)
Legality and Other Properties of Graph Models of Computations
Journal of the ACM (JACM)
Programming semantics for multiprogrammed computations
Communications of the ACM
Additional comments on a problem in concurrent programming control
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
Proceedings of the International Sympoisum on Theoretical Programming
Proceedings of the International Sympoisum on Theoretical Programming
Towards automtical construction of parallel programs
Proceedings of the International Sympoisum on Theoretical Programming
Configurable computers: a new class of general purpose machines
Proceedings of the International Sympoisum on Theoretical Programming
A boundary between decidability and undecidability for parallel program schemata (Extended Abstract)
Proceedings of ACM conference on Proving assertions about programs
A GRAPH MODEL FOR PARALLEL COMPUTATIONS
A GRAPH MODEL FOR PARALLEL COMPUTATIONS
COORDINATION OF ASYNCHRONOUS EVENTS
COORDINATION OF ASYNCHRONOUS EVENTS
A survey of models for parallel computing
A survey of models for parallel computing
On deadlock in computer systems
On deadlock in computer systems
A system of representation for general purpose digital computer systems
A system of representation for general purpose digital computer systems
Structure and representation of digital computer systems
Structure and representation of digital computer systems
Program Suitability for Parallel Processing
IEEE Transactions on Computers
The ILLIAC IV Processing Element
IEEE Transactions on Computers
IEEE Transactions on Computers
ILLIAC IV Software and Application Programming
IEEE Transactions on Computers
Detection and Parallel Execution of Independent Instructions
IEEE Transactions on Computers
Events and conditions: introduction
Record of the Project MAC conference on concurrent systems and parallel computation
Modular, asynchronous control structures for a high performance processor
Record of the Project MAC conference on concurrent systems and parallel computation
Closure properties of interconnections of determinate systems
Record of the Project MAC conference on concurrent systems and parallel computation
Record of the Project MAC conference on concurrent systems and parallel computation
Record of the Project MAC conference on concurrent systems and parallel computation
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
On the decomposition of asynchronous systems
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Output functional computational structures
SWAT '68 Proceedings of the 9th Annual Symposium on Switching and Automata Theory (swat 1968)
SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
On maximally parallel schemata
SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
On the composition of parallel program schemata
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Optimal algorithms for parallel polynomial evaluation
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
A multiprocessor system design
AFIPS '63 (Fall) Proceedings of the November 12-14, 1963, fall joint computer conference
Computer organization for array processing
AFIPS '65 (Fall, part I) Proceedings of the November 30--December 1, 1965, fall joint computer conference, part I
AFIPS '66 (Fall) Proceedings of the November 7-10, 1966, fall joint computer conference
A survey of techniques for recognizing parallel processable streams in computer programs
AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference
Unconventional superspeed computer systems
AFIPS '71 (Spring) Proceedings of the May 18-20, 1971, spring joint computer conference
LOGOS and the software engineer
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
The IBM system/360 model 91: some remarks on system development
IBM Journal of Research and Development
The IBM system/360 model 91: machine philosophy and instruction-handling
IBM Journal of Research and Development
An efficient algorithm for exploiting multiple arithmetic units
IBM Journal of Research and Development
The IBM system/360 model 91: floating-point execution unit
IBM Journal of Research and Development
Journal of Computer and System Sciences
On formalised computer programs
Journal of Computer and System Sciences
Journal of Computer and System Sciences
On program schemata equivalence
Journal of Computer and System Sciences
A Formal Definition of Data Flow Graph Models
IEEE Transactions on Computers
Picture systems, PS, and the design of a channel-to-channel computer interface
ISCA '75 Proceedings of the 2nd annual symposium on Computer architecture
An Algorithm for High-Speed Digital Filters
IEEE Transactions on Computers
A Graph Model for Fault-Tolerant Computing Systems
IEEE Transactions on Computers
Performance Analysis Using Stochastic Petri Nets
IEEE Transactions on Computers
Structured flowcharts for multiprocessing
Computer Languages
| Hi-index | 14.99 |
In this paper we briefly describe and compare a number of theoretical models for parallel computation; namely, Petri nets, computation graphs, and parallel program schemata. We discuss various problems and properties of parallel computation that can be studied within these formulations and indicate the ties between these properties and the more practical aspects of parallel computation. We show how marked graphs, a particular type of Petri net, are a restricted type of computation graph and indicate how some results of marked graphs can be obtained from known results of computation graphs. Also, for schemata we discuss the decidability versus undecidability of various properties and several techniques of schemata composition.