Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of Windsor

$11,500.00

Design of G-CODE algorithms and components

FY 2008-09

Summary
The research aims at developing algorithms and protocols required for an optimized network- aware scheduler for the Grid Computing Development Environment (G-CODE) system. The scheduler may use sender-side algorithm and historical experience to estimate bandwidth. It would use heuristic techniques like genetic algorithm to obtain a near-optimal schedule in near-real time. In early nineties, the traffic models using self-similar processes and long range dependencies were used. However the studies conducted in 2000 have shown that traffic follows Poisson distribution. We, therefore, propose to investigate a self-induced sender-side algorithm based on Poisson distribution. The Meta scheduler is to permit advance reservations and work-flow based task scheduling. We propose to investigate the use of genetic algorithm up to the lowest level, where its use may depend upon the depth of parallelism of the application. If the resources are represented by a dynamic graph, if each node is represented by a tuple and if applications are represented by graphs with dual weights, optimization process will match the requirements of the processes of an application with the compute-powers of  the heterogeneous nodes, after considering the  communication delays, latencies, prior reservations and the trust that the client is able to build. NOVELTIES OF THE WORK: There is no reported scheduler with sender-end bandwidth algorithm and with the ability to handle workflow type of jobs, prior reservations or communication delays. The scheduler algorithms become too slow, when even a thousand processes are required to be mapped. None of them tries to continuously evaluate trust factor at every level. Moreover our research is trying to develop algorithms and protocols, which are in alignment with the moving target of open Grid Computing standards. EXPECTED SIGNIFICANCE: The new approaches mentioned here are worth exploring if we are to progress towards the vision of a global grid, with unlimited number of ubiquitous devices connected to it.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
238997-2006
Name nom
Aggarwal, AkshaiKumar
Department département
Computer Science, School of
Organization id
37
Institution établissement
University of Windsor
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2006
Award amount
11500
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
330
Committee name en
Computing and Information Sciences - A
Committee name fr
Informatique - A
Area of application code
803
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer communications
Area of application fr
Téléinformatique
Research subject code
2704
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Distributed and parallel processing
Research subject fr
Traitement réparti et simultané
Partie
3
Nb partie
3
Application title
Design of G-CODE algorithms and components
Keyword
NA
Application summary
The research aims at developing algorithms and protocols required for an optimized network- aware scheduler for the Grid Computing Development Environment (G-CODE) system. The scheduler may use sender-side algorithm and historical experience to estimate bandwidth. It would use heuristic techniques like genetic algorithm to obtain a near-optimal schedule in near-real time. In early nineties, the traffic models using self-similar processes and long range dependencies were used. However the studies conducted in 2000 have shown that traffic follows Poisson distribution. We, therefore, propose to investigate a self-induced sender-side algorithm based on Poisson distribution. The Meta scheduler is to permit advance reservations and work-flow based task scheduling. We propose to investigate the use of genetic algorithm up to the lowest level, where its use may depend upon the depth of parallelism of the application. If the resources are represented by a dynamic graph, if each node is represented by a tuple and if applications are represented by graphs with dual weights, optimization process will match the requirements of the processes of an application with the compute-powers of  the heterogeneous nodes, after considering the  communication delays, latencies, prior reservations and the trust that the client is able to build. NOVELTIES OF THE WORK: There is no reported scheduler with sender-end bandwidth algorithm and with the ability to handle workflow type of jobs, prior reservations or communication delays. The scheduler algorithms become too slow, when even a thousand processes are required to be mapped. None of them tries to continuously evaluate trust factor at every level. Moreover our research is trying to develop algorithms and protocols, which are in alignment with the moving target of open Grid Computing standards. EXPECTED SIGNIFICANCE: The new approaches mentioned here are worth exploring if we are to progress towards the vision of a global grid, with unlimited number of ubiquitous devices connected to it.
University of Windsor - $11,500 Grant (2008-09) | Canada Spends