ACM Home Page
Please provide us with feedback. Feedback
Response time analysis of software transactional memory-based distributed real-time systems
Full text PdfPdf (352 KB)
Source
Symposium on Applied Computing archive
Proceedings of the 2009 ACM symposium on Applied Computing table of contents
Honolulu, Hawaii
SESSION: Operating systems track table of contents
Pages 334-338  
Year of Publication: 2009
ISBN:978-1-60558-166-8
Authors
Sherif F. Fahmy  Virginia Tech, Blacksburg, VA
Binoy Ravindran  Virginia Tech, Blacksburg, VA
E. D. Jensen  The MITRE Corporation, Bedford, MA
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 60,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1529282.1529353
What is a DOI?

ABSTRACT

We consider distributed real-time systems where concurrency control is managed using software transactional memory (or STM). For such a method we propose an algorithm to compute an upper bound on the response time. We compare the result of the proposed algorithm to a simulation of the system being studied in order to determine its efficacy. The results of our study indicate that it is possible to provide timeliness assurances for systems programmed using STM.


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
J. Anderson, S. Ramamurthy, M. Moir, and K. Jeffay. Lock-free transactions for real-time systems. In Real-Time Databases: Issues and Applications. Amsterdam: Kluwer Academic Publishers., 1997.
 
4
J. Bobba, R. Rajwar, and M. Hill. Transactional memory biblography. http://www.cs.wisc.edu/trans-memory/biblio/swtm.html.
5
 
6
 
7
 
8
M. Herlihy and Y. Sun. Distributed transactional memory for metric-space networks. Distributed Computing, 20(3): 195--208, 2007.
 
9
 
10
 
11
12
 
13
 
14
P. Pagano, P. Batra, and G. Lipari. A framework for modeling operating system mechanisms in the simulation of network protocols for real-time distributed systems. IPDPS, 0: 160, 2007.
 
15
J. Palencia and M. G. Harbour. Offset-based response time analysis of distributed systems scheduled under edf. ECRTS, 00: 3, 2003.
 
16
 
17
R. Pellizzoni and G. Lipari. Improved schedulability analysis of real-time transactions with earliest deadline scheduling. RTAS, pages 66--75, 2005.
 
18
M. Spuri. Analysis of deadline scheduled real-time systems. Technical report, In Rapport de Recherche RR-2772, INRIA, 1996.
 
19
H. Sutter. The free lunch is over: A fundamental turn toward concurrency in software. Dr. Dobb's Journal, 30(3), 2005.
 
20

Collaborative Colleagues:
Sherif F. Fahmy: colleagues
Binoy Ravindran: colleagues
E. D. Jensen: colleagues