Loading...
Please wait, while we are loading the content...
Similar Documents
On the Implementation of Virtual Shared Memory (1993)
| Content Provider | CiteSeerX |
|---|---|
| Author | Zimmermann, Wolf Kumm, Holger |
| Description | In Programming Models for Massively Parallel Computers The field of parallel algorithms demonstrated that a machine model with virtual shared memory is easy to program. Most efforts in this field have been achieved on the PRAM-model. Theoretical results show that a PRAM can be simulated optimally on an interconnection network. We discuss implementations of some of these PRAM simulations and discuss their performance. 1 Introduction The field of parallel algorithms demonstrated that a machine model with virtual shared memory is easy to program. Most of the efforts in this field have been achieved on the PRAM-model. Efficient parallel algorithms have been developed for most application domains [5]. A v-PRAM has v processors and a global shared memory. Every processor can access the shared memory. The communication between two processors is accomplished by accessing the shared memory. Each processor could have a local memory which cannot be accessed by other processors. The PRAM model is based on the unrealistic assumption that an access to ... |
| File Format | |
| Language | English |
| Publisher Date | 1993-01-01 |
| Access Restriction | Open |
| Subject Keyword | Machine Model Pram Model Interconnection Network Application Domain Theoretical Result Parallel Algorithm Virtual Shared Memory Unrealistic Assumption Efficient Parallel Algorithm Global Shared Memory Pram Simulation Local Memory |
| Content Type | Text |
| Resource Type | Article |
