By Topic

Efficient Algorithm on heterogeneous computing system

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

2 Author(s)
Sunita Bansal ; Computer Science & Information Systems Department, Birla Institute of Technology & Science, Pilani, Rajasthan, 333031, INDIA ; Chittaranjan Hota

Distributed task scheduling in a heterogeneous computing environment is one of the most challenging problems. The optimally mapping of independent tasks onto heterogeneous distributed computing systems is known to be NP-complete. The most common objective function of a distributed task scheduling problem is to reduce the make span and increase the load balancing across the machines. In this paper, we introduce a new scheduling algorithm called, Efficient Algorithm on Heterogeneous Computing System (EAHCS) which balances the load well across the machines and reduces the make span time. In our evaluation study, a number of experiments with various simulation settings have been conducted. The results obtained using the proposed heuristic improves over the existing approaches.

Published in:

Recent Trends in Information Systems (ReTIS), 2011 International Conference on

Date of Conference:

21-23 Dec. 2011