標題: File allocation algorithms to minimize data transmission time in distributed computing systems
作者: Chang, PY
Chen, DJ
Kavi, KM
資訊工程學系
Department of Computer Science
關鍵字: distributed computing system (DCS);cut;multi-commodity flow;linear programming;data replication;branch and bound
公開日期: 1-Jul-2001
摘要: This work addresses a files allocation problem (FAP) in distributed computing systems. This FAP attempts to minimize 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 FAR 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.
URI: http://hdl.handle.net/11536/29557
ISSN: 1016-2364
期刊: JOURNAL OF INFORMATION SCIENCE AND ENGINEERING
Volume: 17
Issue: 4
起始頁: 633
結束頁: 646
Appears in Collections:Articles


Files in This Item:

  1. 000170207800006.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.