ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Avoiding unbounded priority inversion in barrier protocols using gang priority management

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Harald Röck University of Salzburg
Joshua Auerbach IBM Research
Christoph M. Kirsch University of Salzburg
David F. Bacon IBM Research
Avoiding unbounded priority inversion in barrier protocols using gang priority management Published by ACM 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 8
· Citation Count: 0

Published in:
· Proceeding
JTRES '09 Proceedings of the 7th International Workshop on Java Technologies for Real-Time and Embedded Systems
ACM New York, NY, USA ©2009
table of contents ISBN: 978-1-60558-732-5 doi>10.1145/1620405.1620416

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder