Abstract
A hashing scheme for memory interleaving, based on the properties of finite field exponentiation is presented. The scheme maps sequences of l-bit addresses to sequences of m-bit memory module numbers, with m<l. For input sequences that are in arithmetic progression, the output sequence has a provably uniform distribution on the average, and no “pathologies” for a prescribed range of strides in the input sequence. We prove bounds on the lengths of runs in the output sequence, and prove the surprising result that when m/l is bounded away from both 0 and 1, the run length can be bounded by a constant. The proposed scheme is highly amenable to fast systolic implementation.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
D. H. Lawrie and C. R. Vora: The Prime Memory System for Array Access. IEEE Transactions on Computers, Vol. TC-31, No. 5, pp. 435–442, May 1982.
J. M. Frailong, W. Jalby and J. Lenfant: XOR-Schemes: A Flexible Data Organization in Parallel Memories. Proceedings of the 1985 International Conference on Parallel Processing, pp. 276–283, August 1985.
A. Norton and E. Melton: A Class of Boolean Linear Transformations for Conflict-Free Power-of-Two Stride Access. Proceedings of the 1987 International Conference on Parallel Processing, pp. 247–254, 1987.
D. Lec: Scrambled Storage for Parallel Memory Systems. Proceedings of the 1988 International Symposium on Computer Architecture, pp. 232–239, 1988.
B. R. Rau, M. S. Schlansker and D. W. L. Yen: The Cydra 5 Stride-Insensitive Memory System. Proceedings of the 1989 International Conference on Parallel Processing, Vol. 1 pp. 242–246, August 8–12, 1989.
F. J. MacWilliams, N. J. A. Sloane: The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
R. Lidl and H. Niederreiter: Finite Fields, Encyclopedia of Mathematics and its Applications, Gian-Carlo Rota, Editor, Addison-Wesley, Reading, MA, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lempel, A., Seroussi, G. (1993). Application of finite fields to memory interleaving. In: Cohen, G., Mora, T., Moreno, O. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1993. Lecture Notes in Computer Science, vol 673. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56686-4_47
Download citation
DOI: https://doi.org/10.1007/3-540-56686-4_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56686-1
Online ISBN: 978-3-540-47630-6
eBook Packages: Springer Book Archive