A Scheme of Parallel Processing for MIMD Systems

This paper presents a recognition procedure for parallel tasks in the user program written in a conventional programming language. To establish our program model, it describes the parallelism of the program in tenns of a process flow graph in which the relationships among processes are of predecessors and successors. And finally it presents a parallel processing scheme which realizes automatically the recognition of parallel tasks and schedules these tasks for parallel execution.

[1]  Gary J. Nutt A Parallel Processor Operating System Comparison , 1977, IEEE Transactions on Software Engineering.

[2]  Michael J. Flynn,et al.  Some Computer Organizations and Their Effectiveness , 1972, IEEE Transactions on Computers.

[3]  Samuel H. Fuller,et al.  Cm*: a modular, multi-microprocessor , 1977, AFIPS '77.

[4]  Jean-Loup Baer Multiprocessing Systems , 1976, IEEE Transactions on Computers.

[5]  Michael J. Flynn SomeComputer Organizations andTheir Effectiveness , 1972 .

[6]  William B. Ackerman,et al.  Data Flow Languages , 1899, Computer.

[7]  James E. Rumbaugh,et al.  A Data Flow Multiprocessor , 1977, IEEE Transactions on Computers.

[8]  David A. Padua,et al.  Dependence graphs and compiler optimizations , 1981, POPL '81.

[9]  Daniel P. Siewiorek,et al.  A survey of highly parallel computing , 1982, Computer.

[10]  David A. Padua,et al.  A Second Opinion on Data Flow Machines and Languages , 1982, Computer.

[11]  David A. Padua,et al.  High-Speed Multiprocessors and Compilation Techniques , 1980, IEEE Transactions on Computers.

[12]  James R. McGraw Data Flow Computing - Software Development , 1980, IEEE Trans. Computers.

[13]  Per Brinch Hansen,et al.  The programming language Concurrent Pascal , 1975, IEEE Transactions on Software Engineering.