A design of a parallel dictionary using skip lists

Theoretical Computer Science

Volumn 158, Issue 1-2, 1996, Pages 1-33

  Gabarró, Joaquim ^a   Martínez, Conrado ^a   Messeguer, Xavier ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); DATA STRUCTURES; DATABASE SYSTEMS; ITERATIVE METHODS; PARALLEL ALGORITHMS; RANDOM ACCESS STORAGE; REAL TIME SYSTEMS;

EREW PRAM; PARALLEL DICTIONARY; REAL MACHINES; SKIP LISTS;

PARALLEL PROCESSING SYSTEMS;

EID: 0030149264     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(94)00288-6     Document Type: Article

References (30)

1. M.J. Atallah and S. Rao Kosaraju, A generalized dictionary machine for VLSI, IEEE Trans. Comput. C-34 (2) (1985) 151-155.
2. H. Bast, M. Dietzfelbinger and T. Hagerup, A perfect parallel dictionary, in: I.M. Havel and V. Koubek, eds., Proc. 17th Math. Foundations Comput. Sci. Lecture Notes in Computer Science, Vol. 598 (Springer, Berlin, 1992) 133-141.
3. G.E. Blelloch, Scans as primitive parallel operations, IEEE Trans. Comput. 38 (11) (1989) 1526-1538.
4. L. Bougé, Y. Le Guyadec, G. Ultard and B. Virot, A proof system for a simple data-parallel programming language, in: C. Girault, ed., Proc. IFIP WG10.3 Internat. Conf. on Appl. in Parallel and Distributed Computing (Elsevier, Amsterdam, 1994).
5. H. Chernoff, A measure of asymptotic efficiency for tests of hypothesis based on sum of observations, Ann. Math. Statist. 23 (1952) 493-507.
6. L. Devroye, A limit theory for random skip lists, Ann. Appl. Probab. 2 (3) (1992) 597-609.
7. M. Dietzfelbinger and F. Meyer aur der Heide, Dynamic hashing in real time, in: J. Buchmann, H. Ganzinger and J.W. Paul, eds., Informatik. Festschrift zum 60. Geburtstag von Günter Hotz. Teubner-Texte zur Informatik 1 (B.G. Teubner, Leipzig, 1992); also in Proc. 17th ICALP, Lecture Notes in Computer Science, Vol. 443 (Springer, Berlin, 1990).
8. M. Dietzfelbinger and F. Meyer aur der Heide, Dynamic hashing in real time, in: J. Buchmann, H. Ganzinger and J.W. Paul, eds., Informatik. Festschrift zum 60. Geburtstag von Günter Hotz. Teubner-Texte zur Informatik 1 (B.G. Teubner, Leipzig, 1992); also in Proc. 17th ICALP, Lecture Notes in Computer Science, Vol. 443 (Springer, Berlin, 1990).
9. M. Dietzfelbinger and F. Meyer auf der Heide, An optimal parallel dictionary, Inform. Control. 102 (2) (1993) 196-217.
10. T. Duboux, A. Ferreira and M. Gastado, MIMD dictionary machines: from theory to practice, in: L. Bougé, M. Cosnard, Y. Robert and D. Trystram, eds., Proc. 2nd Joint Internat. Conf. on Vector and Parallel Processing (CONPAR92-VAPPV) Lecture Notes in Computer Science, Vol. 634 (Springer, Berlin, 1992) 545-550.
11. J. Gabarró and R. Gavaldà, An approach to correctness of data parallel algorithms, J. Parallel and Distributed Computing 22 (1994) 185-201.
12. J. Gabarró, C. Martínez and X. Messeguer, Parallel update and search in skip lists, in: R. Baeza-Yates, ed., Computer Science 2: Research and Applications (Plenum, New York, 1994) 15-26.
13. M. Gastaldo, Dictionary machine on SIMD archictectures, Tech. Report. 93-19, Laboratoire de l'Informatique du Parallélisme (LIP), 1993.
14. J. Gil, Y. Matias and U. Vishkin, Towards a theory of nearly constant time parallel algorithms, in: Proc. 32nd Foundations of Comput. Sci. (1991) 698-710.
15. L. Higham and E. Schenk, Maintaining B-trees on an EREW PRAM, J. Parallel and Distributed Computing 22 (1994) 329-335.
16. W.D. Hillis and G.L. Steele Jr., Data parallel algorithms, Comm. ACM 29 (12) (1986) 1170-1183.
17. P. Kirschenhofer, C. Martínez and H. Prodinger, Analysis of an optimized search algorithm for skip lists, Theoret. Comput. Sci. 144 (1995) 199-220.
18. P. Kirschenhofer and H. Prodinger, The path length of random skip lists, Acta Inform. 31 (8) (1994) 775-792.
19. C.E. Leiserson, Area-efficient VLSI computation, Ph.D. Thesis, Carnegie-Mellon University, 1981, ACM Doctoral Dissertation Award 1982 (MIT Press, 1983).
20. X. Messeguer, A sequential and parallel implementation of skip lists, Tech. Report LSI-94-41-R, LSI-UPC, 1994.
21. T. Papadakis, Skip lists and probabilistic analysis of algorithms, Ph.D. Thesis, University of Waterloo, 1993, available as Tech. Report CS-93-28.
22. T. Papadakis, Skip lists and probabilistic analysis of algorithms, Ph.D. Thesis, University of Waterloo, 1993, available as Tech. Report CS-93-28.
23. T. Papadakis, J.I. Munro and P.V. Poblete, Analysis of the expected search cost in skip lists, in: J.R. Gilbert and R. Karlsson, eds., Proc. 2nd Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Vol. 447 (Springer, Berlin, 1990) 160-172.
24. W. Paul, U. Vishkin and H. Wagener, Parallel computation on 2-3 trees, in: J. Diaz, ed., Proc. 10th Internat. Colloquium on Automata, Programming and Languages, Lecture Notes in Computer Science, Vol. 154 (Springer, Berlin, 1983) 597-609.
25. W. Paul, U. Vishkin and H. Wagener, Parallel computation on 2-3 trees, RAIRO Inform. Théor. (1983) 398-404.
26. W. Pugh, A skip list cookbook, Tech. Report CS-TR-2286.1, Institute for Advanced Computer Studies, Department of Computer Science, University of Maryland, College Park, MD, 1990, also published as UMIACS-TR-89-72.1.
27. W. Pugh, Skip lists: a probabilistic alternative to balanced trees, Comm. ACM 33 (6) (1990) 668-676.
28. J.T. Schwartz, Ultracomputers, ACM Trans. Programming Languages Sys. 2 (4) (1980) 484-521.
29. S. Sen, Some observations on skip-lists, Inform. Process Lett. 39 (3) (1991) 173-176.
30. Thinking Machines Corporation, Cambridge, MA, C* Programming Guide. Version 6.0.2, 1991.