NDLI: Static scheduling algorithms for allocating directed task graphs to multiprocessors

Content Provider	ACM Digital Library
Author	Kwok, Yu-Kwong Ahmad, Ishfaq
Copyright Year	1999
Abstract	Static scheduling of a program represented by a directed task graph on a multiprocessor system to minimize the program completion time is a well-known problem in parallel processing. Since finding an optimal schedule is an NP-complete problem in general, researchers have resorted to devising efficient heuristics. A plethora of heuristics have been proposed based on a wide spectrum of techniques, including branch-and-bound, integer-programming, searching, graph-theory, randomization, genetic algorithms, and evolutionary methods. The objective of this survey is to describe various scheduling algorithms and their functionalities in a contrasting fashion as well as examine their relative merits in terms of performance and time-complexity. Since these algorithms are based on diverse assumptions, they differ in their functionalities, and hence are difficult to describe in a unified context. We propose a taxonomy that classifies these algorithms into different categories. We consider 27 scheduling algorithms, with each algorithm explained through an easy-to-understand description followed by an illustrative example to demonstrate its operation. We also outline some of the novel and promising optimization approaches and current research trends in the area. Finally, we give an overview of the software tools that provide scheduling/mapping functionalities.
Starting Page	406
Ending Page	471
Page Count	66
File Format	PDF
ISSN	03600300
e-ISSN	15577341
DOI	10.1145/344588.344618
Journal	ACM Computing Surveys (CSUR)
Volume Number	31
Issue Number	4
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1999-12-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	DAG Automatic parallelization Multiprocessors Parallel processing Software tools Static scheduling Task graphs
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Static scheduling algorithms for allocating directed task graphs to multiprocessors (1998).

Static scheduling algorithms for allocating directed task graphs to multiprocessors (1999).

Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors (1999)

Scheduling of Parallel Tasks with Proportionate Priorities

Author retrospective for PYRROS: static task scheduling and code generation for message passing multiprocessors

An efficient algorithm for static task scheduling in parallel applications

Optimal Preemptive Scheduling on Two-Processor Systems

Task scheduling for heterogeneous computing systems

Parallel algorithms for force directed scheduling of flattened and hierarchical signal flow graphs

Static scheduling algorithms for allocating directed task graphs to multiprocessors

Similar Documents

Static scheduling algorithms for allocating directed task graphs to multiprocessors (1998).

Static scheduling algorithms for allocating directed task graphs to multiprocessors (1999).

Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors (1999)

Scheduling of Parallel Tasks with Proportionate Priorities

Author retrospective for PYRROS: static task scheduling and code generation for message passing multiprocessors

An efficient algorithm for static task scheduling in parallel applications

Optimal Preemptive Scheduling on Two-Processor Systems

Task scheduling for heterogeneous computing systems

Parallel algorithms for force directed scheduling of flattened and hierarchical signal flow graphs

Static scheduling algorithms for allocating directed task graphs to multiprocessors