The Community for Technology Leaders
Green Image
Issue No. 08 - August (2009 vol. 20)
ISSN: 1045-9219
pp: 1158-1172
Naga Vydyanathan , Siemens Corporate Technology, India, Bangalore
Sriram Krishnamoorthy , Pacific Northwest Laboratory, Richland
Gerald M. Sabin , RNET Technologies, Inc., Dayton
Umit V. Catalyurek , Ohio State University, Columbus
Tahsin Kurc , Ohio State University, Columbus
Ponnuswamy Sadayappan , Ohio State University, Columbus
Joel H. Saltz , Ohio State University, Columbus
Complex parallel applications can often be modeled as directed acyclic graphs of coarse-grained application tasks with dependences. These applications exhibit both task and data parallelism, and combining these two (also called mixed parallelism) has been shown to be an effective model for their execution. In this paper, we present an algorithm to compute the appropriate mix of task and data parallelism required to minimize the parallel completion time (makespan) of these applications. In other words, our algorithm determines the set of tasks that should be run concurrently and the number of processors to be allocated to each task. The processor allocation and scheduling decisions are made in an integrated manner and are based on several factors such as the structure of the task graph, the runtime estimates and scalability characteristics of the tasks, and the intertask data communication volumes. A locality-conscious scheduling strategy is used to improve intertask data reuse. Evaluation through simulations and actual executions of task graphs derived from real applications and synthetic graphs shows that our algorithm consistently generates schedules with a lower makespan as compared to Critical Path Reduction (CPR) and Critical Path and Allocation (CPA), two previously proposed scheduling algorithms. Our algorithm also produces schedules that have a lower makespan than pure task- and data-parallel schedules. For task graphs with known optimal schedules or lower bounds on the makespan, our algorithm generates schedules that are closer to the optima than other scheduling approaches.
Processor allocation, scheduling, mixed parallelism, data-flow graphs, locality-conscious scheduling.

N. Vydyanathan et al., "An Integrated Approach to Locality-Conscious Processor Allocation and Scheduling of Mixed-Parallel Applications," in IEEE Transactions on Parallel & Distributed Systems, vol. 20, no. , pp. 1158-1172, 2008.
85 ms
(Ver 3.3 (11022016))