Jeannette M. Wing and Chun Gong. A library of concurrent objects. CMU CS TR 90-151, School of Computer Science, Carnegie Mellon University, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Fast Interrupt Priority Management in Operating System.. - Stodolsky, Chen, Bershad (1993) (28 citations) (Correct)
....blocking operations (e.g. device status register polling) While this approach can lead to a high performance operating systems, difficulties inherent in this code style have prevented its widespread use. Recent research has demonstrated the use of highly concurrent lock free data structures [19, 20]. A system using lock free synchronization can be free from data corruption, deadlock and priority inversion even in the case of interrupts [21] In addition, lock free data structures provide the necessary synchronization for both multiprocessors and nonpreemptive execution. Consequently, ....
Jeannette M. Wing and Chun Gong. A library of concurrent objects. CMU CS TR 90-151, School of Computer Science, Carnegie Mellon University, 1992.
A Revisitation of Kernel Synchronization Schemes - Christopher Small (1997) (1 citation) (Correct)
....using atomicity for synchronization, although we make no assumptions about real time behavior of the system as a whole. Synchronization does not require locking; other techniques have been proposed. For example, nonblocking synchronization [Herl90, Mass91, Green96] lock free data structures [Wing92], and restartable atomic sequences [Bers92] are novel techniques proposed for synchronization. Some of these schemes require special hardware support, such as a compareand swap instruction, which is not available on all processors (e.g. the MIPS R3000 and the Intel i386) These techniques are ....
Wing, J, Gong, C, "A Library of Concurrent Objects," CMU CS TR 90-151, School of Computer Science, Carnegie Mellon University (1992).
Fast Interrupt Priority Management in Operating System Kernels - Stodolsky (1993) (28 citations) (Correct)
....operations (e.g. device status register polling) While this approach can lead to a high performance operating systems, difficulties inherent in this code style have prevented its widespread use. Recent research has demonstrated the use of highlyconcurrent lock free data structures [Herlihy 90, Wing Gong 92] A system using lock free synchronization can be free from data corruption, deadlock and priority inversion even in the case of interrupts [Massalin Pu 91] In addition, lock free data structures provide the necessary synchronization for both multiprocessors and non preemptive execution. ....
Wing, J. M. and Gong, C. A Library of Concurrent Objects. CMU CS TR 90-151, School of Computer Science, Carnegie Mellon University, 1992.
A Revisitation of Kernel Synchronization Schemes - Small, Manley (1997) (1 citation) (Correct)
....although we make no assumptions about real time behavior of the system as a whole. Synchronization does not require atomicity; other techniques have been proposed for synchronizing data structure access. For example, lock free synchronization [Herl90, Mass91] lock free data structures [Wing92], and restartable atomic sequences [Bers92] are novel techniques proposed for synchronization. They work well in environments where critical sections are rarely interrupted and contention is minimal. Some of these schemes require special hardware support, such as compare and swap, which is not ....
Wing, J, Gong, C, "A Library of Concurrent Objects," CMU CS TR 90-151, School of Computer Science, Carnegie Mellon University (1992).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC