By Topic

Synchronization for an optimal real-time scheduling algorithm on multiprocessors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hyeonjoong Cho ; ETRI Daejoen, Daejoen ; Ravindran, B. ; Jensen, E.D.

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.

Published in:

Industrial Embedded Systems, 2007. SIES '07. International Symposium on

Date of Conference:

4-6 July 2007