상세정보
학술대회
Synchronization for an Optimal Real-time Scheduling Algorithm on Multiprocessors
- 저자
- 조현중, Binoy Ravindran, Binoy Ravindran
- 발행일
- 200707
- 출처
- International Symposium on Industrial Embedded Systems (SIES) 2007, pp.9-16
- 협약과제
- 06DD1100, 감시정찰 센서네트워크 개발, 김내수
- 초록
- 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. © 2007 IEEE.
- KSP 제안 키워드
- Blocking time, Optimal real-time scheduling, Scheduling algorithm, Synchronization Mechanism, Wait-free algorithm, Wait-free synchronization, lock-free, object sharing