Loading...
Please wait, while we are loading the content...
Similar Documents
Abstract Implementing Wait-Free Objects on Priority-Based Systems
| Content Provider | CiteSeerX |
|---|---|
| Author | Anderson, James H. Ramamurthy, Srikanth Jain, Rohit |
| Abstract | Wait-free objects are often implemented through the use of a \helping scheme", whereby one process \helps " one or more other processes to complete an operation. This paper presents several new helping schemes that can be generally applied to e ciently implement avariety ofdi erentobjects on priority-based uniprocessor and multiprocessor systems. Examples of such systems include lock-free multiprocessor kernels and real-time systems. Our helping schemes reduce overhead by exploiting the way inwhich processes are scheduled in priority-based systems. We illustrate the use of these schemes by presenting wait-free implementations of linked lists and a multi-word compare-and-swap primitive. 1 |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Priority-based System Abstract Implementing Wait-free Object Multiprocessor System Scheme Quot Way Inwhich Process Multi-word Compare-and-swap Primitive Wait-free Object Wait-free Implementation Real-time System Lock-free Multiprocessor Kernel Implement Avariety Ofdi Erentobjects Priority-based Uniprocessor |
| Content Type | Text |
| Resource Type | Article |
