Fault tolerant asynchronous adder through dynamic self-reconfiguration

Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors

Volumn 2005, Issue , 2005, Pages 171-178

  Peng, Song ^a   Manohar, Rajit ^a  

^a Cornell University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYNCHRONOUS MACHINERY; COMPUTER GRAPHICS; COMPUTER HARDWARE; FORMAL LOGIC; MATHEMATICAL MODELS;

K-FAULT-TOLERANT ASYNCHRONOUS ADDER; LINEAR ARRAY; SELF-HEALING ASYNCHRONOUS ADDER; SELF-RECONFIGURATION;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 33748557770     PISSN: 10636404     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCD.2005.56     Document Type: Conference Paper

References (20)

1. International Technology Roadmap for Semiconductors. Semiconductor Industry Association, 2004.
2. S. Peng et al. Explicit constructions of fault-tolerant open linear arrays. Technical Report CSL-TR-2005-1044, Cornell University, 2005.
3. C. LaFrieda et.al. Robust fault detection and tolerance in quasi delay-insensitive circuits. In Proc. International Conference on Dependable Systems and Networks, 2004.
4. E. J. McCluskey et.al. Stuck-fault tests vs. actual defects. In Proc. International Test Conference, 2000.
5. F. Haray et.al. Edge fault tolerance in graphs. Networks, 23:135-142, 1993.
6. I. David et.al. Self-timed is self-checking. J. of Electronic Testing: Theory and Applications, 6(2), 1995.
7. I. E. Sutherland et.al. Computers without clocks. Scientific American, 2002.
8. J. Srinivasan et.al. The case for lifetime reliability-aware microprocessors. In Proc. the. 31st Annual International Symposium on Computer Architecture, 2004.
9. M. Ajtai et.al. Fault tolerant graphs, perfect hash functions and disjoint paths. In Proc. IEEE Symposium on Foundations of Computer Science, 1992.
10. N. Alon et.al. Explicit construction of linear sized tolerant networks. Discrete Math, 72(1): 15-19, 1988.
11. N. R. Mahapatra et.al. Comparison and analysis of delay elements. In Proc. the 45th Midwest Symposium on Circuits and Systems, 2002.
12. T. Yamada et.al. Optimal fault-tolerant linear arrays. In Proc. ACM Symposium on Parallelism in Algorithms and Architecture, 2003.
13. W. J. Townsend et.al. Quadruple time redundancy adders. In Proc. IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems, 2003.
14. W. Kuo et.al. An overview of manufacturing yield and reliability modeling for semiconductor products. Proceedings of the IEEE, 87(8), 1999.
15. J. P. Hayes. A graph model for fault-tolerant computing systems. IEEE Trans. on Computers, 25(9), 1976.
16. Y. M. Hsu. Concurrent Error Correcting Arithmetic. Processors. PhD thesis, The University of Texas, Austin, August 1995.
17. A. M. Lines. Pipelined asynchronous circuits. Master's thesis, California Institute of Technology, 1995.
18. A. J. Martin. Synthesis of asynchronous VLSI circuits. Technical Report CS-TR-93-28, California Institute of Technology, 1993.
19. J. Von Neumann. Probabilistic logics and the synthesis of reliable organisms from unreliable components. In C. E. Shannon and J. McCarthy, editors, Automata Studies. Princeton University Press, 1956.
20. L. Zhang. Fault tolerant networks with small degree. In Proc. ACM Symposium on Parallelism in Algorithms and Architectures, 2000.