Please use this identifier to cite or link to this item: https://doi.org/10.1109/ICON.2006.302689
Title: Resource unaware computing - A distributed strategy for divisible load processing on linear daisy chain networks
Authors: Jia, J.
Veeravalli, B. 
Keywords: Communication delays
Computation time
Divisible loads
Linear networks
Processing time
Issue Date: 2006
Source: Jia, J.,Veeravalli, B. (2006). Resource unaware computing - A distributed strategy for divisible load processing on linear daisy chain networks. Proceedings - 2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers 2 : 547-552. ScholarBank@NUS Repository. https://doi.org/10.1109/ICON.2006.302689
Abstract: In this paper we present a novel load distribution strategy for scheduling divisible loads on linear networks, when the speeds of the computing nodes and the speeds of the communication links are unknown. This practical assumption is captured in our problem formulation and we present a novel strategy, referred to as Early Start Strategy (ESS), to generate a load distribution. Our strategy estimates the speed parameters and takes distinct advantage in utilizing a processor that responds earliest in the computation and including other fast processors in a progressive manner in phases to minimize the overall processing time. We analyze the strategy under several influencing parameters such as, load size, network size, and probe load size. We present simulation studies to validate all the theoretical findings and quantify the performance of our strategy. © 2006 IEEE.
Source Title: Proceedings - 2006 IEEE International Conference on Networks, ICON 2006 - Networking-Challenges and Frontiers
URI: http://scholarbank.nus.edu.sg/handle/10635/71632
ISBN: 0780397460
DOI: 10.1109/ICON.2006.302689
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

24
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.