Object sharing in Pfair-scheduled multiprocessor systems
Philip Holman, James Horton Anderson · 2003
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.