Performance analysis of hierarchical task queue organization for parallel systems

A hierarchical task queue organization that avoids the task queue bottleneck associated with the centralized organization and provides performance better than centralized and distributed organizations is proposed. A detailed performance analysis shows that the hierarchical organization is less sensitive to parameters like the branching factor and transfer factor. Therefore, it is suitable for large parallel systems.<<ETX>>

[1]  David L. Black.  Scheduling support for concurrency and parallelism in the Mach operating system , 1990, Computer.

[2]  Daniel Gajski,et al.  CEDAR: a large scale multiprocessor , 1983, CARN.

[3]  Mary K. Vernon,et al.  The performance of multiprogrammed multiprocessor scheduling algorithms , 1990, SIGMETRICS '90.

[4]  Asser N. Tantawi,et al.  Performance Analysis of Parallel Processing Systems , 1988, IEEE Trans. Software Eng..

[5]  Ming T. Liu,et al.  A Cluster Structure as an Interconnection Network for Large Multimicrocomputer Systems , 1981, IEEE Transactions on Computers.

[6]  Sivarama P. Dandamudi,et al.  Scheduling in parallel systems with a hierarchical organization of tasks , 1992, ICS '92.

[7]  Lionel M. Ni,et al.  Design Tradeoffs for Process Scheduling in Shared Memory Multiprocessor Systems , 1989, IEEE Trans. Software Eng..

[8]  Lawrence C. Stewart,et al.  Firefly: a multiprocessor workstation , 1987, ASPLOS 1987.

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

[10]  Donald F. Towsley,et al.  Analysis of Fork-Join Program Response Times on Multiprocessors , 1990, IEEE Trans. Parallel Distributed Syst..

[11]  Kai Hwang,et al.  Hypernet: A Communication-Efficient Architecture for Constructing Massively Parallel Computers , 1987, IEEE Transactions on Computers.

[12]  Andrzej Duda.  On the Tradeoff Between Parallelism and Communication , 1989 .

[13]  Gianluca Piccinini,et al.  EMMA2, a high-performance hierarchical multiprocessor , 1989 .

[14]  Nian-Feng Tzeng,et al.  Distributing Hot-Spot Addressing in Large-Scale Multiprocessors , 1987, IEEE Transactions on Computers.

[15]  John Zahorjan,et al.  Processor scheduling in shared memory multiprocessors , 1990, SIGMETRICS '90.

[16]  Shreekant S. Thakkar,et al.  The Symmetry Multiprocessor System , 1988, ICPP.

[17]  Larry Rudolph,et al.  Distributed hierarchical control for parallel processing , 1990, Computer.

[18]  Sivarama P. Dandamudi.  A comparison of task scheduling strategies for multiprocessor systems , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[19]  Sivarama P. Dandamudi,et al.  Hot-Spot Contention in Binary Hypercube Networks , 1992, IEEE Trans. Computers.

[20]  Kanad Ghose,et al.  The HCN: a versatile interconnection network based on cubes , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

[21]  Sivarama P. Dandamudi,et al.  Hierarchical Interconnection Networks for Multicomputer Systems , 1990, IEEE Trans. Computers.

[22]  Henry M. Levy,et al.  The Performance Implications of Thread Management Alternatives for Shared-Memory Multiprocessors , 1989, IEEE Trans. Computers.

[23]  C. A. R. Hoare,et al.  Monitors: an operating system structuring concept , 1974, CACM.

[24]  Gregory F. Pfister,et al.  “Hot spot” contention and combining in multistage interconnection networks , 1985, IEEE Transactions on Computers.

[25]  Shikharesh Majumdar,et al.  Scheduling in multiprogrammed parallel systems , 1988, SIGMETRICS 1988.

[26]  P. Jones,et al.  Practical Experience of Run-Time Link Reconfiguration in a Multi-Transputer Machine , 1990, Concurr. Pract. Exp..