NDLI: Reliability and Scheduling on Systems Subject to Failures

Content Provider	IEEE Xplore Digital Library
Author	Hakem, M. Butelle, F.
Copyright Year	2007
Description	Author affiliation: LIPN - CNRS UMR 7030, Univ. Paris Nord, Villetaneuse (Hakem, M.; Butelle, F.)
Abstract	This paper presents a new bi-objective greedy heuristic for scheduling parallel applications on heterogeneous distributed computing systems. The proposed algorithm which is called BSA (bi-objective scheduling algorithm) takes into account not only the time makespan but also the failure probability of the application. Since it is not usually possible to achieve the two conflicting objectives (performance and reliability) simultaneously, a bi-objective compromise function is introduced. BSA has a low time complexity of O(e\P\ + nu log omega), where e and nu are respectively the number of edges and tasks in the task graph of the application. \P\ is the number of machines (processors) in the system and omega is the width of the task graph. Experimental results show the performance of the proposed algorithm.
Sponsorship	Int. Assoc. Comput. Commun.
Starting Page	38
Ending Page	38
File Size	201634
Page Count	1
File Format	PDF
ISSN	01903918
DOI	10.1109/ICPP.2007.72
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-09-10
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Processor scheduling Scheduling algorithm Distributed computing Computer applications Concurrent computing Clustering algorithms Reliability Parallel processing Cost function Delay heterogeneous systems. reliability scheduling clustering distributed computing precedence task graphs directed acyclic graphs DAGs multicriteria scheduling
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

Dynamic critical path scheduling parallel programs onto multiprocessors

Fault tolerant scheduling of precedence task graphs on heterogeneous platforms

Critical Path Scheduling Parallel Programs on an Unbounded Number of Processors

Static scheduling of dependent parallel tasks on heterogeneous clusters

Critical Path Scheduling Parallel Programs on an Unbounded Number of Processors

Levelized scheduling of directed a-cyclic precedence constrained task graphs onto heterogeneous computing system

A cluster-based strategy for scheduling task on heterogeneous processors

A New Algorithm for Static Task Scheduling For Heterogeneous Distributed Computing Systems

A randomized algorithm to schedule real-time task graphs to satisfy a multicriteria objective function

Reliability and Scheduling on Systems Subject to Failures

Similar Documents

Dynamic critical path scheduling parallel programs onto multiprocessors

Fault tolerant scheduling of precedence task graphs on heterogeneous platforms

Critical Path Scheduling Parallel Programs on an Unbounded Number of Processors

Static scheduling of dependent parallel tasks on heterogeneous clusters

Critical Path Scheduling Parallel Programs on an Unbounded Number of Processors

Levelized scheduling of directed a-cyclic precedence constrained task graphs onto heterogeneous computing system

A cluster-based strategy for scheduling task on heterogeneous processors

A New Algorithm for Static Task Scheduling For Heterogeneous Distributed Computing Systems

A randomized algorithm to schedule real-time task graphs to satisfy a multicriteria objective function

Reliability and Scheduling on Systems Subject to Failures