L
Louis E. Rosier
Researcher at University of Texas at Austin
Publications - 67
Citations - 2887
Louis E. Rosier is an academic researcher from University of Texas at Austin. The author has contributed to research in topics: Petri net & Decidability. The author has an hindex of 22, co-authored 67 publications receiving 2795 citations. Previous affiliations of Louis E. Rosier include University of Minnesota.
Papers
More filters
Proceedings ArticleDOI
Preemptively scheduling hard-real-time sporadic tasks on one processor
TL;DR: The authors first give necessary and sufficient conditions for a sporadic task system to be feasible (i.e., schedulable) and lead to a feasibility test that runs in efficient pseudo-polynomial time for a very large percentage of sporadic task systems.
Journal ArticleDOI
Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor
TL;DR: The preemptive scheduling of periodic, real-time task systems on one processor is investigated, and it is shown that for incomplete task systems, that is, task systems in which the start times are not specified, the feasibility problem is ∑2p-complete.
Proceedings ArticleDOI
On-line scheduling in the presence of overload
TL;DR: The preemptive scheduling of sporadic tasks on a uniprocessor is considered and upper bounds on the best performance guarantee obtainable by an online algorithm in a variety of settings are derived.
Journal ArticleDOI
On the competitiveness of on-line real-time task scheduling
Sanjoy Baruah,G. Koren,D. Mao,B. Mishra,Anand Raghunathan,Louis E. Rosier,Dennis Shasha,Farn Wang +7 more
TL;DR: In this article, it was shown that no online scheduling algorithm can guarantee a cumulative value greater than 1/4th the value obtainable by a clairvoyant scheduler, i.e. if a task request is successfuly scheduled to completion, a value equal to the task's execution time is obtained; otherwise no value is obtained.
Proceedings ArticleDOI
On the competitiveness of on-line real-time task scheduling
Sanjoy Baruah,G. Koren,D. Mao,B. Mishra,Anand Raghunathan,Louis E. Rosier,Dennis Shasha,Farn Wang +7 more
TL;DR: It is proved that no on-line scheduling algorithm can guarantee a cumulative value greater than 1/4th the value obtainable by a clairvoyant scheduler, and it is shown that an online uniprocessor scheduling algorithm TD1 actually has a competitive factor of 1/ 4; this bound is thus shown to be tight.