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

DOI10.1016/J.CAMWA.2004.11.013zbMath1083.90023OpenAlexW2054747958MaRDI QIDQ2387373

Yanyan Li

Publication date: 2 September 2005

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: http://eprints.iisc.ac.in/3492/1/A108.pdf

zbMATH Keywords

schedulingdivisible jobsDivisible loadsProcessing timeSingle-level tree networkblocking and nonblocking communication modeBlocking and nonblocking mode of communicationEquivalent network

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Load partitioning and trade-off study for large matrix-vector computations in multicast bus networks with communictaion delays
• Scheduling a divisible task in a two-dimensional toroidal mesh
• Reconfigurable mesh algorithms for the Hough transform
• Distributed processing of divisible jobs with communication startup costs
• Scheduling divisible loads in a three-dimensional mesh of processors.
• The effect of start-up delays in scheduling divisible loads on bus networks: an alternate approach
• Divisible load scheduling in single-level tree networks: optimal sequencing and arrangement in the nonblocking mode of communication

This page was built for publication: An equivalent network for divisible load scheduling in nonblocking mode of communication