Efficient hardware hashing functions for high performance computers

IEEE Transactions on Computers

Volumn 46, Issue 12, 1997, Pages 1378-1381

  Ramakrishna, M V ^a   Fu, E ^b   Bahcekapili, E ^b  

^a RMIT UNIVERSITY   (Australia)

^b Michigan State University   (United States)

Author keywords

Hashing in hardware; High performance computer architecture; High speed information storage and retrieval; Page address translation; Signature functions

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER HARDWARE; COMPUTER SIMULATION; INFORMATION RETRIEVAL SYSTEMS; LOGIC CIRCUITS; MATHEMATICAL MODELS; REAL TIME SYSTEMS;

HARDWARE HASHING FUNCTIONS; HIGH PERFORMANCE COMPUTERS; PAGE ADDRESS TRANSLATION; SIGNATURE FUNCTIONS;

DATA PROCESSING;

EID: 0031366315     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.641938     Document Type: Article

References (15)

1. D. Knuth, The Art of Computer Programming, vol. 3. Reading, Mass.: Addison-Wesley, 1973.
2. M.V. Ramakrishna, "Hashing in Practice, Analysis of Hashing and Universal Hashing," Proc. ACM SIGMOD Conf., pp. 191-199, 1988.
3. L. Carter and M. Wegman, "Universal Classes of Hashing Functions," J. Computer and System Sciences, vol. 18, no. 2, pp. 143-154, 1979.
4. M. Benhase, "Resetting Storage Unit Directories," IBM Technical Disclosure Bulletin, vol. 25, no. 7B, pp. 3,760-3,761, 1982.
5. H. Robinson and G. Taylor, "Hashing Addresses to a Cache on DASD," IBM Technical Disclosure Bulletin, vol. 24, no. 11A, pp. 5,354-5,356, 1982.
6. R. Bryant, "Extendible Hashing for Line-Oriented Paging Stores," IBM Technical Disclosure Bulletin, vol. 26, no. 11, pp. 6,046-6,049, 1984.
7. K. Ramamoganarao and R. Sacks-Davis, "Hardware Address Translation for Machines with a Large Virtual Memory," Information Processing Letters, vol. 13, no. 1, pp. 23-29, 1981.
8. M. Houdek and G. Mitchell, "Translating a Large Virtual Address," IBM Systems/38 Technical Developments, pp. 22-24, 1978.
9. J. Cocke and W. Worley, "Virtual to Real Address Translation Using Hashing," IBM Technical Disclosure Bulletin, vol. 24, no. 6, pp. 2,724-2,726, 1981.
10. A. Chang and M. Mergen, "801 Storage: Architecture and Programming," ACM Trans. Computer Systems, vol. 6, no. 1, pp. 28-50, 1988.
11. J. Huck and J. Hays, "Architectural Support for Translation Table Management in Large Address Space Machine," Proc. 20th Int'l Symp. Computer Architecture, pp. 39-50, May 1993.
12. G. Gonnet, "Expected Length of the Longest Probe Sequence in Hash Code Searching," J. ACM, vol. 28, no. 2, pp. 289-304, 1981.
13. P. Larson, "Expected Worst-Case Performance of Hash Files," The Computer J., vol. 25, no. 3, pp. 347-352, 1982.
14. M.V. Ramakrishna, E. Fu, and E. Bahcekapili, "Efficient Hardware Hashing Design for High Performance Computers," Technical Report TR-96-13, Computer Science Dept., RMIT, Melbourne, Australia, 1996.
15. D. Knuth, The Art of Computer Programming, vol. 2. Reading, Mass.: Addison-Wesley, 1969.