E. Douglas Jensen
Research Subjects
E. Douglas Jensen has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Binoy Ravindran
Virginia Tech, Blacksburg, USA
3 shared publications - Hyeonjoong Cho
ETRI, Daejoen, South Korea
2 shared publications - Chewoo Na
Virginia Tech, Blacksburg
1 shared publication - Hyeonjoong Cho
Virginia Tech
1 shared publication
Latest Publications
- 1 January 2008
- Published by Springer Nature
- p. 73-85
Lock-Free Synchronization for Dynamic Embedded Real-Time Systems
- 1 January 2008
- Published by Springer Nature
- p. 73-85
Lock-Free Synchronization for Dynamic Embedded Real-Time Systems
- 1 July 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21503109,p. 9-16
Synchronization for an optimal real-time scheduling algorithm on multiprocessors
We consider several object sharing synchronization mechanisms including lock-based, lock-free, and wait-free sharing for LNREF [1], an optimal real-time scheduling algorithm on multiprocessors. We derive LNREF's minimum-required space cost for wait-free synchronization using the space-optimal wait-free algorithm. We then establish the feasibility conditions for lock-free and lock-based sharing under LNREF, and the concomitant tradeoffs. While the tradeoff between wait-free versus the other sharing is obvious, i.e., space and time costs, we show that the tradeoff between lock-free and lock-based sharing for LNREF hinges on the cost of the lock-free retry, blocking time under lock-based. Finally, we numerically evaluate lock-free and lock-based sharing for LNREF.
- 1 July 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21503109,p. 9-16
Synchronization for an optimal real-time scheduling algorithm on multiprocessors
We consider several object sharing synchronization mechanisms including lock-based, lock-free, and wait-free sharing for LNREF [1], an optimal real-time scheduling algorithm on multiprocessors. We derive LNREF's minimum-required space cost for wait-free synchronization using the space-optimal wait-free algorithm. We then establish the feasibility conditions for lock-free and lock-based sharing under LNREF, and the concomitant tradeoffs. While the tradeoff between wait-free versus the other sharing is obvious, i.e., space and time costs, we show that the tradeoff between lock-free and lock-based sharing for LNREF hinges on the cost of the lock-free retry, blocking time under lock-based. Finally, we numerically evaluate lock-free and lock-based sharing for LNREF.
- 15 April 2007
- Published by Springer Nature in Real-Time Systems
- Vol. 36 (1-2) , 23-46
On scheduling garbage collector in dynamic real-time systems with statistical timing assurances
- 15 April 2007
- Published by Springer Nature in Real-Time Systems
- Vol. 36 (1-2) , 23-46
On scheduling garbage collector in dynamic real-time systems with statistical timing assurances