𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the memory overhead of distributed snapshots

✍ Scribed by Shabtay, Lior; Segall, Adrian


Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
60 KB
Volume
34
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis


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 of synchronizers or schedulers in order to limit the photographed protocol to executions whose distributed snapshot requires bounded memory. Each solution is discussed in detail, and its memory overhead is analyzed.


πŸ“œ SIMILAR VOLUMES


Effects of voluntary immigration on the
✍ Robert W. Schrauf; David C. Rubin πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 100 KB πŸ‘ 2 views

## Abstract Immigration may be considered a β€˜traumatic’ event with acute phases followed by long latency effects. Ten older, Hispanic adults who immigrated to the USA at ages 20–22, 24–28, and 34–35 narrated their β€˜life‐stories’ on two occasions, once in English and once in Spanish. Instead of the

Numerical simulation of fluid dynamic pr
✍ Pirozzi, Maria A. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 91 KB πŸ‘ 1 views

This paper describes the parallel implementation of a numerical model for the simulation of problems from fluid dynamics on distributed memory multiprocessors. The basic procedure is to apply a fully explicit upwind finite difference approximation on a staggered grid. A theoretical time complexity a

Parallel computation of second derivativ
✍ MοΏ½rquez, Antonio M.; Oviedo, Jaime; Sanz, Javier FernοΏ½ndez; Dupuis, Michel πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 302 KB πŸ‘ 1 views

A parallel implementation of the computation of RHF energy second derivatives with respect to the nuclear coordinates is described. The algorithm and organization of the code are described in detail on the most computationally demanding steps with special emphasis on the integral transformation code

Parallel realizations of Kanerva's spars
✍ HΓ€mΓ€lΓ€inen, Timo; Klapuri, Harri; Saarinen, Jukka; Kaski, Kimmo πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 311 KB πŸ‘ 1 views

This paper presents two parallel realizations of sparse distributed memory (SDM) on a treeshaped computer. The original model of SDM is introduced in terms of generalized computer memory and artificial neural networks (ANNs). For parallellization purposes, addressing, storage and retrieval operation

Hybrid spectral finite difference simula
✍ Rajat P. Garg; Joel H. Ferziger; Stephen G. Monismith πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 342 KB πŸ‘ 1 views

A method for efficient implementation of a combined spectral finite difference algorithm for computation of incompressible stratified turbulent flows on distributed memory computers is presented. The solution technique is the fractional step method with a semi-implicit time advancement scheme. A sin