C. P. Kruskal, L. Rudolph and M. Snir, "E#cient Synchronization on Multiprocessors with Shared Memory," Proceedings of the 5th Annual ACM Symposium on Principles of Distributed Computing, pp. 218--228, August 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Algorithms for Scalable Synchronization on Shared-Memory.. - Mellor-Crummey, Scott (1990) (25 citations) (Correct)
....a large number of operations to coordinate concurrent invocations of synchronization primitives [12, 23, 29] Modern multiprocessors generally include more sophisticated atomic operations, permitting simpler and faster coordination strategies. Particularly common are various fetch and operations [20], which atom1 ically read, modify, and write a memory location. Fetch and operations include test and set, fetch and store (swap) fetch and add, and compare and swap. More recently, there have been proposals for multistage networks that combine concurrent accesses to the same memory location ....
C. P. Kruskal, L. Rudolph, and M. Snir. Ecient synchronization on multiprocessors with shared memory. In Proc. of the 5th Annual ACM Symposium on Principles of Distributed Computing, pages 218-228, 1986.
Can an Operation Both Update the State and Return a Meaningful.. - Hoepman (2001) (Correct)
....that only objects as strong as RMW objects do not have wait free implementation in the asynchronous PRAM model. Key words: distributed computing, fault tolerance, parallel processing, asynchronous PRAM model, shared memory, read modify write objects. 1 Introduction A Read Modify Write (RMW) KRS86] object is a strong synchronisation primitive that allows one to atomically read and update the contents of a shared memory object. Indeed, their synchronisation properties are so strong that it can be shown that these objects do not have a wait free implementation in the asynchronous PRAM model ....
Kruskal, C. P., Rudolph, L., and Snir, M. Ecient synchronization on multiprocessors with shared memory. In 5th Ann. Symp. on Principles of Distributed Computing (Calgary, Alb., Canada, 1986), ACM Press, pp. 218-228.
A Combinatorial Treatment of Balancing Networks - Busch, al. (1999) (14 citations) (Correct)
.... problems include assigning successive memory addresses to processors [18] balancing the computational load on a computer system while minimizing the maximum load on a server [6,35,37,39] and implementing barrier data structures in order to synchronize processes operating at di erent speeds [1, 24, 30,32]. In a seminal paper, Aspnes et al. 5] proposed balancing networks as a new approach to solving balancing problems. Balancing networks, resembling comparator networks (see, e.g. 15, Chapter 28] or [29, Section 5.3.4] are constructed from simple multi input, multioutput computing elements ....
C. P. Kruskal, L. Rudolph and M. Snir, \Ecient Synchronization on Multiprocessors with Shared Memory," Proceedings of the 5th Annual ACM Symposium on Principles of Distributed Computing, pp. 218-228, August 1986.
A Combinatorial Treatment of Balancing Networks - Busch (1994) (14 citations) (Correct)
.... problems include assigning successive memory addresses to processors [18] balancing the computational load on a computer system while minimizing the maximum load on a server [6, 35, 37, 39] and implementing barrier data structures in order to synchronize processes operating at di erent speeds [1, 24, 30, 32]. In a seminal paper, Aspnes et al. 5] proposed balancing networks as a new approach to solving balancing problems. Balancing networks, resembling comparator networks (see, e.g. 15, Chapter 28] or [29, Section 5.3.4] are constructed from simple multi input, multioutput computing elements ....
C. P. Kruskal, L. Rudolph and M. Snir, \Ecient Synchronization on Multiprocessors with Shared Memory," Proceedings of the 5th Annual ACM Symposium on Principles of Distributed Computing, pp. 218-228, August 1986.
Lower Bounds in Distributed Computing - Fich, Ruppert (2000) (1 citation) (Correct)
....7.3. 6.2 Decidability of Consensus Numbers For some natural classes of types, decision procedures for consensus number do exist. They follow from theorems that characterize types in the class in terms of their consensus number. One such class consists of the read modify write (RMW) object types [76]. A RMW operation updates the state of the object by applying some function, and returns the old value of the state. For example, the test set operation is a RMW operation that applies the function f(x) 1, and fetch add applies the function f(x) x 1. Other RMW operations include read and ....
Clyde P. Kruskal, Larry Rudolph, and Marc Snir. Ecient synchronization on multiprocessors with shared memory. ACM Transactions on Programming Languages and Systems, 10(4), pages 579-601, October 1988.
The Cost of Concurrent, Low-Contention Read-Modify-Write - Busch, Mavronicolas, Spirakis (Correct)
No context found.
C. P. Kruskal, L. Rudolph and M. Snir, "E#cient Synchronization on Multiprocessors with Shared Memory," Proceedings of the 5th Annual ACM Symposium on Principles of Distributed Computing, pp. 218--228, August 1986.
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