Controlling memory access concurrency in efficient fault-tolerant parallel algorithms

Paris C. Kanellakis, Dimitrios Michailidis, Alex A. Shvartsman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The crcw pram with dynamic fail-stop errors is a faultprone multiprocessor model for which it is possible to control memory access redundancy while guaranteeing the reliability of efficient algorithms. Concurrent common reads and writes are necessary to handle dynamic faults and in this paper we show how to significantly decrease this concurrency and how to bound it in terms of the number of processor faults. We describe a low concurrency, efficient, and fault-tolerant algorithm for the Write- All primitive: “using ≤ N processors, write 1’s into N locations”. This primitive serves as the basis for efficient faulttolerant simulations of algorithms written for fault-free prams on faultprone prams. For any dynamic failure pattern F, our algorithm has total write concurrency ≤ |F| and total read concurrency ≤7 |F| log N, where |F| is the number of processor faults (e.g. no concurrency in a run without failures). Previous algorithms used Ω (N log N) concurrency even in the absence of faults. We also present an optimal fault-tolerant erew pram algorithm for Write-All when all processor faults are initial.

Original languageEnglish (US)
Title of host publicationDistributed Algorithms - 7th International Workshop, WDAG 1993, Proceedings
EditorsAndre Schipe
PublisherSpringer Verlag
Pages99-114
Number of pages16
ISBN (Print)9783540572718
DOIs
StatePublished - 1993
Externally publishedYes
Event7th International Workshop on Distributed Algorithms, WDAG 1993 - Lausanne, Switzerland
Duration: Sep 27 1993Sep 29 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume725 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th International Workshop on Distributed Algorithms, WDAG 1993
Country/TerritorySwitzerland
CityLausanne
Period9/27/939/29/93

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Controlling memory access concurrency in efficient fault-tolerant parallel algorithms'. Together they form a unique fingerprint.

Cite this