Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
An investigation is conducted of two protocols belonging to the priority inheritance protocols class; the two are called the basic priority inheritance protocol and the priority ceiling protocol.…
The rate monotonic scheduling algorithm: exact characterization and average case behavior
- J. Lehoczky, L. Sha, Y. Ding
- Computer Science Proceedings. Real-Time Systems Symposium
- 5 December 1989
An exact characterization of the ability of the rate monotonic scheduling algorithm to meet the deadlines of a periodic task set is represented. In addition, a stochastic analysis which gives the…
Fixed priority scheduling of periodic task sets with arbitrary deadlines
- J. Lehoczky
- Computer Science Proceedings 11th Real-Time Systems Symposium
- 5 December 1990
A general criterion for the schedulability of a fixed priority scheduling of period tasks with arbitrary deadlines is given and the results are shown to provide a basis for developing predictable distributed real-time systems.
Optimal portfolio and consumption decisions for a “small investor” on a finite horizon
A general consumption/investment problem is considered for an agent whose actions cannot affect the market prices, and who strives to maximize total expected discounted utility of both consumption ...
Real-time synchronization protocols for multiprocessors
- R. Rajkumar, L. Sha, J. Lehoczky
- Computer ScienceProceedings. Real-Time Systems Symposium
- 6 December 1988
The authors investigate the synchronization problem in the context of priority-driven preemptive scheduling on shared-memory multiprocessors and proposes a task allocation scheme based on the generalized protocol.
Martingale and duality methods for utility maximization in a incomplete market
The problem of maximizing the expected utility from terminal wealth is well understood in the context of a complete financial market. This paper studies the same problem in an incomplete market…
Aperiodic task scheduling for Hard-Real-Time systems
A new algorithm is presented, the Sporadic Server algorithm, which greatly improves response times for soft deadline a periodic tasks and can guarantee hard deadlines for both periodic and aperiodic tasks.
A resource allocation model for QoS management
- R. Rajkumar, Chen Lee, J. Lehoczky, D. Siewiorek
- Computer ScienceProceedings Real-Time Systems Symposium
- 3 December 1997
This work presents an analytical model for QoS management in systems which must satisfy application needs along multiple dimensions such as timeliness, reliable delivery schemes, cryptographic security and data quality, and refers to this model as Q-RAM (QoS-based Resource Allocation Model).
On task schedulability in real-time control systems
- D. Seto, J. Lehoczky, L. Sha, K. Shin
- Computer Science17th IEEE Real-Time Systems Symposium
- 4 December 1996
This work presents an algorithm that optimizes task frequencies and then schedules the resulting tasks with the limited computing resources available and is applicable to failure recovery and reconfiguration in real-time control systems.
The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard Real-Time Environments
The Deferrable Server (DS) algorithm is introduced which will be shown to provide improved aperiodic response time performance over traditional background and polling approaches and significantly reduced response times of a periodic tasks while still maintaining guaranteed periodic task deadlines.