A new load distribution strategy for linear network with communication delays

S. Suresh; V. Mani; S. N. Omkar; H. J. Kim; N. Sundararajan

doi:10.1016/j.matcom.2008.06.003

A new load distribution strategy for linear network with communication delays

S. Suresh, V. Mani, S. N. Omkar, H. J. Kim, N. Sundararajan

Research output: Contribution to journal › Article › peer-review

10 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	1488-1501
Number of pages	14
Journal	Mathematics and Computers in Simulation
Volume	79
Issue number	5
DOIs	https://doi.org/10.1016/j.matcom.2008.06.003
Publication status	Published - 2009 Jan

Bibliographical note

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.

Keywords

Divisible load theory
Linear networks
Message processing time
Parallel processing
Send-and-receive model

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science
Numerical Analysis
Modelling and Simulation
Applied Mathematics

Access to Document

10.1016/j.matcom.2008.06.003

Cite this

@article{917595975ac24d7e98e7cce291aa67f7,

title = "A new load distribution strategy for linear network with communication delays",

abstract = "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.",

keywords = "Divisible load theory, Linear networks, Message processing time, Parallel processing, Send-and-receive model",

author = "S. Suresh and V. Mani and Omkar, {S. N.} and Kim, {H. J.} and N. Sundararajan",

note = "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.",

year = "2009",

month = jan,

doi = "10.1016/j.matcom.2008.06.003",

language = "English",

volume = "79",

pages = "1488--1501",

journal = "Mathematics and Computers in Simulation",

issn = "0378-4754",

publisher = "Elsevier B.V.",

number = "5",

}

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 -

A new load distribution strategy for linear network with communication delays

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this