|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
14 th Euromicro Conference on Real-Time Systems (ECRTS'02)
Object Sharing in Pfair-scheduled Multiprocessor Systems
Vienna, Austria
June 19-June 21
ISBN: 0-7695-1665-3
| ASCII Text | x | ||
| Philip Holman, James H. Anderson, "Object Sharing in Pfair-scheduled Multiprocessor Systems," 2012 24th Euromicro Conference on Real-Time Systems, pp. 111, 14 th Euromicro Conference on Real-Time Systems (ECRTS'02), 2002. | |||
| BibTex | x | ||
| @article{ 10.1109/EMRTS.2002.1019191, author = {Philip Holman and James H. Anderson}, title = {Object Sharing in Pfair-scheduled Multiprocessor Systems}, journal ={2012 24th Euromicro Conference on Real-Time Systems}, volume = {0}, year = {2002}, issn = {1068-3070}, pages = {111}, doi = {http://doi.ieeecomputersociety.org/10.1109/EMRTS.2002.1019191}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 24th Euromicro Conference on Real-Time Systems TI - Object Sharing in Pfair-scheduled Multiprocessor Systems SN - 1068-3070 SP EP A1 - Philip Holman, A1 - James H. Anderson, PY - 2002 KW - null VL - 0 JA - 2012 24th Euromicro Conference on Real-Time Systems ER - | |||
We consider the problem of object sharing in Pfair-scheduled multiprocessor systems. We primarily focus on systems that use lock-free shared objects, although some lock-based alternatives are briefly considered as well. Our work demonstrates that the tight synchrony that exists in Pfair-scheduled systems can be exploited to reduce object-sharing overheads when lock-free objects are used.
Citation:
Philip Holman, James H. Anderson, "Object Sharing in Pfair-scheduled Multiprocessor Systems," ecrts, pp.111, 14 th Euromicro Conference on Real-Time Systems (ECRTS'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.