NDLI: FAST: a low-complexity algorithm for efficient scheduling of DAGs on parallel processors

Content Provider	IEEE Xplore Digital Library
Author	Yu-Kwong Kwok Ahmad, I. Jun Gu
Copyright Year	1996
Description	Author affiliation: Dept. of Comput. Sci., Hong Kong Univ. of Sci. & Technol., Hong Kong (Yu-Kwong Kwok; Ahmad, I.; Jun Gu)
Abstract	The DAG scheduling problem is a rich land of research and a plethora of algorithms for solving this problem have been reported in the literature. However, designing a scheduling algorithm of low complexity without sacrificing performance remains a challenging obstacle from a practical perspective. In this paper, we present a local search-based scheduling algorithm that attempts to meet this challenge. The proposed algorithm is called Fast Assignment using Search Technique (FAST). Its overall time complexity is only O(e) where e is the number of edges in the DAG. The algorithm works by first generating an initial solution and then refining it using local neighborhood search. The algorithm outperforms numerous previous algorithms while taking dramatically smaller execution times. The distinctive feature of our research is that the performance evaluation is not carried out using simulation, rather we have tested our proposed algorithm and compared it with other algorithms using a parallel compiler with real applications on the Intel Paragon.
Starting Page	150
Ending Page	157
File Size	911301
Page Count	8
File Format	PDF
ISBN	081867623X
ISSN	01903918
DOI	10.1109/ICPP.1996.537394
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1996-08-12
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Scheduling algorithm Processor scheduling Parallel processing Computer science Algorithm design and analysis Testing Councils Contracts
Content Type	Text
Resource Type	Article

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

A fast static scheduling algorithm for DAGs on an unbounded number of processors

Analysis, evaluation, and comparison of algorithms for scheduling task graphs on parallel processors

A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems

A Scheduling Algorithm to Optimize Parallel Processes

An efficient implementation of nested loop control instructions for super scalar processors

A High Efficient Task Scheduling Algorithm Based on Heterogeneous Multi-Core Processor

FAST: A Low-Complexity Algorithm for Efficient Scheduling of DAGs on (1996)

A fast algorithm for single processor scheduling

An efficient algorithm for scheduling instructions with deadline constraints on ILP processors

FAST: a low-complexity algorithm for efficient scheduling of DAGs on parallel processors

Similar Documents

A fast static scheduling algorithm for DAGs on an unbounded number of processors

Analysis, evaluation, and comparison of algorithms for scheduling task graphs on parallel processors

A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems

A Scheduling Algorithm to Optimize Parallel Processes

An efficient implementation of nested loop control instructions for super scalar processors

A High Efficient Task Scheduling Algorithm Based on Heterogeneous Multi-Core Processor

FAST: A Low-Complexity Algorithm for Efficient Scheduling of DAGs on (1996)

A fast algorithm for single processor scheduling

An efficient algorithm for scheduling instructions with deadline constraints on ILP processors

FAST: a low-complexity algorithm for efficient scheduling of DAGs on parallel processors