Almost wait-free resizable hashtables

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

Volumn 18, Issue , 2004, Pages 681-689

  Gao, H ^a   Groote, J F ^b   Hesselink, W H ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; FAULT TOLERANT COMPUTER SYSTEMS; PROGRAM PROCESSORS; QUERY LANGUAGES; SYNCHRONIZATION;

FINITE NUMBER; HASHTABLES; ROBUST PERFORMANCE; WAIT-FREE ALGORITHMS;

MULTIPROGRAMMING;

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

References (19)

1. Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. J. ACM 37, 1990, pp. 524-548.
2. Bar-Noy, A., Dolev, D.: Shared-memory vs. message-passing in an asynchronous distributed environment. In Proc. 8th ACM Symp. on principles of distributed computing, 1989, pp. 307-318.
3. H. Gao, J.F. Groote and W.H. Hesselink.: Efficient almost wait-free parallel accessible dynamic hashtables. Technical Report CS-Report 03-03, Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands, 2003. http://www.win.tue.nl/~jfg/ articles/CS-Report03-03.pdf.
4. Groote, J.F., Hesselink, W.H., Mauw, S., Vermeulen, R.: An algorithm for the asynchronous write-all problem based on process collision. Distributed Computing 14, 2001, pp. 75-81.
5. Herlihy, M.P.: Wait-free synchronization. ACM Trans. on Program. Languages and Systems 13, 1991, pp. 124-149.
6. Herlihy, M.P. and Moss, J.E.B.: Lock-free garbage collection for multiprocessors. IEEE Transactions on Parallel and Distributed Systems 3, 1992, pp. 304-311.
7. Hesselink, W.H.: Wait-free linearization with a mechanical proof. Distributed Computing 9, 1995, pp. 21-36.
8. Hesselink, W.H.: Bounded Delay for a Free Address. Acta Informatica 33, 1996, pp. 233-254.
9. Hesselink, W.H., Groote, J.F.: Wait-free concurrent memory management by Create, and Read until Deletion (CaRuD). Distributed Computing 14, 2001, pp. 31-39.
10. http://www.cs.rug.nl/~wim/mechver/hashtable.
11. Kanellakis, P.C., Shvartsman, A.A.: Fault-tolerant parallel computation. Kluwer Academic Publishers, 1997.
12. Knuth, D.E.: The Art of Computer Programming. Part 3, Sorting and searching. Addison-Wesley, 1973.
13. Lamport, L.: The temporal logic of actions. ACM Trans. on Programming Languages and Systems 16, 1994, pp. 872-923.
14. Lynch, N.A.: Distributed Algorithms. Morgan Kaufman, San Francisco, 1996.
15. Ori Shalev, Nir Shavit: Split-Odered Lists - Lock-free Resizable Hash Tables. Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing (PODC 2003) Boston, Massachusetts, 2003.
16. Owre, S., Shankar, N., Rushby, J.M., Stringer-Calvert, D.W.J.: PVS Version 2.4 (2001). System Guide, Prover Guide, PVS Language Reference. http://pvs.csl.sri.com.
17. Valois, J.D.: Lock-free linked lists using compare- and-swap. Proceedings of the 14th Annual Principles of Distributed Computing, 1995, pp. 214-222.
18. Valois, J.D.: Implementing Lock-Free Queues, Proceedings of the Seventh International Conference on Parallel and Distributed Computing Systems, Las Vegas, October 1994, pp. 64-69.
19. Wirth, N.: Algorithms + Data Structures = Programs. Prentice Hall, 1976.