loading...
Availabilities and Costs of Reliable Fat-Btrees
Papeete, Tahiti, French Polynesia March 03-March 05
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PRDC.2004.127656710th Pacific Rim International Sympos ...
 This Article 
 
PDF
HTML
IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Jun Miyazaki, Nara Institute of Science & Technology
Yohei Abe, ACCESS Co., Ltd.,
Haruo Yokota, Tokyo Institute of Technology
The Fat-Btree is expected to be used as a parallel directory structure for high performance and highly reliable data intensive systems, such as databases and file systems. Though the Fat-Btree is essentially high performance, it needs to be highly reliable as well. In order to achieve high reliability, we introduce five configuration methods in this paper. We show not only their steady-state and computational availabilities but also cost related comparisons, so as to evaluate the properties of these configurations.
Citation:
Jun Miyazaki, Yohei Abe, Haruo Yokota, "Availabilities and Costs of Reliable Fat-Btrees," prdc, pp.163-172, 10th Pacific Rim International Symposium on Dependable Computing (PRDC'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions