	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 J. Goossens Articles by S. Baruah

Seventh International Conference on Real-Time Computing Systems and Applications (RTCSA'00)

Multiprocessor algorithms for uniprocessor feasibility analysis

Cheju Island, South Korea

December 12-December 14

ISBN: 0-7695-0930-4

	ASCII Text	x
	J. Goossens, S. Baruah, "Multiprocessor algorithms for uniprocessor feasibility analysis," Real-Time Computing Systems and Applications, International Workshop on, pp. 315, Seventh International Conference on Real-Time Computing Systems and Applications (RTCSA'00), 2000.

	BibTex	x
	@article{ 10.1109/RTCSA.2000.896407, author = {J. Goossens and S. Baruah}, title = {Multiprocessor algorithms for uniprocessor feasibility analysis}, journal ={Real-Time Computing Systems and Applications, International Workshop on}, volume = {0}, year = {2000}, issn = {1533-2306}, pages = {315}, doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.2000.896407}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Real-Time Computing Systems and Applications, International Workshop on TI - Multiprocessor algorithms for uniprocessor feasibility analysis SN - 1533-2306 SP EP A1 - J. Goossens, A1 - S. Baruah, PY - 2000 KW - parallel algorithms; multiprocessing systems; parallel machines; scheduling; real-time systems; multiprocessor algorithms; uniprocessor feasibility analysis; hard real-time system; deadlines; task models; scheduling algorithms; uniprocessor real-time systems; parallel machines; parallel algorithm; asynchronous periodic tasks; preemptive earliest deadline first scheduling VL - 0 JA - Real-Time Computing Systems and Applications, International Workshop on ER -

J. Goossens, Univ. Libre de Bruxelles, Belgium

S. Baruah, Univ. Libre de Bruxelles, Belgium

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTCSA.2000.896407

Feasibility analysis of a hard-real-time system refers to the process of determining off-line whether the specified system will meet all deadlines at runtime. For many important (and interesting) task models and scheduling algorithms, feasibility analysis is provably computationally very expensive. A framework is established for speeding up the feasibility analysis of uniprocessor real-time systems by implementing these algorithms on parallel machines. The viability of this framework is validated by developing a parallel algorithm for the feasibility analysis of systems of asynchronous periodic tasks that are to be scheduled using the preemptive earliest deadline first scheduling algorithm, and by implementing and testing the performance of this parallel algorithm.

Index Terms:

parallel algorithms; multiprocessing systems; parallel machines; scheduling; real-time systems; multiprocessor algorithms; uniprocessor feasibility analysis; hard real-time system; deadlines; task models; scheduling algorithms; uniprocessor real-time systems; parallel machines; parallel algorithm; asynchronous periodic tasks; preemptive earliest deadline first scheduling

Citation:

J. Goossens, S. Baruah, "Multiprocessor algorithms for uniprocessor feasibility analysis," rtcsa, pp.315, Seventh International Conference on Real-Time Computing Systems and Applications (RTCSA'00), 2000

Peer Review Notice | Give Us Feedback

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