Journal Article10.1145/359842.359858
Multiprocessor memory organization and memory interference
19
TL;DR: Alternative memory organizations are compared and it is shown that a home memory organization, in which each processor is associated with one or more memories in which its address space is concentrated, is quite effective in reducing memory interference.
read more
Abstract: ture of shared memory in a multiprocessor computer system is examined with particular attention to noninterleaved memory. Alternative memory organizations are compared and it is shown that a home memory organization, in which each processor is associated with one or more memories in which its address space is concentrated, is quite effective in reducing memory interference. Home memory organization is shown to be particularly suited to certain specialized computational problems as well as to possess advantages in terms of interference and reliability for general purpose computation. Results for interleaved memory are drawn from previous work and are used for comparison. Trace-driven simulations are used to verify the conclusions of the analysis.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Increasing bacterial disease resistance in plants utilizing antibacterial genes from insects
TL;DR: The potato has been chosen as the model system, not only because of its plasticity of development, which allows for the relatively easy regeneration of whole plants from transformed tissue, but also because the potato ranks among the top four plants in the world in terms of economic importance.
98
Data Coherence Problem in a Multicache System
Yen,King-Sun Fu +1 more
TL;DR: A state model is presented which clarifies various coherence mechanisms as well as introduces a new state to enable the multicache system to more efficiently handle the processor writes.
96
Vector Computer Memory Bank Contention
TL;DR: A number of recent vector supercomputer designs have featured main memories with very large capacities, and presumably even larger memories are planned for future generations, which means that memory access times and memory bank reservation times are sharply increased from previous generations.
93
Bibliography on paging and related topics
TL;DR: The author is on the staff of the EECS Department of the University of California, Berkeley and is a visitor at the Stanford Linear Accelerator Center.
47
Dynamically partitionable multicomputers with switchable memory
TL;DR: It is found that SM3 has an excellent overall performance for various categories of database operations and that its architecture is flexible for adapting different software algorithms.
18
References
Some Computer Organizations and Their Effectiveness
TL;DR: A hierarchical model of computer organizations is developed, based on a tree model using request/service type resources as nodes, which indicates that saturation develops when the fraction of task time spent locked out approaches 1/n, where n is the number of processors.
2.1K
C.mmp: a multi-mini-processor
William A. Wulf,C. G. Bell +1 more
- 05 Dec 1972
TL;DR: An overview of the goals, design, and status of this hardware/software complex, and some of the research problems raised and analytic problems solved in the course of its construction are described.
305
A Modified Working Set Paging Algorithm
TL;DR: The author proposes a modification of the working set algorithm called the damped working set (DWS) algorithm which resists sudden expansion of working set size and exhibits far greater stability in the number of page frames-allocated to an active process.
50
Performance evaluation of multiprogrammed time-shared computer systems
Akira Sekino
- 27 Aug 1973
TL;DR: A comprehensive set of hierarchically organized modular analytical models is developed for performance evaluation of multlprogralmned vlrtual-memory tlme-shared computer systems that guides human intuition in understanding actual performance problems and presents reliable answers to quantitative performance questions about throughput and response time of actual computer systems.
38
Related Papers (5)
K. Harzallah,Kenneth C. Sevcik +1 more
- 01 Dec 1993
G. J. Burnett,Edward G. Coffman +1 more
- 05 May 1970