Abstract
The DIN network is a special network, in which data can "live" by circulating. Circulating data can be rapidly accessed by a large number of hosts connected to the network. Scheduling strategies of processing divisible loads among hosts in DIN networks is studied to minimize the total processing time. We derive the closed-form solution of the processing time. Moreover, our experiment shows that the performance of our scheduling strategy can reduce the process time of a load up to previous 60%. © Springer-Verlag 2003.
Cite
CITATION STYLE
Dong, L., Ngoh, L. H., & Tan, J. G. (2004). Scheduling strategies of divisible loads in DIN networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2790, 236–240. https://doi.org/10.1007/978-3-540-45209-6_36
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
