An equivalent network for divisible load scheduling in nonblocking mode of communication

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

doi:10.1016/j.camwa.2004.11.013

An equivalent network for divisible load scheduling in nonblocking mode of communication

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

School of Cybersecurity

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

5 Citations (Scopus)

Abstract

Scheduling divisible loads in nonblocking mode of communication in a single-level tree network is considered. For this scheduling problem, an equivalent single-level tree network in blocking mode of communication is derived. This equivalent network can be easily obtained by changing the speed parameters of the processors in the network. The advantages of this equivalent network are that we can easily obtain the results on when to distribute the load to processors in the network, optimal sequencing and arrangement of processors and the effect of start-up time in nonblocking mode of communication. Numerical examples are presented for ease of understanding the equivalent network concept.

Original language	English
Pages (from-to)	1413-1431
Number of pages	19
Journal	Computers and Mathematics with Applications
Volume	49
Issue number	9-10
DOIs	https://doi.org/10.1016/j.camwa.2004.11.013
Publication status	Published - 2005 May

Keywords

Blocking and nonblocking mode of communication
Divisible loads
Equivalent network
Processing time
Single-level tree network

ASJC Scopus subject areas

Modelling and Simulation
Computational Theory and Mathematics
Computational Mathematics

Access to Document

10.1016/j.camwa.2004.11.013

Cite this

@article{710478aa2f9c4f1c9a8fb24a423f4c53,

title = "An equivalent network for divisible load scheduling in nonblocking mode of communication",

abstract = "Scheduling divisible loads in nonblocking mode of communication in a single-level tree network is considered. For this scheduling problem, an equivalent single-level tree network in blocking mode of communication is derived. This equivalent network can be easily obtained by changing the speed parameters of the processors in the network. The advantages of this equivalent network are that we can easily obtain the results on when to distribute the load to processors in the network, optimal sequencing and arrangement of processors and the effect of start-up time in nonblocking mode of communication. Numerical examples are presented for ease of understanding the equivalent network concept.",

keywords = "Blocking and nonblocking mode of communication, Divisible loads, Equivalent network, Processing time, Single-level tree network",

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

note = "Funding Information: This paper was in part supported by the Media Services Research Center (MSRC-ITRC), Kangwon National University, Korea. Discussions with Prof. D. Ghose is gratefully acknowledged. *Author to whom all correspondence should be addressed, 0898-1221/05/$ - see front matter (~) 2005 Elsevier Ltd. doi: 10.1016/j.camwa.2004.11.013",

year = "2005",

month = may,

doi = "10.1016/j.camwa.2004.11.013",

language = "English",

volume = "49",

pages = "1413--1431",

journal = "Computers and Mathematics with Applications",

issn = "0898-1221",

publisher = "Elsevier Limited",

number = "9-10",

}

TY - JOUR

T1 - An equivalent network for divisible load scheduling in nonblocking mode of communication

AU - Suresh, S.

AU - Mani, V.

AU - Omkar, S. N.

AU - Kim, H. J.

N1 - Funding Information: This paper was in part supported by the Media Services Research Center (MSRC-ITRC), Kangwon National University, Korea. Discussions with Prof. D. Ghose is gratefully acknowledged. *Author to whom all correspondence should be addressed, 0898-1221/05/$ - see front matter (~) 2005 Elsevier Ltd. doi: 10.1016/j.camwa.2004.11.013

PY - 2005/5

Y1 - 2005/5

N2 - Scheduling divisible loads in nonblocking mode of communication in a single-level tree network is considered. For this scheduling problem, an equivalent single-level tree network in blocking mode of communication is derived. This equivalent network can be easily obtained by changing the speed parameters of the processors in the network. The advantages of this equivalent network are that we can easily obtain the results on when to distribute the load to processors in the network, optimal sequencing and arrangement of processors and the effect of start-up time in nonblocking mode of communication. Numerical examples are presented for ease of understanding the equivalent network concept.

AB - Scheduling divisible loads in nonblocking mode of communication in a single-level tree network is considered. For this scheduling problem, an equivalent single-level tree network in blocking mode of communication is derived. This equivalent network can be easily obtained by changing the speed parameters of the processors in the network. The advantages of this equivalent network are that we can easily obtain the results on when to distribute the load to processors in the network, optimal sequencing and arrangement of processors and the effect of start-up time in nonblocking mode of communication. Numerical examples are presented for ease of understanding the equivalent network concept.

KW - Blocking and nonblocking mode of communication

KW - Divisible loads

KW - Equivalent network

KW - Processing time

KW - Single-level tree network

UR - http://www.scopus.com/inward/record.url?scp=23344442909&partnerID=8YFLogxK

U2 - 10.1016/j.camwa.2004.11.013

DO - 10.1016/j.camwa.2004.11.013

M3 - Article

AN - SCOPUS:23344442909

SN - 0898-1221

VL - 49

SP - 1413

EP - 1431

JO - Computers and Mathematics with Applications

JF - Computers and Mathematics with Applications

IS - 9-10

ER -

An equivalent network for divisible load scheduling in nonblocking mode of communication

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this