- 期刊
- OpenAccess
File Allocation Algorithms to Minimize Data Transmission Time in Distributed Computing Systems
並列摘要
This work addresses a files allocation problem (FAP) in distributed computing systems. This FAP attempts to minimi7e the expected data transfer time for a specific program that must access several data files from non-perfect computer sites. We assume that communication capacity can be reserved; hence, the data transmission behavior is modeled as a many-to-one multi-commodity flow problem. A new critical-cut method is proposed to solve this reduced multi-commodity flow problem. Based on this method, two algorithms which use branch-and-bound are proposed for this FAP. The proposed algorithms are able to allocate data files having single copies or multiple replicated copies. Simulation results are presented to demonstrate the performance of the algorithms.
延伸閱讀
- 王務本（2011）。Improving the Performance of Associative Classification Algorithms with Rule Priorities〔碩士論文，淡江大學〕。華藝線上圖書館。https://doi.org/10.6846/TKU.2011.00175
- Chen, D. J., Chang, M. S., Sheng, M. C., & Horng, M. S. (1998). Time-Constrained Distributed Program Reliability Analysis. Journal of Information Science and Engineering, 14(4), 891-911. https://doi.org/10.6688/JISE.1998.14.4.9
- Tung, H. F. (2004). Design, Implementation, and Performance Evaluation of a High Performance Distributed File System [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2004.00312
- 彭寶嶙（2005）。Task Allocation Model for Heterogeneous Distributed Computing System〔碩士論文，淡江大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0002-0706200520080700
- 周彥全（2012）。Using Evolutionary Algorithms to Optimize Execution Time and Code Size in Iterative Compilation〔碩士論文，國立中正大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0033-2110201613525314