ECE-C690: Dependable Computing
Final Exam
March 13, 2009
The midterm is due in class Monday, March 16, 2009. Please answer all questions. You are
not allowed to collaborate with others.
1. Answer the following questions.
(a) (10 points) A simple technique
Defect Tolerance in VLSI Circuits
Prof. Naga Kandasamy
We will consider the following redundancy techniques to tolerate defects in VLSI circuits.
Duplication with complementary logic (physical redundancy).
Permanent fault detection using time redundancy
Software Fault Tolerance
Prof. Naga Kandasamy
ECE Department, Drexel University, Philadelphia, PA 19104.
February 15, 2009
1
Acceptance Tests
Acceptance tests are, simply put, a check of reasonableness, and fall into the following categories.
1.1
Timing C
ECE-C690: Dependable Computing
Midterm Exam
February 6, 2009
The midterm is due in class Monday, February 9, 2009. Answer all questions. You are not
allowed to collaborate with others.
1. (10 points) Assume a triple modular redundant (TMR) system in which
Information Redundancy
Prof. Naga Kandasamy
ECE Department, Drexel University, Philadelphia, PA 19104.
March 2, 2009
1
Hamming Distance
A fundamental concept in the characterization of both error detecting and error correcting code is the
Hamming distance
Terminology and Concepts
Prof. Naga Kandasamy
1
Goals of Fault Tolerance
Dependability is an umbrella term encompassing the concepts of reliability, availability, performability, safety,
and testability. We will now dene the above terms in an intuitive fa
Markov Models for Reliability Modeling
Prof. Naga Kandasamy
ECE Department, Drexel University, Philadelphia, PA 19104
Many complex systems cannot be easily modeled in a combinatorial fashion. The corresponding reliability
block diagrams can be dicult to c
ECE-C690: Dependable Computing
Homework 3
February 25, 2009
The homework is due in class Monday, March 9, 2009.
Each problem is worth 10 points.
1. Textbook problem 3.6.2
2. Textbook problem 3.6.3
3. Textbook problem 3.6.21
4. Show the organization of a 8
ECE-C690: Dependable Computing
Homework 4
February 25, 2009
The homework is due in class Monday, March 9, 2009.
Each problem is worth 10 points.
1. Textbook problem 6.10.2
2. Textbook problem 6.10.3
3. Textbook problem 6.10.7
1
Fault Detection in Processors
Prof. Naga Kandasamy
ECE Department, Drexel University, Philadelphia, PA 19104.
February 2, 2009
1
Duplication
Duplication is the simplest fault-detection technique. Here, two identical copies are used and when a failure
occu
ECE-C690: Dependable Computing
Homework 1
January 13, 2009
The homework is due in class Monday, January 26, 2009.
Each problem is worth 10 points.
1. The lifetime (measured in years) of a processor is exponentially distributed with a mean lifetime of 2
ye
ECE-C690: Dependable Computing
Homework 2
January 27, 2009
The homework is due in class Monday, February 2, 2009.
Each problem is worth 10 points.
1. Textbook problem 2.8.4 (problem 4, section 2.8)
2. Textbook problem 2.8.8
3. Textbook problem 2.8.14
4. T
Combinational Techniques for Reliability Modeling
Prof. Naga Kandasamy,
ECE Department Drexel University, Philadelphia, PA 19104.
January 24, 2009
The following material is derived from these text books.
D. P. Siewiorek and R. S. Swarz, Reliable Computer