Please use this identifier to cite or link to this item:
|Title:||Adaptive load distribution strategies for divisible load processing on resource unaware multilevel tree networks||Authors:||Jia, J.
Resource unaware computation
|Issue Date:||Jul-2007||Citation:||Jia, J., Veeravalli, B., Ghose, D. (2007-07). Adaptive load distribution strategies for divisible load processing on resource unaware multilevel tree networks. IEEE Transactions on Computers 56 (7) : 999-1005. ScholarBank@NUS Repository. https://doi.org/10.1109/TC.2007.1068||Abstract:||In this paper, we propose load distribution strategies for divisible loads for networked computing environments where computation and communication resource characteristics are unknown and/or vary with time. The principle on which our strategies are formulated is based on using probing loads to estimate the network characteristics and using them to determine the best possible load distribution. This work extends the adaptive strategies proposed in an earlier work to multilevel general networks. These networks, while being more challenging, also offer several opportunities that can be exploited to make the probing phase more efficient. We propose two strategies, one static, which caters to the presence of unknown parameters, and the other dynamic, which caters to both unknown as well as time-varying network parameters. The proposed strategies are robust, resilient, and easily adaptable to network fluctuations. The algorithms are also shown to have a tracking ability, a property that is important in dynamic environments. Examples are presented to illustrate the salient features of these strategies. © 2007 IEEE.||Source Title:||IEEE Transactions on Computers||URI:||http://scholarbank.nus.edu.sg/handle/10635/54902||ISSN:||00189340||DOI:||10.1109/TC.2007.1068|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.