TY - GEN
T1 - PARALLELIZED PROCESS SCHEDULING FOR A TIGHTLY-COUPLED MIMD MACHINE.
AU - Klappholz, David
AU - Park, Haeng Chul
PY - 1984
Y1 - 1984
N2 - In order to fully parallelize tightly coupled, speedup-oriented MIMD machines, it would be desirable to implement their resource management functions in such a way that: (1) any number of processors--up to all of them--can perform resource management in parallel and (2) no central (i. e. , serially accessible) tables of resources need be accessed by processors running the resource management code. The authors propose a process scheduling policy, namely, deliberate random level-order scheduling with time slicing, and a mechanism for implementing it for which (1) and (2) hold. Performance of this policy is studied both analytically and through simulation.
AB - In order to fully parallelize tightly coupled, speedup-oriented MIMD machines, it would be desirable to implement their resource management functions in such a way that: (1) any number of processors--up to all of them--can perform resource management in parallel and (2) no central (i. e. , serially accessible) tables of resources need be accessed by processors running the resource management code. The authors propose a process scheduling policy, namely, deliberate random level-order scheduling with time slicing, and a mechanism for implementing it for which (1) and (2) hold. Performance of this policy is studied both analytically and through simulation.
UR - http://www.scopus.com/inward/record.url?scp=0021554087&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0021554087&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0021554087
SN - 081860560X
T3 - Proceedings of the International Conference on Parallel Processing
SP - 315
EP - 321
BT - Proceedings of the International Conference on Parallel Processing
A2 - Keller, Robert M.
ER -