完整後設資料紀錄
DC 欄位語言
dc.contributor.authorChen, DJen_US
dc.contributor.authorChang, PYen_US
dc.contributor.authorLee, YWen_US
dc.date.accessioned2014-12-08T15:27:38Z-
dc.date.available2014-12-08T15:27:38Z-
dc.date.issued1996en_US
dc.identifier.isbn0-8186-7683-3en_US
dc.identifier.urihttp://hdl.handle.net/11536/19891-
dc.description.abstractIn 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 system's responsibility to select a proper file server such that data can be transmitted in an effective way. In this paper, we consider the scenario that a particular program needs several data files simultaneously for its execution. Each datafile may has 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 if pays for high computation price. We thus proposes a heuristic method. Results obtained from the proposed method are encouraging.en_US
dc.language.isoen_USen_US
dc.titleAn efficient file transmission algorithm for distributed computing systemsen_US
dc.typeProceedings Paperen_US
dc.identifier.journalEIGHTH IEEE SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGSen_US
dc.citation.spage48en_US
dc.citation.epage51en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1996BG88V00006-
顯示於類別:會議論文