Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Improved algorithms for partitioning tree and linear task graphs on shared memory architecture

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ray, S. ; Dept. of Comput. Sci. & Eng., Nebraska Univ., Lincoln, NE, USA ; Hong Jiang

In parallel and distributed computing, the overall system performance is significantly influenced by how a task graph representing an application is mapped onto a specific multiprocessor topology. In this paper, algorithms with improved performance are proposed to map tree and linear task graphs onto shared memory multiprocessing architectures. Specifically, the task graphs are partitioned with our algorithms so that the load is balanced, processor utilisation is maximized, and the communication demand on the interconnection network is minimized in a shared memory multiprocessor. All the proposed algorithms are polynomial in time complexity. Bottleneck and processor minimization algorithms of this type are proposed. The bandwidth minimization algorithm has a complexity of O(n + p log q) (q⩽p⩽n), in contrast with the complexity of O(n log n) for the best known algorithm in the literature. Furthermore, we have identified cases where our algorithm will run in linear time on the average

Published in:

Distributed Computing Systems, 1994., Proceedings of the 14th International Conference on

Date of Conference:

21-24 Jun 1994