NDLI: Edge Scheduling Algorithms in Parallel and Distributed Systems

Content Provider	IEEE Xplore Digital Library
Author	Jian-Jun Han Duo-Qiang Wang
Copyright Year	2006
Description	Author affiliation: Sch. of Comput., Huazhong Univ. of Sci. & Technol., Wuhan (Jian-Jun Han; Duo-Qiang Wang)
Abstract	Many research efforts have been done in the domain of static scheduling algorithms based on DAG. However, most of these literatures assume that all processors are fully connected and receive communication data concurrently, while ignoring the contentions and delays on network links in real applications, which leads to low efficiency. This paper focuses on the issue of edge scheduling for dependent task set in parallel and distributed environment. Combined with conventionally efficient heuristics, two contention-aware scheduling algorithms are proposed in the paper: OIHSA (optimal insertion hybrid scheduling algorithm) and BBSA (bandwidth based scheduling algorithm). Both the proposed algorithms start from the inherent characteristic of the edge scheduling problem, and select route paths with relatively low network workload to transfer communication data by modified routing algorithm. OISHA optimizes the start time of communication data transferred on links in form of theorems. BBSA exploits bandwidth of network links fully to transfer communication data as soon as possible. Therefore, the makespan yielded by our algorithms can be reduced efficiently. Moreover, the proposed algorithms adapt to not only homogeneous systems but also heterogeneous systems. The experiment results indicate that the proposed algorithms obviously outperform other algorithms so far in terms of makespan
Sponsorship	IEEE CPS
Starting Page	147
Ending Page	154
File Size	167514
Page Count	8
File Format	PDF
ISBN	0769526365
ISSN	01903918
DOI	10.1109/ICPP.2006.37
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-08-14
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Scheduling algorithm Processor scheduling Clustering algorithms Bandwidth Dynamic scheduling Routing Genetic algorithms Simulated annealing Costs Computer networks
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

Using Simulated Annealing for Task Scheduling in Distributed Systems

Efficient clustering for parallel tasks execution in distributed systems

Task Scheduling using Parallel Genetic Simulated Annealing Algorithm

Task assignment scheduling by simulated annealing

A parallel simulated annealing algorithm for short-term hydro scheduling

A genetic algorithm for scheduling tasks in a real-time distributed system

Rail network routing and scheduling using simulated annealing

Three-phase simulated annealing algorithms for exam scheduling

A flexible clustering and scheduling scheme for efficient parallel computation

Edge Scheduling Algorithms in Parallel and Distributed Systems

Similar Documents

Using Simulated Annealing for Task Scheduling in Distributed Systems

Efficient clustering for parallel tasks execution in distributed systems

Task Scheduling using Parallel Genetic Simulated Annealing Algorithm

Task assignment scheduling by simulated annealing

A parallel simulated annealing algorithm for short-term hydro scheduling

A genetic algorithm for scheduling tasks in a real-time distributed system

Rail network routing and scheduling using simulated annealing

Three-phase simulated annealing algorithms for exam scheduling

A flexible clustering and scheduling scheme for efficient parallel computation

Edge Scheduling Algorithms in Parallel and Distributed Systems