Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems

Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems

0.00 Avg rating0 Votes
Article ID: iaor20071735
Country: United Kingdom
Volume: 33
Issue: 8
Start Page Number: 2155
End Page Number: 2177
Publication Date: Aug 2006
Journal: Computers and Operations Research
Authors: ,
Keywords: computers, heuristics
Abstract:

Scheduling program tasks on processors is at the core of the efficient use of multiprocessor systems. Most task-scheduling problems are known to be NP-Hard and, thus, heuristics are the method of choice in all but the simplest cases. The utilization of acknowledged sets of benchmark-problem instances is essential for the correct comparison and analysis of heuristics. Yet, such sets are not available for several important classes of scheduling problems, including multiprocessor scheduling problem with communication delays (MSPCD) where one is interested in scheduling dependent tasks onto homogeneous multiprocessor systems, with processors connected in an arbitrary way, while explicitly accounting for the time required to transfer data between tasks allocated to different processors. We propose test-problem instances for the MSPCD that are representative in terms of number of processors, type of multiprocessor architecture, number of tasks to be scheduled, and task graph characteristics (task execution times, communication costs, and density of dependencies between tasks). Moreover, we define our task-graph generators in a way appropriate to ensure that the corresponding problem instances obey the theoretical principles recently proposed in the literature.

Reviews

Required fields are marked *. Your email address will not be published.