Article

Designing reliable algorithms in unreliable memories

Authors:

Irene Finocchi,

Fabrizio Grandoni,

Giuseppe F. ItalianoAuthors Info & Claims

ESA'05: Proceedings of the 13th annual European conference on Algorithms

Pages 1 - 8

https://doi.org/10.1007/11561071_1

Published: 03 October 2005 Publication History

Abstract

Some of today’s applications run on computer platforms with large and inexpensive memories, which are also error-prone. Unfortunately, the appearance of even very few memory faults may jeopardize the correctness of the computational results. An algorithm is resilient to memory faults if, despite the corruption of some memory values before or during its execution, it is nevertheless able to get a correct output at least on the set of uncorrupted values. In this paper we will survey some recent work on reliable computation in the presence of memory faults.

References

[1]

J. A. Aslam and A. Dhagat. Searching in the presence of linearly bounded errors. Proc. 23rd ACM Symp. on Theory of Computing (STOC'91), 486-493, 1991.

Digital Library

[2]

S. Assaf and E. Upfal. Fault-tolerant sorting networks. SIAM J. Discrete Math., 4(4), 472-480, 1991.

Digital Library

[3]

Y. Aumann and M. A. Bender. Fault-tolerant data structures. Proc. 37th IEEE Symp. on Foundations of Computer Science (FOCS'96), 580-589, 1996.

Digital Library

[4]

J. Blömer and J.-P. Seifert. Fault based cryptanalysis of the Advanced Encryption Standard (AES). Proc. 7th International Conference on Financial Cryptography (FC'03), LNCS 2742, 162-181, 2003.

[5]

M. Blum, W. Evans, P. Gemmell, S. Kannan and M. Naor. Checking the correctness of memories. Proc. 32th IEEE Symp. on Foundations of Computer Science (FOCS'91), 1991.

Digital Library

[6]

R. S. Borgstrom and S. Rao Kosaraju. Comparison based search in the presence of errors. Proc. 25th ACM Symp. on Theory of Computing (STOC'93), 130-136, 1993.

Digital Library

[7]

P. M. Chen, E. L. Lee, G. A. Gibson, R. H. Katz, and D. A. Patterson. RAID: Highperformance, reliable secondary storage. ACM Computing Surveys, 26(2), 145-185, 1994.

Digital Library

[8]

B. S. Chlebus, A. Gambin and P. Indyk. PRAM computations resilient to memory faults. Proc. 2nd Annual European Symp. on Algorithms (ESA'94), LNCS 855, 401-412, 1994.

Digital Library

[9]

B. S. Chlebus, A. Gambin and P. Indyk. Shared-memory simulations on a faultymemory DMM. Proc. 23rd International Colloquium on Automata, Languages and Programming (ICALP'96), 586-597, 1996.

Digital Library

[10]

B. S. Chlebus, L. Gasieniec and A. Pelc. Deterministic computations on a PRAM with static processor and memory faults. Fundamenta Informaticae, 55(3-4), 285- 306, 2003.

Digital Library

[11]

A. Dhagat, P. Gacs, and P. Winkler. On playing "twenty questions" with a liar. Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms (SODA'92), 16-22, 1992.

Digital Library

[12]

U. Feige, P. Raghavan, D. Peleg, and E. Upfal. Computing with noisy information. SIAM Journal on Computing, 23, 1001-1018, 1994.

Digital Library

[13]

I. Finocchi, F. Grandoni and G. F. Italiano. Optimal resilient sorting and searching in the presence of memory faults. Manuscript, 2005.

[14]

I. Finocchi and G. F. Italiano. Sorting and searching in the presence of memory faults (without redundancy). Proc. 36th ACM Symposium on Theory of Computing (STOC'04), 101-110, 2004.

Digital Library

[15]

S. Hamdioui, Z. Al-Ars, J. Van de Goor, and M. Rodgers. Dynamic faults in Random-Access-Memories: Concept, faults models and tests. Journal of Electronic Testing: Theory and Applications, 19, 195-205, 2003.

Digital Library

[16]

M. Henzinger. The past, present and future of Web Search Engines. Invited talk. 31st Int. Coll. Automata, Languages and Programming, Turku, Finland, July 12-16 2004.

[17]

P. Indyk. On word-level parallelism in fault-tolerant computing. Proc. 13th Annual Symp. on Theoretical Aspects of Computer Science (STACS'96), 193-204, 1996.

Digital Library

[18]

R. H. Katz, D. A. Patterson and G. A. Gibson, Disk system architectures for high performance computing, Proceedings of the IEEE, 77(12), 1842-1858, 1989.

[19]

D. J. Kleitman, A. R. Meyer, R. L. Rivest, J. Spencer, and K. Winklmann. Coping with errors in binary search procedures. Journal of Computer and System Sciences, 20:396-404, 1980.

[20]

K. B. Lakshmanan, B. Ravikumar, and K. Ganesan. Coping with erroneous information while sorting. IEEE Trans. on Computers, 40(9):1081-1084, 1991.

Digital Library

[21]

T. Leighton and Y. Ma. Tight bounds on the size of fault-tolerant merging and sorting networks with destructive faults. SIAM Journal on Computing, 29(1):258- 273, 1999.

Digital Library

[22]

T. Leighton, Y. Ma and C. G. Plaxton. Breaking the Θ(n log² n) barrier for sorting with faults. Journal of Computer and System Sciences, 54:265-304, 1997.

Digital Library

[23]

T. C. May and M. H. Woods. Alpha-Particle-Induced Soft Errors In Dynamic Memories. IEEE Trans. Elect. Dev., 26(2), 1979.

[24]

S. Muthukrishnan. On optimal strategies for searching in the presence of errors. Proc. 5th ACM-SIAM Symp. on Discrete Algorithms (SODA'94), 680-689, 1994.

Digital Library

[25]

A. Pelc. Searching with known error probability. Theoretical Computer Science, 63, 185-202, 1989.

Digital Library

[26]

A. Pelc. Searching games with errors: Fifty years of coping with liars. Theoretical Computer Science, 270, 71-109, 2002.

Digital Library

[27]

B. Ravikumar. A fault-tolerant merge sorting algorithm. Proc. 8th Annual Int. Conf. on Computing and Combinatorics (COCOON'02), LNCS 2387, 440-447, 2002.

Digital Library

[28]

A. Rényi. A diary on information theory, J. Wiley and Sons, 1994. Original publication: Napló az információelméletröl, Gondolat, Budapest, 1976.

[29]

S. Skorobogatov and R. Anderson. Optical fault induction attacks. Proc. 4th International Workshop on Cryptographic Hardware and Embedded Systems (CHES'02), LNCS 2523, 2-12, 2002.

Digital Library

[30]

Tezzaron Semiconductor. Soft errors in electronic memory - a white paper, URL: http://www.tezzaron.com/about/papers/Papers.htm, January 2004.

[31]

S. M. Ulam. Adventures of a mathematician. Scribners (New York), 1977.

[32]

A.J. Van de Goor. Testing semiconductor memories: Theory and practice, ComTex Publishing, Gouda, The Netherlands, 1998.

Digital Library

[33]

J. Von Neumann, Probabilistic logics and the synthesis of reliable organisms from unreliable components. In Automata Studies, C. Shannon and J. McCarty eds., Princeton University Press, 43-98, 1956.

[34]

A. C. Yao and F. F. Yao. On fault-tolerant networks for sorting. SIAM Journal on Computing, 14, 120-128, 1985.

Cited By

Barenboim L(2016)Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty NetworksJournal of the ACM10.1145/297967563:5(1-22)Online publication date: 8-Nov-2016
https://dl.acm.org/doi/10.1145/2979675
Bernasconi ACiriani V(2016)Index-Resilient Zero-Suppressed BDDsACM Transactions on Design Automation of Electronic Systems10.1145/290536321:4(1-27)Online publication date: 18-May-2016
https://dl.acm.org/doi/10.1145/2905363
Barenboim LGeorgiou CSpirakis P(2015)Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty NetworksProceedings of the 2015 ACM Symposium on Principles of Distributed Computing10.1145/2767386.2767410(345-354)Online publication date: 21-Jul-2015
https://dl.acm.org/doi/10.1145/2767386.2767410
Show More Cited By

Index Terms

Designing reliable algorithms in unreliable memories
1. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis
      1. Sorting and searching

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

Recommendations

Designing reliable algorithms in unreliable memories

Some of the present day applications run on computer platforms with large and inexpensive memories, which are also error-prone. Unfortunately, the appearance of even very few memory faults may jeopardize the correctness of the computational results. We ...
Built-in self-repair schemes for flash memories

The advancement of deep submicrometer Integrated circuit manufacturing technology has pushed the use of embedded memory, and the strong demand of embedded nonvolatile memory for system-on-chip and system in package applications has made flash memory ...
Designing reliable modern memory systems

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

ESA'05: Proceedings of the 13th annual European conference on Algorithms

October 2005

901 pages

ISBN:3540291180

Editors:
Gerth Stølting Brodal
BRICS, MADALGO, Department of Computer Science, University of Aarhus, Denmark
,
Stefano Leonardi
BRICS, MADALGO, Department of Computer Science, University of Rome "La Sapienza", Rome, Italy

Sponsors

Ministerio de Educación y Ciencia: Ministerio de Educación y Ciencia
Universitat de les Illes Balears: Universitat de les Illes Balears
EATCS: European Association for Theoretical Computer Science
Universitat Politècnica de Catalunya: Universitat Politècnica de Catalunya

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 03 October 2005

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Barenboim L(2016)Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty NetworksJournal of the ACM10.1145/297967563:5(1-22)Online publication date: 8-Nov-2016
https://dl.acm.org/doi/10.1145/2979675
Bernasconi ACiriani V(2016)Index-Resilient Zero-Suppressed BDDsACM Transactions on Design Automation of Electronic Systems10.1145/290536321:4(1-27)Online publication date: 18-May-2016
https://dl.acm.org/doi/10.1145/2905363
Barenboim LGeorgiou CSpirakis P(2015)Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty NetworksProceedings of the 2015 ACM Symposium on Principles of Distributed Computing10.1145/2767386.2767410(345-354)Online publication date: 21-Jul-2015
https://dl.acm.org/doi/10.1145/2767386.2767410
Ferraro-Petrillo UGrandoni FItaliano G(2013)Data structures resilient to memory faultsACM Journal of Experimental Algorithmics10.1145/2444016.244402218(1.1-1.14)Online publication date: 19-Apr-2013
https://dl.acm.org/doi/10.1145/2444016.2444022
Venetis PGarcia-Molina HHuang KPolyzotis NMille AGandon FMisselis JRabinovich MStaab S(2012)Max algorithms in crowdsourcing environmentsProceedings of the 21st international conference on World Wide Web10.1145/2187836.2187969(989-998)Online publication date: 16-Apr-2012
https://dl.acm.org/doi/10.1145/2187836.2187969
Moscibroda TOshman RGavoille CFraigniaud P(2011)Resilience of mutual exclusion algorithms to transient memory faultsProceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing10.1145/1993806.1993817(69-78)Online publication date: 6-Jun-2011
https://dl.acm.org/doi/10.1145/1993806.1993817

View Options

View options

Media

Figures

Other

Tables

View Table of Contents