The Chinese remainder theorem and the prime memory system

• Published in: International Symposium on Computer Architecture: Proceedings of the 20th annual international symposium on Computer architecture; 16-19 May 1993 pp. 337 - 340
• Main Author: Gao, Q. S.
• Format: Conference Proceeding
• Language: English
• Published: New York, NY, USA ACM 01.05.1993
• Series: ACM Conferences
• Subjects: Computer systems organization > Architectures > Distributed architectures > Grid computing; Computer systems organization > Architectures > Parallel architectures > Multicore architectures; Computer systems organization > Architectures > Serial architectures > Superscalar architectures; Computing methodologies > Modeling and simulation > Simulation types and techniques > Massively parallel and high-performance simulations; Mathematics of computing > Discrete mathematics; Mathematics of computing > Mathematical analysis > Numerical analysis > Number-theoretic computations; Software and its engineering > Software organization and properties > Software system structures > Distributed systems organizing principles > Grid computing
• ISBN: 0818638109; 9780818638107
• DOI: 10.1145/165123.165172

As we know, the conflict problem is a very important problem in memory system of super computer, there are two kinds of conflict-free memory system approaches: skewing scheme approach and prime memory system approach. Previously published prime memory approaches are complex or wasting 1/p of the memory space for filling the "holes" [17], where p is the number of memory modules. In this paper, based on Chinese remainder theorem, we present a perfect prime memory system which only need to find the d Mod p without wasting any memory space and without computing the quotient.