Multiprocessor Scheduling Problem with Probabilistic Execution Costs

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by S. Fujita Articles by H. Zhou

2000 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '00)

Dallas/Richardson, Texas, USA

December 07-December 07

ISBN: 0-7695-0936-3

	ASCII Text	x
	S. Fujita, H. Zhou, "Multiprocessor Scheduling Problem with Probabilistic Execution Costs," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 121, 2000 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '00), 2000.

	BibTex	x
	@article{ 10.1109/ISPAN.2000.900275, author = {S. Fujita and H. Zhou}, title = {Multiprocessor Scheduling Problem with Probabilistic Execution Costs}, journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on}, volume = {0}, year = {2000}, issn = {1087-4089}, pages = {121}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.2000.900275}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel Architectures, Algorithms, and Networks, International Symposium on TI - Multiprocessor Scheduling Problem with Probabilistic Execution Costs SN - 1087-4089 SP EP A1 - S. Fujita, A1 - H. Zhou, PY - 2000 KW - null VL - 0 JA - Parallel Architectures, Algorithms, and Networks, International Symposium on ER -

S. Fujita

H. Zhou

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.2000.900275

In this paper, we propose a method for tolerating an inaccuracy of the estimated execution cost of tasks that is usually assumed to be accurate in static multiprocessor scheduling algorithms. In the proposed method, tasks are assigned onto processors in such a way to minimize the maximum expected execution cost rather than the worst case or best case execution costs. A detailed analysis of the proposed method is given, and it is shown that (1) there is an instance for which the algorithm is not optimal, and (2) for a class of instances, the algorithm generates an optimal solution.

Citation:

S. Fujita, H. Zhou, "Multiprocessor Scheduling Problem with Probabilistic Execution Costs," ispan, pp.121, 2000 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '00), 2000

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.