Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Qingshi Gao (1993) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: