Cluster queue structure for shared-memory multiprocessor systems

Weiping Zhu, Tyngyeu Liang, Ce-Kuen Shieh

研究成果: Paper

2 引文 斯高帕斯(Scopus)

摘要

Three basic organizations have been proposed to construct the task queues for a shared-memory multiprocess system: centralized, distributed, and hierarchical structures. The centralized structure is not suitable for massively parallel systems since the centralized queue is a bottleneck. The distributed structure, on the other hand, will end up with load imbalancing due to the random execution time of tasks. The hierarchical structure tends to combine the advantage of the previous two structures and reduces the impact of bottleneck and load imbalancing. However, we found out the load imbalancing still exists in the hierarchical structure. It also affects system performance, in particular, when the workload become heavier. We further identified the cause of this problem. We then propose the use of a forest structure to provide load balancing and contention minimization.

原文English
頁面420-427
頁數8
出版狀態Published - 1998 十二月 1
事件Proceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS - Tainan, China
持續時間: 1998 十二月 141998 十二月 16

Other

OtherProceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS
城市Tainan, China
期間98-12-1498-12-16

    指紋

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

引用此

Zhu, W., Liang, T., & Shieh, C-K. (1998). Cluster queue structure for shared-memory multiprocessor systems. 420-427. 論文發表於 Proceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS, Tainan, China, .