How caching affects hashing

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics

Volumn , Issue , 2005, Pages 141-154

  Heileman, Gregory L ^a   Luo, Wenbin ^b  

^a University of New Mexico   (United States)

^b ST MARY'S UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER MEMORY; DATA ELEMENTS; LINEAR PROBING;

ALGORITHMS; INFORMATION ANALYSIS; STORAGE ALLOCATION (COMPUTER);

BUFFER STORAGE;

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

References (22)

1. Andrew Binstock. Hashing rehashed: Is RAM speed making your hashing less efficient? Dr. Dobb's Journal, 4(2), April 1996.
2. John R. Black, Jr., Charles U. Martel, and Hongbin Qi. Graph and hashing algorithms for modern architectures: Design and performance. In Kurt Mehlhorn, editor, Proceedings of the 2nd Workshop on Algorithm Engineering (WAE'98), Saarbrücken, Germany, August 1998.
3. Andrei Broder and Michael Mitzenmacher. Using multiple hash functions to improve IP lookups. In Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM 2001), Anchorage, AK, April 2001.
4. Randal E. Bryant and David O'Hallaron. Computer Systems: A Programmer's Perspective. Prentice-Hall, Inc., Upper Saddle River, NJ, 2003.
5. J. Lawrence Carter and Mark N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18(2): 143-154, 1979.
6. Trishul M. Chilimbi, James R. Larus, and Mark D. Hill. Tools for cache-conscious pointer structures. In Proceedings of the 1999 A CM SIGPLAN Conference on Programming Language Design and Implementation, Atlanta, GA, May 1999.
7. Thomas M. Cover and Joy A. Thomas. Elements of Information Theory. John Wiley & Sons, Inc., New York, 1991.
8. The fifth DIMACS challenge-dictionary tests, Center for Discrete Mathematics & Theoretical Computer Science, http://www.cs.aaherst.edu/~ccm/ challengeS/dicto/.
9. L. Guibas and E. Szemeredi. The analysis of double hashing. Journal of Computer and Systems Sciences, 16:226-274, 1978.
10. John L. Hennessy and David A. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufmann, San Francisco, 3rd edition, 2003.
11. The King James Bible (KJV) download page, http://patriot.net/~bmcgin/ kjvpage.html.
12. Donald E. Knuth. Searching and Sorting, volume The Art of Computer Programming. Addison-Wesley, Reading, MA, 3rd edition, 1973.
13. Anthony LaMarca and Richard E. Ladner. The influence of caches on the performance of heaps. ACM Journal of Experimental Algorithmics, 1(4):www.jea.acm.org/1996/LaMarcaIafluence/, 1996.
14. Anthony LaMarca and Richard E. Ladner. The influence of caches on the performance of sorting. In Proceedgins of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '97), pages 370-379, New Orleans, LA, 1997.
15. Alvin R. Lebeck and David A. Wood. Cache profiling and the SPEC benchmark: A case study. Computer, 27(10):15-26, 1994.
16. G. Lueker and M. Molodowitch. More analysis of double hashing. In Proceedings of the 20th Annual ACM Symposium on the Theory of Computing, pages 354-359, 1988.
17. Wenbin Luo and Gregory L. Heileman. Improved exponential hashing. IEICE Electronics Express, 1(7): 150-155, 2004.
18. W. W. Peterson. Addressing for random access storage. IBM Journal of Research and Development, 1(2):130-146, 1957.
19. Hongbin Qi and Charles U. Martel. Design and analysis of hashing algorithms with cache effects, http://theory.cs.ucdavis.edu/, 1998.
20. Bradely J. Smith, Gregory L. Heileman, and Chaouki T. Abdallah. The exponential hash function. ACM Journal of Experimental Algorithmics, 2(3):www.jea.acm.org/1997/SmithExponential/, 1997.
21. Jeffrey D. Ullman. A note on the efficiency of hash functions. Journal of the ACM, 19(3):569-575, 1972.
22. Andrew C. Yao. Uniform hashing is optimal. Journal of the ACM, 32(3):687-693, 1985.