By Topic

QoS-constrained List Scheduling Heuristics for Parallel Applications on Grids

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Baraglia, R. ; Italian Nat. Res. Council, Pisa ; Ferrini, R. ; Tonellotto, N. ; Ricci, L.
more authors

This paper presents QLSE (QoS-constrained list scheduling heuristics), a quality of service-based launch time scheduling algorithm for wide area grids. QLSE considers applications described by a task interaction graph (TIG) whose nodes and edges are labeled according to the Quality of Service requirements of the application. The high values obtained in the performance evaluation for both the tasks communication and computation throughput demonstrates the applicability of the proposed approach.

Published in:

Parallel, Distributed and Network-Based Processing, 2008. PDP 2008. 16th Euromicro Conference on

Date of Conference:

13-15 Feb. 2008