Sciweavers

Share
SIES
2007
IEEE

Synchronization for an optimal real-time scheduling algorithm on multiprocessors

9 years 6 months ago
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 waitfree 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.
Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen
Added 04 Jun 2010
Updated 04 Jun 2010
Type Conference
Year 2007
Where SIES
Authors Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen
Comments (0)
books