Inter-Completion Time Scheduling (ICTS): Non-Preemptive Scheduling to Maximize the Minimum Inter-Completion Time

	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 Carlos C. Amaro Articles by Alexander D. Stoyen Articles by Sanjoy K. Baruah

Fourth IEEE International Conference on Engineering Complex Computer Systems (ICECCS'98)

Monterey, California

August 10-August 14

ISBN: 0-8186-8597-2

	ASCII Text	x
	Carlos C. Amaro, Alexander D. Stoyen, Sanjoy K. Baruah, "Inter-Completion Time Scheduling (ICTS): Non-Preemptive Scheduling to Maximize the Minimum Inter-Completion Time," Engineering of Complex Computer Systems, IEEE International Conference on, pp. 0024, Fourth IEEE International Conference on Engineering Complex Computer Systems (ICECCS'98), 1998.

	BibTex	x
	@article{ 10.1109/ICECCS.1998.706653, author = {Carlos C. Amaro and Alexander D. Stoyen and Sanjoy K. Baruah}, title = {Inter-Completion Time Scheduling (ICTS): Non-Preemptive Scheduling to Maximize the Minimum Inter-Completion Time}, journal ={Engineering of Complex Computer Systems, IEEE International Conference on}, volume = {0}, year = {1998}, isbn = {0-8186-8597-2}, pages = {0024}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICECCS.1998.706653}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Engineering of Complex Computer Systems, IEEE International Conference on TI - Inter-Completion Time Scheduling (ICTS): Non-Preemptive Scheduling to Maximize the Minimum Inter-Completion Time SN - 0-8186-8597-2 SP EP A1 - Carlos C. Amaro, A1 - Alexander D. Stoyen, A1 - Sanjoy K. Baruah, PY - 1998 KW - non-preemptive scheduling KW - independent tasks KW - single and multiple processors KW - load-balancing KW - complex systems. VL - 0 JA - Engineering of Complex Computer Systems, IEEE International Conference on ER -

Carlos C. Amaro, New Jersey Institute of Technology

Alexander D. Stoyen, New Jersey Institute of Technology

Sanjoy K. Baruah, The University of Vermont

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICECCS.1998.706653

Temporal load-balancing - "spreading out" the executions of tasks over time - is desirable in many applications in complex systems. A form of temporal load-balancing is discussed, scheduling to maximize minimum inter-completion time (MICT-scheduling) and minimum global inter-completion time (MGICT-scheduling). It is shown that MICT- and MGICT-scheduling are , in general, NP-hard. A number of restricted classes of task systems are identified, which can be efficiently MICT- and MGICT-scheduled.

Index Terms:

non-preemptive scheduling, independent tasks, single and multiple processors, load-balancing, complex systems.

Citation:

Carlos C. Amaro, Alexander D. Stoyen, Sanjoy K. Baruah, "Inter-Completion Time Scheduling (ICTS): Non-Preemptive Scheduling to Maximize the Minimum Inter-Completion Time," iceccs, pp.0024, Fourth IEEE International Conference on Engineering Complex Computer Systems (ICECCS'98), 1998

Peer Review Notice | Give Us Feedback

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