Conflict-free memory allocation for associative data files
Pages 579 - 593
Abstract
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.
References
[1]
Barnett, I. A. Elements of Number Theory. Boston: Prindle, Webber and Schmidt, 1969.
[2]
Booth, T. L. Sequential Machines and Automata Theory. New York: John Wiley and Sons, 1967.
[3]
Golomb, S. W. Shift-Register Sequences. San Francisco: Holden-Day, 1967.
[4]
Kautz, W. H. (Ed.). Linear Sequential Switching Circuits. San Francisco: Holden-Day, 1965.
[5]
Elspas, B. "The Theory of Autonomous Linear Sequential Networks." Transactions of the IRE, CT-6 (1959), pp. 45--60.
[6]
Kartashev, S. P. "State Assignment for Realizing Modular Input-Free Sequential Logical Networks without Invertors." Journal of Computer and System Sciences. 7 (1973), pp. 522--542.
[7]
Kartashev, S. P. "Theory and Implementation of p-multiple Sequential Machines." IEEE Transactions on Computers, C-23 (1974), pp. 500--524.
[8]
Batcher, K. E. "The Multi-dimensional Access Memory in STARAN." IEEE Transactions on Computers, C-26 (1977), pp. 174--177.
[9]
Lawrie, D. H. "Access and Alignment of Data in an Array Processor." IEEE Transactions on Computers, C-24, (1975), pp. 1145--1151.
[10]
Siegel, H. J. "Controlling the Active/Inactive Status of SIMD Machine Processors." Proceedings of the 1977 International Conference on Parallel Processing, 1977, p. 183.
[11]
Siegel, H. J. "Interconnection Networks for SIMD Machines." IEEE Computer, 12, 6 (June 1979), pp. 57--65.
[12]
Lawrie, D., and C. Vora. (June 1979). "The Prime Memory System for Array Access." IEEE Transactions on Computers, C-31 (1982).
Recommendations
Associative memory
Encyclopedia of Computer ScienceData in an associative or content-addressable memory is looked up by properties of its value, rather than by its address as in conventional memory. Such a property might be a pattern of bits at the start of a word or set of words of storage, for example,...
Register allocation for write activity minimization on non-volatile main memory
ASPDAC '11: Proceedings of the 16th Asia and South Pacific Design Automation ConferenceNon-volatile memories are good candidates for DRAM replacement as main memory in embedded systems and they have many desirable characteristics. Nevertheless, the disadvantages of non-volatile memory co-exist with its advantages. First, the lifetime of ...
Scalable lock-free dynamic memory allocation
PLDI '04Dynamic memory allocators (malloc/free) rely on mutual exclusion locks for protecting the consistency of their shared data structures under multithreading. The use of locking has many disadvantages with respect to performance, availability, robustness, ...
Comments
Information & Contributors
Information
Published In
May 1983
808 pages
ISBN:0882830392
DOI:10.1145/1500676
Copyright © 1983 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- AFIPS: American Federation of Information Processing Societies
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 16 May 1983
Check for updates
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 60Total Downloads
- Downloads (Last 12 months)8
- Downloads (Last 6 weeks)1
Reflects downloads up to 07 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in