Scheduling of variable-time jobs for distributed systems with heterogeneous processor cardinality
by Jan-Jan Wu; Hung-Jui Chang; Yu-Fan Ho; Pangfeng Liu
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 10, No. 2, 2012

Abstract: This paper proposes scheduling algorithms for assigning jobs with different release time and execution time to machines with heterogeneous processor cardinality. We show that this scheduling problem is NP-complete, and propose dynamic programming to find the optimal schedules. Since the dynamic programming is time-consuming, we propose techniques that improve the efficiency of the dynamic programming. We also propose heuristic algorithms for this scheduling problem. Experimental results demonstrate that some of the heuristics not only compute the answer efficiently but also provide good solutions.

Online publication date: Mon, 30-Jul-2012

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com