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

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

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


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 languageEnglish
Pages (from-to)1413-1431
Number of pages19
JournalComputers and Mathematics with Applications
Issue number9-10
Publication statusPublished - 2005 May


  • 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


Dive into the research topics of 'An equivalent network for divisible load scheduling in nonblocking mode of communication'. Together they form a unique fingerprint.

Cite this