Designing reliable algorithms in unreliable memories

Computer Science Review

Volumn 1, Issue 2, 2007, Pages 77-87

  Finocchi, Irene ^a   Grandoni, Fabrizio ^a   Italiano, Giuseppe F ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC TECHNIQUES; COMPUTATIONAL RESULTS; COMPUTER PLATFORMS; ERROR PRONES; MEMORY FAULTS;

COMPUTER APPLICATIONS;

ALGORITHMS;

EID: 36049045791     PISSN: 15740137     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cosrev.2007.10.001     Document Type: Review

References (47)

1. R. Anderson, M. Kuhn, Tamper resistance - a cautionary note, in: Proc. 2nd Usenix Workshop on Electronic Commerce, 1996, pp. 1-11
2. R. Anderson, M. Kuhn, Low cost attacks on tamper resistant devices, in: Proc. International Workshop on Security Protocols, 1997, pp. 125-136
3. L. Arge, M.A. Bender, E.D. Demaine, B. Holland-Minkley, J.I. Munro, Cache-oblivious priority queue and graph algorithm applications, in: Proc. 34th Annual ACM Symposium on Theory of Computing, STOC'02, 2002, pp. 268-276
4. J.A. Aslam, A. Dhagat, Searching in the presence of linearly bounded errors, in: Proc. 23rd ACM Symp. on Theory of Computing, STOC'91, 1991, pp. 486-493
5. Assaf S., and Upfal E. Fault-tolerant sorting networks. SIAM Journal on Discrete Mathematics 4 4 (1991) 472-480
6. Y. Aumann, M.A. Bender, Fault-tolerant data structures, in: Proc. 37th IEEE Symp. on Foundations of Computer Science, FOCS'96, 1996, pp. 580-589
7. Blömer J., and Seifert J.-P. Fault based cryptanalysis of the Advanced Encryption Standard (AES). Proc. 7th International Conference on Financial Cryptography. FC'03. LNCS 2742 (2003) 162-181
8. M. Blum, W. Evans, P. Gemmell, S. Kannan, M. Naor, Checking the correctness of memories, in: Proc. 32th IEEE Symp. on Foundations of Computer Science, FOCS'91, 1991
9. D. Boneh, R.A. DeMillo, R.J. Lipton, On the importance of checking cryptographic protocols for faults, in: Proc. EUROCRYPT, 1997, pp. 37-51
10. R.S. Borgstrom, S. Rao Kosaraju, Comparison based search in the presence of errors, in: Proc. 25th ACM Symp. on Theory of Computing, STOC'93, 1993, pp. 130-136
11. Brodal G.S., Fagerberg R., Finocchi I., Grandoni F., Italiano G.F., Jørgensen A.G., Moruz G., and Mølhave T. Optimal resilient dynamic dictionaries. Proc. 15th Annual European Symp. on Algorithms. ESA'07. LNCS 4698 (2007) 347-358
12. G.S. Brodal, R. Fagerberg, R. Jacob, Cache oblivious search trees via binary trees of small height, in: Proc. 13th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA'02, 2002, pp. 39-48
13. Chen P.M., Lee E.L., Gibson G.A., Katz R.H., and Patterson D.A. RAID: High-performance, reliable secondary storage. ACM Computing Surveys 26 2 (1994) 145-185
14. Chlebus B.S., Gambin A., and Indyk P. PRAM computations resilient to memory faults. Proc. 2nd Annual European Symp. on Algorithms. ESA'94. LNCS 855 (1994) 401-412
15. B.S. Chlebus, A. Gambin, P. Indyk, Shared-memory simulations on a faulty-memory DMM, in: Proc. 23rd International Colloquium on Automata, Languages and Programming, ICALP'96, 1996, pp. 586-597
16. Chlebus B.S., Gasieniec L., and Pelc A. Deterministic computations on a PRAM with static processor and memory faults. Fundamenta Informaticae 55 3-4 (2003) 285-306
17. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. 2nd ed. (2001), The MIT Press/McGraw-Hill Book Company
18. A. Dhagat, P. Gacs, P. Winkler, On playing "twenty questions" with a liar, in: Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, SODA'92, 1992, pp. 16-22
19. Feige U., Raghavan P., Peleg D., and Upfal E. Computing with noisy information. SIAM Journal on Computing 23 (1994) 1001-1018
20. U. Ferraro Petrillo, I. Finocchi, G.F. Italiano, The price of resiliency: A case study on sorting with memory faults, in: Proc. 14th Annual European Symposium on Algorithms, ESA'06, 2006, pp. 768-779
21. I. Finocchi, F. Grandoni, G.F. Italiano, Resilient search trees, in: Proc. 18th ACM-SIAM Symposium on Discrete Algorithms, SODA'07, 2007, pp. 547-553
22. Finocchi I., Grandoni F., and Italiano G.F. Optimal sorting and searching in the presence of memory faults. Proc. 33rd Int. Colloquium on Automata, Lang. and Prog. ICALP'06. LNCS vol. 4051 (part I) (2006) 286-298
23. I. Finocchi, G.F. Italiano, Sorting and searching in faulty memories, Algorithmica, Extended abstract, in: Proc. 36th ACM Symposium on Theory of Computing, STOC'04, 2004, pp. 101-110 (in press)
24. S. Govindavajhala, A.W. Appel, Using memory errors to attack a virtual machine, in: Proc. IEEE Symposium on Security and Privacy, 2003, pp. 154-165
25. Hamdioui S., Al-Ars Z., Van de Goor J., and Rodgers M. Dynamic faults in random-access-memories: Concept, faults models and tests. Journal of Electronic Testing: Theory and Applications 19 (2003) 195-205
26. M.R. Henzinger, The past, present and future of web search engines. Invited talk, in: 31st Int. Coll. Automata, Languages and Programming, ICALP'04, Turku, Finland, 12-16 July, 2004
27. M.R. Henzinger, Combinatorial algorithms for web search engines - Three Success Stories. Invited talk, in: 18th ACM-SIAM Symposium on Discrete Algorithms, SODA'07, New Orleans, USA, 7-9 January, 2007
28. P. Indyk, On word-level parallelism in fault-tolerant computing, in: Proc. 13th Annual Symp. on Theoretical Aspects of Computer Science, STACS'96, 1996, pp. 193-204
29. A.G. Jorgensen, G. Moruz, T. Molhave, Priority queues resilient to memory faults, in: Proc. 10th Workshop on Algorithms and Data Structures, WADS'07, 2007, pp. 127-138
30. Katz R.H., Patterson D.A., and Gibson G.A. Disk system architectures for high performance computing. Proceedings of the IEEE 77 12 (1989) 1842-1858
31. Kleitman D.J., Meyer A.R., Rivest R.L., Spencer J., and Winklmann K. Coping with errors in binary search procedures. Journal of Computer and System Sciences 20 (1980) 396-404
32. Lakshmanan K.B., Ravikumar B., and Ganesan K. Coping with erroneous information while sorting. IEEE Transactions on Computers 40 9 (1991) 1081-1084
33. Leighton T., and Ma Y. Tight bounds on the size of fault-tolerant merging and sorting networks with destructive faults. SIAM Journal on Computing 29 1 (1999) 258-273
34. 2 n) barrier for sorting with faults. Journal of Computer and System Sciences 54 (1997) 265-304
35. May T.C., and Woods M.H. Alpha-particle-induced soft errors in dynamic memories. IEEE Transactions on Electron Devices 26 2 (1979)
36. S. Muthukrishnan, On optimal strategies for searching in the presence of errors, in: Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, SODA'94, 1994, pp. 680-689
37. Pelc A. Searching with known error probability. Theoretical Computer Science 63 (1989) 185-202
38. Pelc A. Searching games with errors: Fifty years of coping with liars. Theoretical Computer Science 270 (2002) 71-109
39. Ravikumar B. A fault-tolerant merge sorting algorithm. Proc. 8th Annual Int. Conf. on Computing and Combinatorics. COCOON'02. LNCS 2387 (2002) 440-447
40. Rényi A. A Diary on Information Theory (1994), J. Wiley and Sons Original publication: Napló az információelméletröl, Gondolat, Budapest, 1976
41. Skorobogatov S., and Anderson R. Optical fault induction attacks. Proc. 4th International Workshop on Cryptographic Hardware and Embedded Systems. CHES'02. LNCS 2523 (2002) 2-12
42. Tezzaron semiconductor. Soft errors in electronic memory - A white paper, URL: http://www.tezzaron.com/about/papers/Papers.htm, January 2004
43. Ulam S.M. Adventures of a Mathematician (1977), Scribners, New York
44. Van de Goor A.J. Testing Semiconductor Memories: Theory and Practice (1998), ComTex Publishing, Gouda, The Netherlands
45. Von Neumann J. Probabilistic logics and the synthesis of reliable organisms from unreliable components. In: Shannon C., and McCarty J. (Eds). Automata Studies (1956), Princeton University Press 43-98
46. J. Xu, S. Chen, Z. Kalbarczyk, R.K. Iyer, An experimental study of security vulnerabilities caused by errors, in: Proc. International Conference on Dependable Systems and Networks, 2001, pp. 421-430
47. Yao A.C., and Yao F.F. On fault-tolerant networks for sorting. SIAM Journal on Computing 14 (1985) 120-128