Cart (Loading....) | Create Account
Close category search window

Critical Path Based Scheduling of Multiple Applications in Heterogeneous Distributed Computing

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
$31 $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)
Sah, S.K. ; Dept. of Comput. Eng., IT-BHU, Varanasi ; Singh, R.S.

The paper presents a task allocation technique for multiple applications onto heterogeneous distributed computing system to minimize the overall makespan. An existing critical path based algorithm for scheduling of tasks of single application has been used to allocate tasks of multiple applications onto heterogeneous distributed computing system. The paper discusses how a composite application is given for multiple applications and how critical path based algorithm is applied efficiently for the allocation of tasks of different applications.

Published in:

Advance Computing Conference, 2009. IACC 2009. IEEE International

Date of Conference:

6-7 March 2009

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.