By Topic

MS-DFGA : Malleable Scheduling with Dynamic MaxFlow and Greedy Algorithms in Grid Networks

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)
Amel Hamdi ; Inst. d'Electron. Fondamentale, Univ. Paris-Sud 11, Orsay, France ; Lynda Zitoune ; Véronique Vèque

In this paper, we present a new approach to schedule malleable requests over grid computing networks. The proposed solution called MS-DFGA (MS-DFGA: Malleable Scheduling with Dynamic MaxFlow and Greedy Algorithms) aims at maximizing the network utilization while increasing the requests acceptance ratio. We have adapted Multi-constrained Knapsacks Problem (MKP) to the malleable requests scheduling, and propose a solution to resolve it. MS-DFGA is performed in two steps. The first step corresponds to the computation of the candidate paths over the network using a Dynamic MaxFlow algorithm. The second step concerns the malleable requests scheduling over these paths. The paths represent the knapsacks, and the requests correspond to the items of the MKP problem. Also, we present an implementation of our solution as a new simulator framework which we have developed in a JAVA environment. Moreover, simulation results illustrate the efficiency of our scheduling method to: provide guarantees for critical grid traffics with timely execution requirements, avoid bandwidth wastage when the temporal constraints are too close and hence reducing the blocking ratio.

Published in:

Telecommunications (AICT), 2010 Sixth Advanced International Conference on

Date of Conference:

9-15 May 2010