By Topic

Scheduling Framework and Algorithms for Large-Scale Divisible Load Processing with Multi-Dimensional QoS Constraints

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
$33 $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

3 Author(s)
Kaibo Wang ; Sch. of Comput., Northwestern Polytech. Univ., Xi'an ; Xingshe Zhou ; Shandan Zhou

In this paper, we propose a scheduling framework and related algorithms for processing large-scale, computation-intensive divisible loads. The framework is organized into a two-level tree architecture. Based on this framework, admission test and load partitioning and distribution algorithms are designed to ensure that the multi-dimensional QoS requirements, i.e. processing deadline, security and reliability, of admitted loads can be satisfied. We take a novel approach to incorporate resource reservation and time step-size adaptive scheduling schemes into the optimal solution that makes computation nodes finish computing at the same time instant. We provide an implementation of the framework a top of a distributed communication middleware extended with QoS-aware resource management facilities. Prototype implementation and preliminary experimental results demonstrate the engineering feasibility and good performance of the proposed framework and algorithms.

Published in:

Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for

Date of Conference:

18-21 Nov. 2008