ACM Home Page
Please provide us with feedback. Feedback
Lock-free synchronization for dynamic embedded real-time systems
Full text PdfPdf (369 KB)
Source Design, Automation, and Test in Europe archive
Proceedings of the conference on Design, automation and test in Europe: Proceedings table of contents
Munich, Germany
SESSION: Scheduling for real-time and energy table of contents
Pages: 438 - 443  
Year of Publication: 2006
ISBN:3-9810801-0-6
Authors
Hyeonjoong Cho  Virginia Tech, Blacksburg, VA
Binoy Ravindran  Virginia Tech, Blacksburg, VA
E. Douglas Jensen  The MITRE Corporation Bedford, MA
Sponsors
: The EDA Consortium
EDAA : European Design and Automation Association
IEEE-CS\DATC : The IEEE Computer Society
Publisher
European Design and Automation Association  3001 Leuven, Belgium, Belgium
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 47,   Citation Count: 0
Additional Information:

abstract   references   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   

ABSTRACT

We consider lock-free synchronization for dynamic embedded real-time systems that are subject to resource overloads and arbitrary activity arrivals. We model activity arrival behaviors using the unimodal arbitrary arrival model (or UAM). UAM embodies a stronger "adversary" than most traditional arrival models. We derive the upper bound on lock-free retries under the UAM with utility accrual scheduling the first such result. We establish the tradeoffs between lock-free and lock-based sharing under UAM. These include conditions under which activities' accrued timeliness utility is greater under lock-free than lock-based, and the consequent upper bound on the increase in accrued utility that is possible with lock-free. We confirm our analytical results with a POSIX RTOS implementation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
3
 
4
J. Chen and A. Burns. Asynchronous data sharing in multiprocessor real-time systems using process consensus. In 10th Euromicro Workshop on Real-Time System, 1998.
 
5
 
6
 
7
R. K. Clark, E. D. Jensen, and N. F. Rouquette. Software organization to facilitate dynamic processor scheduling. In IEEE WPDRTS, April 2004.
 
8
 
9
 
10
E. D. Jensen, C. D. Locke, and H. Tokuda. A time-driven scheduling model for real-time systems. In IEEE RTSS, pages 112--122, December 1985.
 
11
H. Kopetz and J. Reisinger. The non-blocking write protocol nbw: A solution to a real-time synchronisation problem. In IEEE RTSS, pages 131--137, 1993.
 
12
13
 
14
 
15
 
16
 
17
R. K. Treiber. System programming: Copying with parallelism. Technical report, IBM Almaden Research Center, April 1986. RJ 5118.
18
 
19
H. Wu, B. Ravindran, et. al. Utility accrual scheduling under arbitrary time/utility functions and multiunit resource constraints. In IEEE RTCSA, August 2004.
 
20
H. Cho. Utility Accrual Scheduling with Non-Blocking Synchronization on Uniprocessors and Multiprocessors. In PhD Dissertation Proposal, ECE Dept., Virginia Tech, 2005, http://www.ee.vt.edu/~realtime/cho-proposal05.pdf.
Collaborative Colleagues:
Hyeonjoong Cho: colleagues
Binoy Ravindran: colleagues
E. Douglas Jensen: colleagues