| A unified analysis of global EDF and fixed-task-priority schedulability of sporadic task systems on multiprocessors | 5 | 0.67 | 2011 |
| Defects of the POSIX Sporadic Server and How to Correct Them | 20 | 0.81 | 2010 |
| What to make of multicore processors for reliable real-time systems? | 3 | 0.58 | 2010 |
| Sustainable Multiprocessor Scheduling of Sporadic Task Systems | 32 | 1.29 | 2009 |
| Proceedings of the 30th IEEE Real-Time Systems Symposium, RTSS 2009, Washington, DC, USA, 1-4 December 2009 | 43 | 2.90 | 2009 |
| An analysis of global edf schedulability for arbitrary-deadline sporadic task systems | 18 | 0.85 | 2009 |
| Global EDF Schedulability Analysis of Arbitrary Sporadic Task Systems | 21 | 1.05 | 2008 |
| Schedulability analysis of global EDF | 42 | 1.60 | 2008 |
| EDZL scheduling analysis | 43 | 2.01 | 2008 |
| Principles of Distributed Systems, 12th International Conference, OPODIS 2008, Luxor, Egypt, December 15-18, 2008. Proceedings | 40 | 1.98 | 2008 |
| EDZL Scheduling Analysis | 44 | 2.24 | 2007 |
| Brute-force determination of multiprocessor schedulability for sets of sporadic hard-deadline tasks | 28 | 1.14 | 2007 |
| Modeling Device Driver Effects in Real-Time Schedulability Analysis: Study of a Network Driver | 15 | 1.04 | 2007 |
| Algorithms for Determining the Demand-Based Load of a Sporadic Task System | 29 | 1.47 | 2006 |
| An Analysis of Fixed-Priority Schedulability on a Multiprocessor | 36 | 2.68 | 2006 |
| A Necessary and Sometimes Sufficient Condition for the Feasibility of Sets of Sporadic Hard-Deadline Tasks | 38 | 2.28 | 2006 |
| The partitioned scheduling of sporadic tasks according to static-priorities | 51 | 2.77 | 2006 |
| An Analysis of EDF Schedulability on a Multiprocessor | 71 | 4.12 | 2005 |
| Real Time Scheduling Theory: A Historical Perspective | 240 | 9.29 | 2004 |
| Multiprocessor EDF and Deadline Monotonic Schedulability Analysis | 98 | 6.09 | 2003 |
| A ``Bare-Machine'' Implementation of Ada Multi-tasking Beneath the Linux Kernel | 2 | 0.94 | 1999 |
| Utilization Bounds for N-Processor Rate Monotone Scheduling with Static Processor Assignment | 43 | 3.49 | 1998 |
| Ada Bindings for C Interfaces: Lessons Learned from the Florist Implementation | 0 | 0.34 | 1997 |
| The GNARL Implementation of POSIX/Ada Signal Services | 2 | 0.72 | 1996 |
| Fast context switches: compiler and architectural support for preemptive scheduling | 21 | 1.40 | 1995 |
| Aperiodic servers in a deadline scheduling environment | 103 | 12.60 | 1995 |
| Real-time schedulability-analyzable mechanisms in Ada9X | 4 | 0.44 | 1994 |
| A retargetable technique for predicting execution time of code segments | 25 | 2.56 | 1994 |
| A retargetable technique for predicting execution time | 68 | 12.03 | 1992 |
| Stack-based Scheduling of Realtime Processes | 135 | 18.50 | 1991 |
| Real-Time Features for Ada 9X | 11 | 2.26 | 1991 |
| The Cyclic Executive Model and Ada | 61 | 6.29 | 1988 |
| Corset and Lace: Adapting Ada Runtime Support to Real-Time Systems | 2 | 0.44 | 1987 |
| Implementing Ada Exceptions | 5 | 1.01 | 1986 |
| Ada Tasking: From semantics to Efficient Implementation | 7 | 1.43 | 1985 |
| A single-pass syntax-directed front end for Ada | 4 | 1.24 | 1982 |
| A One-Pass Algorithm for Overload Resolution in Ada | 7 | 1.29 | 1982 |
| Extending lookahead for LR parsers | 13 | 1.33 | 1981 |
| Relative Succinctness of Representations of Languages and Separation of Complexity Classes | 3 | 0.83 | 1979 |
| On "Provable" Analogs of P and MP | 3 | 0.46 | 1979 |
| “Natural” properties of flowchart step-counting measures | 1 | 0.39 | 1978 |
| Technique For Extending Rapid Exact-Match String Matching To Arrays Of More Than One Dimension | 73 | 21.70 | 1978 |
| A second step toward the polynomial hierarchy | 58 | 24.58 | 1976 |
| On Simple Goedel Numberings and Translations | 18 | 1.47 | 1975 |
| Relativizatons of the P =? NP Question | 61 | 6.38 | 1975 |
| "Natural" properties of flowchart complexity measures | 1 | 0.40 | 1974 |
