Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/72903
Title: Scheduling Divisible Tasks on Heterogeneous Single-level Tree Networks with Finite-size Buffers
Authors: Li, X.
Bharadwaj, V. 
Ko, C.C. 
Keywords: Communication delays
Divisible load theory
Finite-size buffer
Heterogeneous computing
Processing time
Issue Date: 2000
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
URI: http://scholarbank.nus.edu.sg/handle/10635/72903
ISBN: 0964345692
Appears in Collections:Staff Publications

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

Page view(s)

22
checked on Dec 9, 2017

Google ScholarTM

Check


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