Article

PRAM Computations Resilient to Memory Faults

Authors:

Bogdan S. Chlebus,

Anna Gambin,

Piotr IndykAuthors Info & Claims

ESA '94: Proceedings of the Second Annual European Symposium on Algorithms

Pages 401 - 412

Published: 26 September 1994 Publication History

Abstract

No abstract available.

Cited By

View all

Blelloch GGibbons PGu YMcGuffey CShun JScheideler CFineman J(2018)The Parallel Persistent Memory ModelProceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures10.1145/3210377.3210381(247-258)Online publication date: 11-Jul-2018
https://dl.acm.org/doi/10.1145/3210377.3210381
Italiano G(2010)Resilient algorithms and data structuresProceedings of the 7th international conference on Algorithms and Complexity10.1007/978-3-642-13073-1_3(13-24)Online publication date: 26-May-2010
https://dl.acm.org/doi/10.1007/978-3-642-13073-1_3
Finocchi IGrandoni FItaliano G(2007)Designing reliable algorithms in unreliable memoriesComputer Science Review10.1016/j.cosrev.2007.10.0011:2(77-87)Online publication date: 1-Dec-2007
https://dl.acm.org/doi/10.1016/j.cosrev.2007.10.001
Show More Cited By

Index Terms

PRAM Computations Resilient to Memory Faults
1. Hardware
  1. Integrated circuits
    1. Semiconductor memory
2. Theory of computation
  1. Models of computation
    1. Concurrency
      1. Parallel computing models

Index terms have been assigned to the content through auto-classification.

Recommendations

Deterministic Computations on a PRAM with Static Processor and Memory Faults

We consider Parallel Random Access Machine (PRAM) which has some processors and memory cells faulty. The faults considered are static, i.e., once the machine starts to operate, the operational/faulty status of PRAM components does not change. We develop ...
Deterministic computations on a PRAM with static processor and memory faults

We consider Parallel Random Access Machine (PRAM) which has some processors and memory cells faulty. The faults considered are static, i.e., once the machine starts to operate, the operational/faulty status of PRAM components does not change. We develop ...
A frequent-value based PRAM memory architecture
ASPDAC '11: Proceedings of the 16th Asia and South Pacific Design Automation Conference

Phase Change Random Access Memory (PRAM) has great potential as the replacement of DRAM as main memory, due to its advantages of high density, non-volatility, fast read speed, and excellent scalability. However, poor endurance and high write energy ...

Comments

Information & Contributors

Information

Published In

ESA '94: Proceedings of the Second Annual European Symposium on Algorithms

September 1994

507 pages

ISBN:354058434X

Editor:
Jan van Leeuwen

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 26 September 1994

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Blelloch GGibbons PGu YMcGuffey CShun JScheideler CFineman J(2018)The Parallel Persistent Memory ModelProceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures10.1145/3210377.3210381(247-258)Online publication date: 11-Jul-2018
https://dl.acm.org/doi/10.1145/3210377.3210381
Italiano G(2010)Resilient algorithms and data structuresProceedings of the 7th international conference on Algorithms and Complexity10.1007/978-3-642-13073-1_3(13-24)Online publication date: 26-May-2010
https://dl.acm.org/doi/10.1007/978-3-642-13073-1_3
Finocchi IGrandoni FItaliano G(2007)Designing reliable algorithms in unreliable memoriesComputer Science Review10.1016/j.cosrev.2007.10.0011:2(77-87)Online publication date: 1-Dec-2007
https://dl.acm.org/doi/10.1016/j.cosrev.2007.10.001
Finocchi IGrandoni FItaliano G(2005)Designing reliable algorithms in unreliable memoriesProceedings of the 13th annual European conference on Algorithms10.1007/11561071_1(1-8)Online publication date: 3-Oct-2005
https://dl.acm.org/doi/10.1007/11561071_1
Finocchi IItaliano GBabai L(2004)Sorting and searching in the presence of memory faults (without redundancy)Proceedings of the thirty-sixth annual ACM symposium on Theory of computing10.1145/1007352.1007375(101-110)Online publication date: 13-Jun-2004
https://dl.acm.org/doi/10.1145/1007352.1007375
Malewicz G(2004)A tight analysis and near-optimal instances of the algorithm of Anderson and WollTheoretical Computer Science10.1016/j.tcs.2004.10.015329:1-3(285-301)Online publication date: 13-Dec-2004
https://dl.acm.org/doi/10.1016/j.tcs.2004.10.015
Malewicz GBorowsky ERajsbaum S(2003)A work-optimal deterministic algorithm for the asynchronous certified write-all problemProceedings of the twenty-second annual symposium on Principles of distributed computing10.1145/872035.872075(255-264)Online publication date: 13-Jul-2003
https://dl.acm.org/doi/10.1145/872035.872075

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Deterministic Computations on a PRAM with Static Processor and Memory Faults

Deterministic computations on a PRAM with static processor and memory faults

A frequent-value based PRAM memory architecture

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations