By Topic

A prediction module to optimize scheduling in a grid computing environment

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

4 Author(s)
Maleeha Kiran ; Department of Electrical & Computer Engineering, Faculty of Engineering, International Islamic University Malaysia, 53100 Gombak, Selangor, Malaysia ; Aisha Hassan Abdalla ; Yap Yee Jiun ; Lim Mei Kuan

Heterogeneous computing environment such as grid computing allows sharing and aggregation of a wide variety of geographically distributed computational resources (such as supercomputers, clusters, data sources, people and storage systems) and present them as a single, unified resource for solving large-scale and data-intensive computing applications. A common problem arising in grid computing is to select the most efficient resource to run a particular program. Also users are required to reserve in advance the resources needed to run their program on the grid. At present the execution time of any program submission depends on guesswork by the user. This leads to inefficient use of resources, incurring extra operation costs such as idling queues or machines. Thus a prediction module was designed and developed to aid the user. This module estimates the execution time of a program by using aspects of static analysis, analytical benchmarking and compiler based approach. It consists of 4 main stages; each with its own functionality. An incoming program is categorized accordingly, parsed and then broken down into smaller units known as tokens. The complexity and relationship amongst these tokens are then analyzed and finally the execution time is estimated for the entire program that was submitted.

Published in:

Computer and Communication Engineering, 2008. ICCCE 2008. International Conference on

Date of Conference:

13-15 May 2008