Design of a separable transition-diagram compiler
Communications of the ACM
Planning a computer system: Project Stretch
Planning a computer system: Project Stretch
The D825 automatic operating and scheduling program
AFIPS '63 (Spring) Proceedings of the May 21-23, 1963, spring joint computer conference
A Survey of Some Theoretical Aspects of Multiprocessing
ACM Computing Surveys (CSUR)
A Basis for the Quantitative Comparison of Computer Number Systems
IEEE Transactions on Computers
Compilation Techniques for Recognition of Parallel Processable Tasks in Arithmetic Expressions
IEEE Transactions on Computers
Percolation of Code to Enhance Parallel Dispatching and Execution
IEEE Transactions on Computers
Direct Implementation of Asynchronous Control Units
IEEE Transactions on Computers
AFIPS '66 (Fall) Proceedings of the November 7-10, 1966, fall joint computer conference
Development of executive routines, both hardware and software
AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
Observations on high-performance machines
AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
A language design for concurrent processes
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
A computer system designer's view of large scale integration
AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
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
A compatible airborne multiprocessor
AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference
A systematic approach to the design of digital bussing structures
AFIPS '72 (Fall, part II) Proceedings of the December 5-7, 1972, fall joint computer conference, part II
Evaluation of performance of parallel processors in a real-time environment
AFIPS '73 Proceedings of the June 4-8, 1973, national computer conference and exposition
Failure-tolerant parallel programming and its supporting system architecture
AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition
A Comparison of Some Theoretical Models of Parallel Computation
IEEE Transactions on Computers
An application-oriented multiprocessing system: III control program features
IBM Systems Journal
Parallelism and Array Processing
IEEE Transactions on Computers
IEEE Transactions on Computers - Special issue on parallel processors and processing
An approach to software system modelling and analysis
Computer Languages
| Hi-index | 0.02 |
Parallel processing is not so mysterious a concept as the dearth of algorithms which explicitly use it might suggest. As a rule of thumb, if N processes are performed and the outcome is independent of the order in which their steps are executed, provided that within each process the order of steps is preserved, then any or all of the processes can be performed simultaneously, if conflicts arising from multiple access to common storage can be resolved. All the elements of a matrix sum may be evaluated in parallel. The ith summand of all elements of a matrix product may be computed simultaneously. In an internal merge sort all strings in any pass may be created at the same time. All the coroutines of a separable program may be run concurrently.