✦ LIBER ✦

The genesis distributed memory benchmarks

✍ Scribed by Anthony J.G. Hey

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 524 KB
Volume: 17
Category: Article
ISSN: 0167-8191
DOI: 10.1016/s0167-8191(05)80038-9

No coin nor oath required. For personal study only.

✦ Synopsis

Hey, A.J.G., The Genesis distributed memory benchmarks, Parallel Computing 17 (1991) 1275-1283.

A brief overview of the Genesis Distributed Memory Benchmark suite developed in the Esprit-2 Genesis project is presented. These benchmarks are directed towards the evaluation of Distributed Memory MIMD systems and are therefore rather different in character from the PERFECT benchmarks. A sample of the performance results for these benchmarks is given for a wide variety of different parallel systems. Some conclusions and remarks about future work are also included.

📜 SIMILAR VOLUMES

Benchmarking for distributed memory para

Benchmarking for distributed memory parallel systems: Gaining insight from numbers

✍ C.A. Addison; V.S. Getov; A.J.G. Hey; R.W. Hockney; I.C. Wolton 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 1018 KB

On the memory overhead of distributed sn

On the memory overhead of distributed snapshots

✍ Shabtay, Lior; Segall, Adrian 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 60 KB 👁 3 views

This paper shows that the memory overhead of distributed snapshots is unbounded. Several techniques are suggested for bounding it: bounded memory-overhead versions of distributed snapshots for specific problems, like termination detection and deadlock detection; use of alternative protocols; or use

The RSCG algorithm on distributed memory

The RSCG algorithm on distributed memory architectures

✍ Lori Freitag; James Ortega 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 815 KB

Design of the Munin Distributed Shared M

Design of the Munin Distributed Shared Memory System

✍ J.B. Carter 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 933 KB

The PMESC Programming Library for Distri

The PMESC Programming Library for Distributed-Memory MIMD Computers

✍ S. Crivelli; E.R. Jessup 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 341 KB

Efficient programming of task-parallel problems, where the number and execution times of the computational tasks can vary unpredictably, demands an asynchronous and adaptive approach. In this sort of approach, however, such fundamental programming issues as load sharing, data sharing, and terminatio

The Impact of Symmetry on Software Distr

The Impact of Symmetry on Software Distributed Shared Memory

✍ Peter J. Keleher 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 553 KB

A homeless protocol is one in which all nodes are treated identically when they access common resources. By contrast, home-based protocols assign a home or manager to each resource. Use of the resource by the home incurs less overhead than use by other processors. The key to good performance in such