Advanced Search
CS Search Google Search
Subscribers, please login

Published Articles >> Table of Contents >> Abstract

10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC'04)   pp. 163-172
Availabilities and Costs of Reliable Fat-Btrees

Full Article Text: Download PDF of full textBuy this article

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PRDC.2004.1276567
Send link to a friend

Abstract
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.
Additional Information

Citation:  Jun Miyazaki, Yohei Abe, Haruo Yokota, "Availabilities and Costs of Reliable Fat-Btrees," prdc, pp. 163-172,  10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC'04),  2004

Similar Articles

Abstract Contents
Abstract
Citation




Free access to

  • Abstracts
  • Selected PDFs

Electronic subscribers login to:

  • Access HTML/PDFs of full text articles

Subscription information

Get a Web account

PDFs require Adobe Acrobat Reader.

Peer Review Notice

Give us Feedback