Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Download
Standard view
Full view
of .
Look up keyword or section
Like this
2Activity

Table Of Contents

1.1Motivation
1.1.1 TRANSIENT AND INTERMITTENT FAULTS
1.1.2 FAULT TOLERANCE AND DESIGN OPTIMIZATION
1.2Contributions
1.3Thesis Overview
2.1Design and Optimization
2.2Fault Tolerance Techniques
2.2.1 ERROR DETECTION TECHNIQUES
2.2.2 RE-EXECUTION
2.2.3 ROLLBACK RECOVERY WITH CHECKPOINTING
2.2.4 ACTIVE AND PASSIVE REPLICATION
2.2.5 HARDENING
2.4Design Optimization with Fault Tolerance
2.4.1 DESIGN FLOW WITH FAULT TOLERANCE TECHNIQUES
3.1.1 HARD REAL-TIME APPLICATIONS
3.1.5 ADAPTIVE STATIC CYCLIC SCHEDULING
3.1.6 QUALITY-OF-SERVICE MODEL
3.2Software-level Fault Tolerance Techniques
3.2.1 RECOVERY IN THE CONTEXT OF STATIC CYCLIC SCHEDULING
Chapter 4 Scheduling with Fault Tolerance Requirements
4.1Performance/Transparency Trade-offs
4.2Fault-Tolerant Conditional Process Graph
4.2.1 FTPG GENERATION
4.3Conditional Scheduling
4.3.1 SCHEDULE TABLE
4.3.2 CONDITIONAL SCHEDULING ALGORITHM
4.4Shifting-based Scheduling
4.4.1 SHIFTING-BASED SCHEDULING ALGORITHM
4.5Experimental Results
4.5.1 CASE STUDY
5.1Fault Tolerance Policy Assignment
5.1.1 MOTIVATIONAL EXAMPLES
5.2Mapping with Fault Tolerance
5.2.1 DESIGN OPTIMIZATION STRATEGY
5.2.2 SCHEDULING AND REPLICATION
5.2.3 OPTIMIZATION ALGORITHMS
5.3Experimental Results
6.1Optimizing the Number of Checkpoints
6.1.1 LOCAL CHECKPOINTING OPTIMIZATION
6.1.2 GLOBAL CHECKPOINTING OPTIMIZATION
6.2Policy Assignment with Checkpointing
6.2.1 OPTIMIZATION STRATEGY
6.2.2 OPTIMIZATION ALGORITHMS
6.3Experimental Results
7.1Utility and Dropping
7.2Single Schedule vs. Schedule Tree
7.3Problem Formulation
7.4Scheduling Strategy and Algorithms
7.4.1 SCHEDULE TREE GENERATION
7.4.2 GENERATION OF F-SCHEDULES
7.4.3 SWITCHING BETWEEN SCHEDULES
7.5Experimental Results
Chapter 8 Value-basedSchedulingfor Distributed Systems
8.1Scheduling
8.1.1 SIGNALLING AND SCHEDULES
8.1.2 SCHEDULE TREE GENERATION
8.1.3 SWITCHING BETWEEN SCHEDULES
8.2Experimental Results
the Number of Schedules (n)
9.1Hardened Architecture and Motivational Example
9.2System Failure Probability (SFP) Analysis
9.2.1 COMPUTATION EXAMPLE
10.1Motivational Example
10.2Problem Formulation
10.3Design Strategy and Algorithms
10.4Mapping Optimization
10.5Hardening/Re-execution Optimization
10.6Scheduling
10.7Experimental Results
10.8Conclusions
11.1Conclusions
11.1.1 HARD REAL-TIME SYSTEMS
11.1.2 MIXED SOFT AND HARD REAL-TIME SYSTEMS
11.2Future Work
Appendix I
Appendix II
Appendix III
List of Notations
List of Abbreviations
Bibliography
0 of .
Results for:
No results containing your search query
P. 1
viaiz_phd09

viaiz_phd09

Ratings: (0)|Views: 71|Likes:

More info:

Published by: Pithani Chandrasekharavaraprasad on Sep 06, 2010
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

05/24/2012

pdf

text

original

You're Reading a Free Preview
Pages 6 to 45 are not shown in this preview.
You're Reading a Free Preview
Pages 51 to 54 are not shown in this preview.
You're Reading a Free Preview
Pages 60 to 119 are not shown in this preview.
You're Reading a Free Preview
Pages 125 to 136 are not shown in this preview.
You're Reading a Free Preview
Pages 142 to 279 are not shown in this preview.

Activity (2)

You've already reviewed this. Edit your review.
1 thousand reads
1 hundred reads

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->