S
Sanjoy Baruah
Researcher at Washington University in St. Louis
Publications - 296
Citations - 14909
Sanjoy Baruah is an academic researcher from Washington University in St. Louis. The author has contributed to research in topics: Scheduling (computing) & Earliest deadline first scheduling. The author has an hindex of 63, co-authored 296 publications receiving 14069 citations. Previous affiliations of Sanjoy Baruah include Florida State University & Université libre de Bruxelles.
Papers
More filters
Journal ArticleDOI
Schedulability analysis of global EDF
Sanjoy Baruah,Theodore P. Baker +1 more
TL;DR: It is shown that this test generalizes the previously-known exact uniprocessor edf-schedulability test, and that it offers non-trivial quantitative guarantees (including a resource augmentation bound) on multiprocessors.
Proceedings ArticleDOI
A framework for achieving inter-application isolation in multiprogrammed, hard real-time environments
TL;DR: A framework for scheduling a number of different real-time applications on a single shared preemptable processor enforces complete isolation among the different applications, such that the behavior of each application is very similar to its behavior if it had been executing on a slower dedicated processor.
Book ChapterDOI
Implementing mixed criticality systems in Ada
Sanjoy Baruah,Alan Burns +1 more
TL;DR: This paper considers both of these issues and indicates how mixed criticality applications can be implemented in Ada and produces code to illustrate how the necessary run-time mode changes can be supported.
Journal ArticleDOI
A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines
TL;DR: This research derives a technique possessing three desirable properties of estimates of the exact response times: continuity with respect to system parameters, efficient computability, and approximability for estimating the worst-case response time of sporadic task systems that are scheduled using fixed priorities upon a preemptive uniprocessor.
Proceedings ArticleDOI
The case for fair multiprocessor scheduling
TL;DR: Experimental results show that PD/sup 2/ is competitive with, and in some cases outperforms, EDF-FF, and suggest that Pfair scheduling is a viable alternative to partitioning.