Fast scheduling of periodic tasks on multiple resources

I
IPPS
1995
9th International Parallel Processing Symposium
Abstract - Fast scheduling of periodic tasks on multiple resources

	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
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by S.K. Baruah Articles by J.E. Gehrke Articles by C.G. Plaxton

9th International Parallel Processing Symposium

Santa Barbara, CA

April 25-April 28

ISBN: 0-8186-7074-6

	ASCII Text	x
	S.K. Baruah, J.E. Gehrke, C.G. Plaxton, "Fast scheduling of periodic tasks on multiple resources," Parallel Processing Symposium, International, pp. 280, 9th International Parallel Processing Symposium, 1995.

	BibTex	x
	@article{ 10.1109/IPPS.1995.395946, author = {S.K. Baruah and J.E. Gehrke and C.G. Plaxton}, title = {Fast scheduling of periodic tasks on multiple resources}, journal ={Parallel Processing Symposium, International}, volume = {0}, year = {1995}, issn = {1063-7133}, pages = {280}, doi = {http://doi.ieeecomputersociety.org/10.1109/IPPS.1995.395946}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel Processing Symposium, International TI - Fast scheduling of periodic tasks on multiple resources SN - 1063-7133 SP EP A1 - S.K. Baruah, A1 - J.E. Gehrke, A1 - C.G. Plaxton, PY - 1995 KW - scheduling; computational complexity; processor scheduling; fast scheduling; periodic tasks; multiple resources; execution requirement; identical copies VL - 0 JA - Parallel Processing Symposium, International ER -

S.K. Baruah, Dept. of Comput. Sci. & Electr. Eng., Vermont Univ., Burlington, VT, USA

J.E. Gehrke, Dept. of Comput. Sci. & Electr. Eng., Vermont Univ., Burlington, VT, USA

C.G. Plaxton, Dept. of Comput. Sci. & Electr. Eng., Vermont Univ., Burlington, VT, USA

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPPS.1995.395946

Given n periodic tasks, each characterized by an execution requirement and a period, and m identical copies of a resource, the periodic scheduling problem is concerned with generating a schedule for the n tasks on the m resources. We present an algorithm that schedules every feasible instance of the periodic scheduling problem, and runs in O(min{mlgn,n}) time per slot scheduled.

Index Terms:

scheduling; computational complexity; processor scheduling; fast scheduling; periodic tasks; multiple resources; execution requirement; identical copies

Citation:

S.K. Baruah, J.E. Gehrke, C.G. Plaxton, "Fast scheduling of periodic tasks on multiple resources," ipps, pp.280, 9th International Parallel Processing Symposium, 1995

Peer Review Notice | Give Us Feedback

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