loading...
Adaptive Data Integrity through Dynamically Redundant Data Structures
March 04-March 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARES.2008.672008 Third International Conference o ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
This paper introduces a tool that allows designers to make use of adaptively redundant data structures with commodity programming languages such as C or Java. Designers using such tool can define redundant data structures in which the degree of redundancy is not fixed once and for all at design time, but rather it changes dynamically with respect to the disturbances experienced during the run time. Our approach attunes the degree of redundancy required to ensure data integrity to the actual faults being experienced by the system and provides an example of adaptive fault-tolerant software. We prove the effectiveness of our tool by showing that adaptive replication reaches the same effectiveness of static replication but consuming much less resources and computing time.
Index Terms:
Redundancy, data integrity, data structures
Citation:
Vincenzo De Florio, Chris Blondia, "Adaptive Data Integrity through Dynamically Redundant Data Structures," ares, pp.1213-1218, 2008 Third International Conference on Availability, Reliability and Security, 2008
Usage of this product signifies your acceptance of the Terms of Use.