S. Raina. Emulation of a Virtual Shared Memory Architecture. PhD thesis, Department of Computer Science, University of Bristol, Bristol BS8 1TR, U.K., September 1993. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Combinational Framework For Parallel Programming Using.. - Hamdan (2000) (8 citations) (Correct)
....works on a subset of the input data. The level of synchronisation in SPMD models is of coarser grain than 5 SIMD and MIMD characterisation were proposed by Flynn [68] and stand for Single Instruction Multiple Data and Multiple Instruction Multiple Data respectively. 3 traditional SIMD models [135]. However, the Group SPMD model [67] a more general model of parallelism than SPMD) is used later in the thesis. It allows the concurrent execution of di erent SPMD sub programs on separate groups of processors when resources permit [86] 1.2.3 Parallel Programming Environments MacDonald and ....
S. Raina. Emulation of a Virtual Shared Memory Architecture. PhD thesis, Department of Computer Science, University of Bristol, Bristol BS8 1TR, U.K., September 1993.
Compiling Techniques for Improving Decoupled Virtual Shared Memory.. - Zhu (Correct)
....But further classification is required to differing modern MIMD multiprocessors which have shown different significant characteristics. Considering the physical organisation of memory and the organisation of the address spaces on individual processors, MIMD can be divided into four classes [63], 1. DADM or Disjoint Address space Distributed Memory, 2. SASM or Shared Address space Shared Memory, 3. SADM or Shared Address space Distributed Memory, and 4. DADM or Disjoint Address space Distributed Memory. Base on the memory access, three categories of multiprocessors are proposed: 1. ....
Sanjay Raina. Emulation of a Virtual Shared Memory Architecture. PhD thesis, Department of Computer Science, The University of Bristol, 1993.
Virtual Memory on Data Diffusion Architectures - Buenabad-Chávez (1998) (Correct)
....the KSR 1 use a hierarchical organisation where software runs at the leave nodes only, and nodes above the leaves keep track of the data items in the nodes below. The DDM was first proposed with a hierarchy of buses, but has since been investigated for point to pointlinks as interconnect medium [86, 83, 85, 115]. The KSR 1 uses a hierarchy of rings. COMA F is a more recent proposal of a flat (non hierarchical) data diffusion architecture [48, 111] This thesis investigates the design issues for virtual memory on data diffusion architectures. As is well known, virtual memory is a memory management scheme ....
....by providing a copy to each requesting node below. A hierarchical organisation can also be implemented with point to point links, rings, or a more general interconnect such as meshes. At Bristol University, the DDM has also been investigated with point to point links using multiprocessor emulation [86, 83, 84, 85]. Rings were used in the implementation of the KSR 1, the first commercially available data diffusion architecture [44] In some respects, the KSR 1 operates much like the bus based DDM because of the broadcasting facility of both buses and rings. For instance, software runs on the leaf nodes ....
[Article contains additional citation context not shown here]
Sanjay Raina. Emulation of a Virtual Shared Memory Architecture. PhD thesis, University of Bristol, Department of Computer Science, University Walk, Queen's Building, Bristol BS8 1TR, UK, September 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC