Conflict-free memory allocation for associative data files
Svetlana P. Kartashev, Steven I. Kartashev · 1983
For associative processing and databases characterized by sequential memory search, it is convenient to store a sequence of data files in a circulating memory since it is inexpensive and suitable for implementing sequential memory search algorithms. In this paper we discuss various allocation algorithms that allow g circulating memories to serve T processors, where g and T are selectable by programmer.