f-Arrays: Implementation and applications

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2002, Pages 270-279

  Jayanti, Prasad ^a  

^a DARTMOUTH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARRAYS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; MULTIPROCESSING SYSTEMS; OBJECT ORIENTED PROGRAMMING;

CRITICAL SECTION; MULTIWRITER SNAPSHOT OBJECT;

ALGORITHMS;

EID: 0036949548     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., and Shavit, N. Atomic snapshots of shared memory. In Proceedings of the 9th Annual Symposium on Principles of Distributed Computing (1990), pp. 1-14.
2. Afek, Y., Dauber, D., and Touitou, D. Wait-free made fast. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing (1995), pp. 538-547.
3. Anderson, J. Multi-writer composite registers. Distributed Computing 7, 4 (1994), 175-195.
4. Anderson, J., and Kim, Y. J. Adaptive mutual exclusion with local spinning. In Proceedings of the 14th International Symposium on Distributed Computing (October 2000), pp. 29-43.
5. Anderson, J., and Moir, M. Universal constructions for large objects. In Proceedings of the 9th International Workshop on Distributed Algorithms (1995), pp. 168-182.
6. Anderson, J., and Moir, M. Universal constructions for multi-object operations. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing (August 1995), pp. 184-194.
7. Craig, T. S. Queuing spin-lock algorithms to support timing predictability. In Proceedings of the Real Time Systems Symposium (1993), pp. 148-157.
8. Herlihy, M. Wait-free synchronization. ACM TOPLAS 13, 1 (1991), 124-149.
9. Herlihy, M. A methodology for implementing highly concurrent data structures. ACM Transactions on Programming Languages and Systems 15, 5 (1993), 745-770.
10. Herlihy, M., and Wing, J. Linearizability: A correctness condition for concurrent objects. ACM TOPLAS 12, 3 (1990), 463-492.
11. Jayanti, P. Efficient constructions of LL/SC variables. Unpublished manuscript, February 2002.
12. Johnson, T., and Harathi, K. A prioritized multiprocessor spin lock. IEEE Transactions on Parallel and Distributed Systems 8, 9 (September 1997), 926-933.
13. Lamport, L. A new solution of Dijkstra's concurrent programming problem. Communications of the ACM 17, 8 (1974), 453-455.
14. Lamport, L. Concurrent reading and writing. Communications of the ACM 20, 11 (1977), 806-811.
15. Markatos, E. Multiprocessor synchronization primitives with priorities. In Proceedings of the 1991 IFAC Workshop on Real-Time Programming (1991), Pergamon Press, pp. 1-7.
16. Moir, M. Practical implementations of non-blocking synchronization primitives. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing (August 1997), pp. 219-228.
17. Peterson, G. L. Concurrent reading while writing. ACM TOPLAS 5, 1 (1983), 56-65.