TY - JOUR
T1 - A new load distribution strategy for linear network with communication delays
AU - Suresh, S.
AU - Mani, V.
AU - Omkar, S. N.
AU - Kim, H. J.
AU - Sundararajan, N.
N1 - Funding Information:
This work was in part supported by ITRC, Korea University, under the auspices of IITA and MIC, Korea. We appreciate Saraswathi Sundararajan for providing proof-reading of this manuscript.
Copyright:
Copyright 2009 Elsevier B.V., All rights reserved.
PY - 2009/1
Y1 - 2009/1
N2 - In this paper, we propose a new load distribution strategy called 'send-and-receive' for scheduling divisible loads, in a linear network of processors with communication delay. This strategy is designed to optimally utilize the network resources and thereby minimizes the processing time of entire processing load. A closed-form expression for optimal size of load fractions and processing time are derived when the processing load originates at processor located in boundary and interior of the network. A condition on processor and link speed is also derived to ensure that the processors are continuously engaged in load distributions. This paper also presents a parallel implementation of 'digital watermarking problem' on a personal computer-based Pentium Linear Network (PLN) topology. Experiments are carried out to study the performance of the proposed strategy and results are compared with other strategies found in literature.
AB - In this paper, we propose a new load distribution strategy called 'send-and-receive' for scheduling divisible loads, in a linear network of processors with communication delay. This strategy is designed to optimally utilize the network resources and thereby minimizes the processing time of entire processing load. A closed-form expression for optimal size of load fractions and processing time are derived when the processing load originates at processor located in boundary and interior of the network. A condition on processor and link speed is also derived to ensure that the processors are continuously engaged in load distributions. This paper also presents a parallel implementation of 'digital watermarking problem' on a personal computer-based Pentium Linear Network (PLN) topology. Experiments are carried out to study the performance of the proposed strategy and results are compared with other strategies found in literature.
KW - Divisible load theory
KW - Linear networks
KW - Message processing time
KW - Parallel processing
KW - Send-and-receive model
UR - http://www.scopus.com/inward/record.url?scp=57649095436&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=57649095436&partnerID=8YFLogxK
U2 - 10.1016/j.matcom.2008.06.003
DO - 10.1016/j.matcom.2008.06.003
M3 - Article
AN - SCOPUS:57649095436
SN - 0378-4754
VL - 79
SP - 1488
EP - 1501
JO - Mathematics and Computers in Simulation
JF - Mathematics and Computers in Simulation
IS - 5
ER -