By Topic

Clustering and intra-processor scheduling for explicitly-parallel programs on distributed-memory systems

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
$33 $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)
V. A. Dixit-Radiya ; Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA ; D. K. Panda

When mapping a parallel program onto a parallel architecture, the number of available processors is usually less than the number of tasks in the program. This gives rise to clustering and intra-processor scheduling problems. We address these two problems for distributed-memory systems where programs are explicitly-parallel in nature. We show that existing models of program representation are insufficient to capture temporal behavior of such programs. We use a new temporal communication graph model that allows identification of overlap of communication with computation and inter-task parallelism. Clustering and intra-processor scheduling heuristics, attempting to minimize program completion time, are proposed using this model. Simulation results on random task graphs show 10-25% improvement in completion time over existing heuristics

Published in:

Parallel Processing Symposium, 1994. Proceedings., Eighth International

Date of Conference:

26-29 Apr 1994