NDLI: On Clustering Tasks in IC-Optimal Dags

Content Provider	IEEE Xplore Digital Library
Author	Sims, M. Cordasco, G. Rosenberg, A.L.
Copyright Year	2008
Description	Author affiliation: Univ. Massachusetts, Amherst, MA (Sims, M.)
Abstract	Strategies are developed for "fattening" the tasks of computation-dags so as to accommodate the heterogeneity of remote clients in Internet-based computing (IC). Earlier work has developed the underpinnings of IC-scheduling theory, an algorithmic framework for scheduling computations having intertask dependencies for IC. The theory's schedules strive to render tasks eligible for execution at the maximum possible rate, so as to: (a) utilize remoteclients' computational resources well, by enhancing the likelihood of having work to allocate to an available client; (b) lessen the likelihood of a computation's stalling for lack of tasks that are eligible for allocation. The current study begins to enhance IC-scheduling theory so that it can accommodate the varying computational resources of remote clients. The techniques developed here render a dag multi-granular by clustering its tasks. Several clustering strategies are developed: one works for any dag but produces only a limited variety of "fattened" tasks; others exploit the detailed structure of the dag being scheduled but allow a broad range of "fattened" tasks.
Starting Page	381
Ending Page	388
File Size	255115
Page Count	8
File Format	PDF
ISBN	9780769533742
ISSN	01903918
DOI	10.1109/ICPP.2008.14
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-09-09
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Schedules Integrated circuits Processor scheduling Optimal scheduling Integrated circuit modeling Servers Computational modeling IC-scheduling dag-scheduling Internet-based computing scheduling for heterogeneous platforms
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 Comparison of Dag-Scheduling Strategies for Internet-Based Computing

An AREA-Oriented Heuristic for Scheduling DAGs on Volatile Computing Platforms

On clustering tasks in ic-optimal dags (2008).

Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality

An Economic Approach for Scheduling Dependent Tasks in Grid Computing

A Priority-Based Scheduling Heuristic to Maximize Parallelism of Ready Tasks for DAG Applications

Applying IC-Scheduling Theory to Familiar Classes of Computations

On scheduling complex dags for Internet-based computing

On clustering DAGs for task-hungry computing platforms

On Clustering Tasks in IC-Optimal Dags

Similar Documents

A Comparison of Dag-Scheduling Strategies for Internet-Based Computing

An AREA-Oriented Heuristic for Scheduling DAGs on Volatile Computing Platforms

On clustering tasks in ic-optimal dags (2008).

Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality

An Economic Approach for Scheduling Dependent Tasks in Grid Computing

A Priority-Based Scheduling Heuristic to Maximize Parallelism of Ready Tasks for DAG Applications

Applying IC-Scheduling Theory to Familiar Classes of Computations

On scheduling complex dags for Internet-based computing

On clustering DAGs for task-hungry computing platforms

On Clustering Tasks in IC-Optimal Dags