| 2008 |
|---|
| 24 | EE | Sanjoy K. Baruah,
Nathan Fisher:
Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems.
ICDCN 2008: 215-226 |
| 23 | EE | Sanjoy K. Baruah,
Nathan Fisher:
Hybrid-priority Scheduling of Resource-Sharing Sporadic Task Systems.
IEEE Real-Time and Embedded Technology and Applications Symposium 2008: 248-257 |
| 22 | EE | Sanjoy K. Baruah,
Nathan Fisher:
Hybrid-priority real-time scheduling.
IPDPS 2008: 1-8 |
| 21 | EE | Nathan Fisher,
Sanjoy K. Baruah:
Rate-Monotonic Scheduling.
Encyclopedia of Algorithms 2008 |
| 20 | EE | Sanjoy K. Baruah,
Nathan Fisher:
Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems.
Real-Time Systems 39(1-3): 97-122 (2008) |
| 2007 |
|---|
| 19 | EE | Nathan Fisher,
Sanjoy K. Baruah:
The Global Feasibility and Schedulability of General Task Models on Multiprocessor Platforms.
ECRTS 2007: 51-60 |
| 18 | EE | Nathan Fisher,
Marko Bertogna,
Sanjoy K. Baruah:
Resource-Locking Durations in EDF-Scheduled Systems.
IEEE Real-Time and Embedded Technology and Applications Symposium 2007: 91-100 |
| 17 | EE | Marko Bertogna,
Nathan Fisher,
Sanjoy K. Baruah:
Static-Priority Scheduling and Resource Hold Times.
IPDPS 2007: 1-8 |
| 16 | EE | Sanjoy K. Baruah,
Nathan Fisher:
Global Deadline-Monotonic Scheduling of Arbitrary-Deadline Sporadic Task Systems.
OPODIS 2007: 204-216 |
| 15 | EE | Nathan Fisher,
Thi Huyen Chau Nguyen,
Joël Goossens,
Pascal Richard:
Parametric Polynomial-Time Algorithms for Computing Response-Time Bounds for Static-Priority Tasks with Release Jitters.
RTCSA 2007: 377-385 |
| 14 | EE | Nathan Fisher,
Marko Bertogna,
Sanjoy K. Baruah:
The Design of an EDF-Scheduled Resource-Sharing Open Environment.
RTSS 2007: 83-92 |
| 13 | EE | Sanjoy K. Baruah,
Nathan Fisher:
The partitioned dynamic-priority scheduling of sporadic task systems.
Real-Time Systems 36(3): 199-226 (2007) |
| 2006 |
|---|
| 12 | EE | Nathan Fisher,
Sanjoy K. Baruah,
Theodore P. Baker:
The Partitioned Scheduling of Sporadic Tasks According to Static-Priorities.
ECRTS 2006: 118-127 |
| 11 | EE | Sanjoy K. Baruah,
Nathan Fisher:
The Feasibility Analysis of Multiprocessor Real-Time Systems.
ECRTS 2006: 85-96 |
| 10 | EE | Nathan Fisher,
Theodore P. Baker,
Sanjoy K. Baruah:
Algorithms for Determining the Demand-Based Load of a Sporadic Task System.
RTCSA 2006: 135-146 |
| 9 | EE | Sanjoy K. Baruah,
Nathan Fisher:
The Partitioned Multiprocessor Scheduling of Deadline-Constrained Sporadic Task Systems.
IEEE Trans. Computers 55(7): 918-923 (2006) |
| 8 | EE | Nathan Fisher,
Sanjoy K. Baruah:
A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with bounded relative deadlines.
J. Embedded Computing 2(3-4): 291-299 (2006) |
| 2005 |
|---|
| 7 | EE | Nathan Fisher,
Sanjoy K. Baruah:
A Fully Polynomial-Time Approximation Scheme for Feasibility Analysis in Static-Priority Systems with Arbitrary Relative Deadlines.
ECRTS 2005: 117-126 |
| 6 | EE | Sanjoy K. Baruah,
Nathan Fisher:
The Partitioned Scheduling of Sporadic Real-Time Tasks on Multiprocessor Platforms.
ICPP Workshops 2005: 346-353 |
| 5 | EE | Sanjoy K. Baruah,
Nathan Fisher:
Code-Size Minimization in Multiprocessor Real-Time Systems.
IPDPS 2005 |
| 4 | EE | Nathan Fisher,
Sanjoy K. Baruah:
The Partitioned, Static-Priority Scheduling of Sporadic Real-Time Tasks with Constrained Deadlines on Multiprocessor Platforms.
OPODIS 2005: 291-305 |
| 3 | EE | Sanjoy K. Baruah,
Nathan Fisher:
Real-Time Scheduling of Sporadic Task Systems When the Number of Distinct Task Types Is Small.
RTCSA 2005: 232-237 |
| 2 | EE | Nathan Fisher,
James H. Anderson,
Sanjoy K. Baruah:
Task Partitioning upon Memory-Constrained Multiprocessors.
RTCSA 2005: 416-421 |
| 1 | EE | Sanjoy K. Baruah,
Nathan Fisher:
The Partitioned Multiprocessor Scheduling of Sporadic Task Systems.
RTSS 2005: 321-329 |
