This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Scheme of Parallel Processing for MIMD Systems
July 1983 (vol. 9 no. 4)
pp. 436-445
S. Jajodia, Department of Computer Science, University of Missouri
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.
Index Terms:
task scheduler, Parallel execution, parallelism, precedence relation, process flow graph, quasi-parallelism, synchronization
Citation:
S. Jajodia, J. Liu, P.A. Ng, "A Scheme of Parallel Processing for MIMD Systems," IEEE Transactions on Software Engineering, vol. 9, no. 4, pp. 436-445, July 1983, doi:10.1109/TSE.1983.234780
Usage of this product signifies your acceptance of the Terms of Use.