Shift Register Sequences
The Prime Memory System for Array Access
IEEE Transactions on Computers
Theory and Implementation of p-Multiple Sequential Machines
IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
| Hi-index | 0.00 |
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. All allocation schemes introduced in this paper are described by a Diophantine equation whose solution, x, shows the distance between any two processors that are not in conflict when they access the same circulating memory. The paper presents a technique for finding a maximal set of noninterfering processors and conflict-free allocation techniques for various structures of data files. These techniques achieve very high performance characteristics, since 1. They allow the entire memory space of a circulating memory either to be completely filled with data files or to be filled with minimal memory overhead created to exclude interference between any pair of noninterfering processors. 2. All the memory allocations developed are conflict-free. 3. During one memory revolution, the entire content of each circulating memory can be completely fetched by a set of noninterfering processors.