By Topic

An efficient file transmission algorithm for distributed computing systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chen, D.J. ; Inst. of Comput. Sci. & Inf. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan ; Chang, P.Y. ; Lee, Y.W.

In a distributed system, executing a program often requires the access of remote data files. An efficient data transmission strategy is thus important for real-time applications. Since data files may be replicated and their locations are transparent to the executed program, it becomes the system's responsibility to select a proper file server such that data can be transmitted in an effective way. We consider the scenario that a particular program needs several data files simultaneously for its execution. Each data file may have replicas across the network. The problem is how to find a collection of file servers and the routing paths such that the data transmission time is minimum. An exhaustive approach could of course find the optimal solution. However, it pays a high computation price. We thus propose a heuristic method. Results obtained from the proposed method are encouraging

Published in:

Parallel and Distributed Processing, 1996., Eighth IEEE Symposium on

Date of Conference:

23-26 Oct 1996