Analytical models were developed and simulations of memory latency were performed for Uniform Memory Access (UMA), Non-Uniform Memory Access (NUMA), Local-Remote-Global (LRG), and Replicated Concurrent-Read (RCR) architectures for hit rates from 0.1 to 0.9 in steps of 0.1, memory access times of 10 nsec to 100 nsec, proportions of read/write access from 0.01 to 0.1, and block sizes of 8 to 64 words. The RCR architecture based on redundant inexpensive DRAM is shown to provide favorable performance over UMA and NUMA architectures for application and system parameters in the range evaluated. RCR outperforms LRG architectures when the hit rates of the processor cache exceed 80% and hit rates of replicated memory exceed 25%. Inclusion of a small...
The effects of various cache coherence strategies are analyzed for a multiported shared memory multi...
In this paper we present a new approach to benchmark the performance of shared memory systems. This ...
In this paper we identify the factors that affect the derivation of computation and data partitions ...
Memory access time is a key factor limiting the performance of large-scale, shared-memory multiproce...
Distributed shared-memory systems provide scalable performance and a convenient model for parallel p...
In scalable multiprocessor architectures, the times required for a processor to access various porti...
There are three major classes of MIMD multiprocessors: cache-coherent machines, NUMA (non-uniform me...
Scalable multiprocessors that support a shared-memory image to application programmers are typically...
A wide variety of computer architectures have been proposed to exploit parallelism at different gran...
Non-Uniform Memory Access (NUMA) architectures make it possible to build large-scale shared memory m...
All methods of multi-processing need some form of processor to processor communication. In shared me...
. This paper studies the locality analysis problem for sharedmemory multiprocessors, a class of para...
Large-scale multiprocessors suffer from long latencies for remote accesses. Caching is by far the mo...
Graduation date:1984Multiprocessor computers may eventually be the only method of\ud increasing comp...
The memory consistency model supported by a multiprocessor architecture determines the amount of buf...
The effects of various cache coherence strategies are analyzed for a multiported shared memory multi...
In this paper we present a new approach to benchmark the performance of shared memory systems. This ...
In this paper we identify the factors that affect the derivation of computation and data partitions ...
Memory access time is a key factor limiting the performance of large-scale, shared-memory multiproce...
Distributed shared-memory systems provide scalable performance and a convenient model for parallel p...
In scalable multiprocessor architectures, the times required for a processor to access various porti...
There are three major classes of MIMD multiprocessors: cache-coherent machines, NUMA (non-uniform me...
Scalable multiprocessors that support a shared-memory image to application programmers are typically...
A wide variety of computer architectures have been proposed to exploit parallelism at different gran...
Non-Uniform Memory Access (NUMA) architectures make it possible to build large-scale shared memory m...
All methods of multi-processing need some form of processor to processor communication. In shared me...
. This paper studies the locality analysis problem for sharedmemory multiprocessors, a class of para...
Large-scale multiprocessors suffer from long latencies for remote accesses. Caching is by far the mo...
Graduation date:1984Multiprocessor computers may eventually be the only method of\ud increasing comp...
The memory consistency model supported by a multiprocessor architecture determines the amount of buf...
The effects of various cache coherence strategies are analyzed for a multiported shared memory multi...
In this paper we present a new approach to benchmark the performance of shared memory systems. This ...
In this paper we identify the factors that affect the derivation of computation and data partitions ...