Please use this identifier to cite or link to this item:
|Title:||Scheduling Divisible Tasks on Heterogeneous Single-level Tree Networks with Finite-size Buffers|
Divisible load theory
|Source:||Li, X.,Bharadwaj, V.,Ko, C.C. (2000). Scheduling Divisible Tasks on Heterogeneous Single-level Tree Networks with Finite-size Buffers. Proceedings of the Joint Conference on Information Sciences 5 (1) : 285-288. ScholarBank@NUS Repository.|
|Abstract:||This paper addresses the problem of scheduling a divisible load on a heterogeneous single-level tree network with processors having finite-size buffers. For the first time in the domain of DLT (Divisible Load Theory) literature, the problem of scheduling with finite-size buffers is addressed. For this case, we present a novel algorithm, referred to as Incremental Balancing Strategy (IBS), to obtain an optimal load distribution. Algorithm IBS adopts a strategy to feed the divisible load in a step-by-step incremental balancing fashion by taking advantage of the available closed-form solutions of the optimal scheduling for the case without buffer size constraints. A numerical example is presented to ease the understanding.|
|Source Title:||Proceedings of the Joint Conference on Information Sciences|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.