Minimal cost replicated file system with an availability constraint

檔案

日期

1999-10-01

類型

期刊名稱

INFORMATION SCIENCES

卷期與頁次

第 119 卷第 1-2 期,頁 107–123

ISSN

0020-0255

語言

英文

摘要

In a replicated file system, copies of the same file are kept in different servers sb that failures of some servers can be tolerant. The goal of a replicated file system is to increase the probability that an operation tread or write) can be performed, i.e., to increase the availability of the file. Giving a minimal acceptable availability of a file, the objective is to minimize the total cost required to build a replicated file system that satisfies the availability constraint. In this paper, an efficient algorithm is proposed to find the minimal cost replicated file system. (C) 1999 Elsevier Science Inc. All rights reserved.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Chang, H., & Yuan, S. (1999). Minimal cost replicated file system with an availability constraint. INFORMATION SCIENCES, 119(1-2), 107–123. https://doi.org/10.1016/S0020-0255(99)00024-9

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/31078