
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Hans Vandierendonck, Koen De Bosschere, "XORBased Hash Functions," IEEE Transactions on Computers, vol. 54, no. 7, pp. 800812, July, 2005.  
BibTex  x  
@article{ 10.1109/TC.2005.122, author = {Hans Vandierendonck and Koen De Bosschere}, title = {XORBased Hash Functions}, journal ={IEEE Transactions on Computers}, volume = {54}, number = {7}, issn = {00189340}, year = {2005}, pages = {800812}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2005.122}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  XORBased Hash Functions IS  7 SN  00189340 SP800 EP812 EPD  800812 A1  Hans Vandierendonck, A1  Koen De Bosschere, PY  2005 KW  Index Terms XORbased hash function KW  conflictfree mapping KW  null space KW  column space KW  skewedassociative cache KW  interbank dispersion. VL  54 JA  IEEE Transactions on Computers ER   
[1] H. Vandierendonck and K. De Bosschere, “Randomized Caches for PowerEfficiency,” IEICE Trans. Electronics, vol. E86C, no. 10, pp. 21372144, 2003.
[2] D.J. Kuck, “ILLIAC IV Software and Application Programming,” IEEE Trans. Computers, vol. 17, no. 8, pp. 758770, Aug. 1968.
[3] G.S. Sohi, “HighBandwidth Interleaved Memories for Vector Processors— A Simulation Study,” IEEE Trans. Computers, vol. 42, no. 1, pp. 3444, Jan. 1993.
[4] D.J. Kuck and R.A. Stokes, “The Burroughs Scientific Processor (BSP),” IEEE Trans. Computers, vol. 31, no. 5, pp. 363376, May 1982.
[5] D.H. Lawrie and C.R. Vora, “The Prime Memory System for Array Access,” IEEE Trans. Computers, vol. 31, no. 5, pp. 435442, May 1982.
[6] Q.S. Gao, “The Chinese Remainder Theorem and the Prime Memory System,” Proc. 20th Ann. Int'l Symp. Computer Architecture, pp. 337340, May 1993.
[7] M. Kharbutli, K. Irwin, Y. Solihin, and J. Lee, “Using Prime Numbers for Cache Indexing to Eliminate Conflict Misses,” Proc. 10th Int'l Symp. High Performance Computer Architecture, pp. 288299, Feb. 2004.
[8] A. Seznec and J. Lenfant, “Odd Memory Systems May Be Quite Interesting,” Proc. 20th Ann. Int'l Symp. Computer Architecture, pp. 341350, May 1993.
[9] B.R. Rau, “PseudoRandomly Interleaved Memory,” Proc. 18th Ann. Int'l Symp. Computer Architecture, pp. 7483, May 1991.
[10] R. Raghavan and J.P. Hayes, “On Randomly Interleaved Memories,” SC90: Proc. Supercomputing '90, pp. 4958, Nov. 1990.
[11] J.M. Frailong, W. Jalby, and J. Lenfant, “XORSchemes: A Flexible Data Organization in Parallel Memories,” Proc. 1985 Int'l Conf. Parallel Processing, pp. 276283, Aug. 1985.
[12] F. Bodin and A. Seznec, “Skewed Associativity Improves Program Performance and Enhances Predictability,” IEEE Trans. Computers, vol. 46, no. 5, pp. 530544, May 1997.
[13] M. Schlansker, R. Shaw, and S. Sivaramakrishnan, “Randomization and Associativity in the Design of PlacementInsensitive Caches,” Technical Report HPL9341, HP Laboratories, June 1993.
[14] N. Topham and A. González, “Randomized Cache Placement for Eliminating Conflicts,” IEEE Trans. Computers, vol. 48, no. 2, pp. 185192, Feb. 1999.
[15] A. Seznec, “A New Case for SkewedAssociativity,” Technical Report PI1114, IRISA, July 1997.
[16] P. Michaud, “A Statistical Model for SkewedAssociativity,” Proc. Third Int'l Symp. Performance Analysis of Systems and Software, pp. 204213, Mar. 2003.
[17] A. Seznec, “A Case for TwoWay Skewed Associative Caches,” Proc. 20th Ann. Int'l Symp. Computer Architecture, pp. 169178, May 1993.
[18] H. Vandierendonck and K. De Bosschere, “TradeOffs for SkewedAssociative Caches,” Proc. Int'l Conf. Parallel Computing (ParCo2003), Aug. 2003.
[19] S. McFarling, “Combining Branch Predictors,” Technical Report WRLTN36, Western Research Laboratory, Palo Alto, Calif., June 1993.
[20] T.Y. Yeh and Y.N. Patt, “TwoLevel Adaptive Training Branch Prediction,” Proc. 24th Conf. Microprogramming and Microarchitecture, pp. 5161, Nov. 1991.
[21] C. Young, N. Gloy, and M.D. Smith, “A Comparative Analysis of Schemes for Correlated Branch Prediction,” Proc. 22nd Ann. Int'l Symp. Computer Architecture, pp. 276286, June 1995.
[22] T. Juan, S. Sanjeevan, and J.J. Navarro, “Dynamic HistoryLength Fitting: A Third Level of Adaptivity for Branch Prediction,” Proc. 25th Ann. Int'l Symp. Computer Architecture, pp. 155166, 1998.
[23] S. Sechrest, C.C. Lee, and T. Mudge, “Correlation and Aliasing in Dynamic Branch Predictors,” Proc. 23rd Ann. Int'l Symp. Computer Architecture, pp. 2232, May 1996.
[24] A.J. Smith, “Cache Memories,” ACM Computing Surveys, vol. 14, no. 3, pp. 473530, Sept. 1982.
[25] Z. Zhang, Z. Zhu, and X. Zhang, “A PermutationBased Page Interleaving Scheme to Reduce RowBuffer Conflicts and Exploit Data Locality,” Proc. 33rd Conf. Microprogramming and Microarchitecture, pp. 3241, Dec. 2000.
[26] G. Birkhoff and T.C. Bartee, Modern Applied Algebra. McGrawHill, 1970.
[27] P.R. Halmos, FiniteDimensional Vector Spaces. Van Nostrand Reinhold, 1958.
[28] M.D. Hill and A.J. Smith, “Evaluating Associativity in CPU Caches,” IEEE Trans. Computers, vol. 38, no. 12, pp. 16121630, Dec. 1989.
[29] H. Vandierendonck and K. De Bosschere, “Evaluation of the Performance of Polynomial Set Index Functions,” Proc. Workshop Duplicating, Deconstructing, and Debunking, pp. 3141, May 2002.
[30] H. Vandierendonck, “Avoiding Mapping Conflicts in Microprocessors,” PhD dissertation, Ghent Univ., 2004.
[31] A. González, M. Valero, N. Topham, and J.M. Parcerisa, “Eliminating Cache Conflict Misses through XORBased Placement Functions,” Proc. 1997 Int'l Conf. Supercomputing, pp. 7683, July 1997.
[32] P. Michaud, A. Seznec, and R. Uhlig, “Trading Conflict and Capacity Aliasing in Conditional Branch Predictors,” Proc. 24th Ann. Int'l Symp. Computer Architecture, June 1997.
[33] A. Seznec, S. Felix, V. Krishnan, and Y. Sazeides, “Design TradeOffs for the Alpha EV8 Conditional Branch Predictor,” Proc. 29th Ann. Int'l Symp. Computer Architecture, pp. 295306, June 2002.
[34] F. MacWilliams and N. Sloane, The Theory of ErrorCorrecting Codes. NorthHolland, 1978.
[35] W. Peterson, ErrorCorrecting Codes. MIT Press, 1961.