Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.parco.2004.06.002
Title: Quantized load distribution for tree and bus-connected processors
Authors: Barlas, G.
Veeravalli, B. 
Keywords: Bus-connected processors
Data partitioning
Divisible load
Multi-installment
Processor trees
Quantized load
Issue Date: Jul-2004
Source: Barlas, G., Veeravalli, B. (2004-07). Quantized load distribution for tree and bus-connected processors. Parallel Computing 30 (7) : 841-865. ScholarBank@NUS Repository. https://doi.org/10.1016/j.parco.2004.06.002
Abstract: Divisible load analysis is a valuable tool for generating solutions to data-partitioning and distribution/scheduling problems for data-parallel applications. This paper addresses an essential step required for applying these solutions to real-life problems where computing loads are multiples of some fundamental problem-specific non-divisible load unit. The algorithms that are proposed to this end, are suitable for both single and multi-installment strategies. The worst-case performances of the algorithms are derived for two cases: single installment on a single-level tree and multiple installments on a bus network. Finally, an estimation on the expected performance of the algorithms is obtained from rigorous simulation tests. The extensive analysis that accompanies these tests, depicts many aspects of the parallel computation associated with parallel machine architectures and the load distribution strategies (single- or multi-installment) used. © 2004 Elsevier B.V. All rights reserved.
Source Title: Parallel Computing
URI: http://scholarbank.nus.edu.sg/handle/10635/57174
ISSN: 01678191
DOI: 10.1016/j.parco.2004.06.002
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

2
checked on Dec 14, 2017

WEB OF SCIENCETM
Citations

3
checked on Nov 17, 2017

Page view(s)

27
checked on Dec 17, 2017

Google ScholarTM

Check

Altmetric


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