Chapter

STACS 96

Volume 1046 of the series Lecture Notes in Computer Science pp 193-204

Date:

On word-level parallelism in fault-tolerant computing

  • Piotr IndykAffiliated withComputer Science Department, Stanford University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In this paper we present several simulations of operational PRAM on PRAM with memory or processor faults. Their common property is that they rely on the ability of performing standard boolean or arithmetic operations on words consisting of many bits.