Divisible load scheduling in single-level tree networks: optimal sequencing and arrangement in the nonblocking mode of communication

DOI10.1016/S0898-1221(03)90196-9zbMath1116.90351MaRDI QIDQ1879566

Yanyan Li

Publication date: 23 September 2004

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

zbMATH Keywords

Divisible loadsProcessing timeNonblocking mode of communicationOptimal load sequenceSingle-level tree network

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (2)

An equivalent network for divisible load scheduling in nonblocking mode of communication ⋮ Optimal algorithm for scheduling large divisible workload on heterogeneous system

Uses Software

• MPI

Cites Work

• Load partitioning and trade-off study for large matrix-vector computations in multicast bus networks with communictaion delays
• Reconfigurable mesh algorithms for the Hough transform
• Unnamed Item
• Unnamed Item

This page was built for publication: Divisible load scheduling in single-level tree networks: optimal sequencing and arrangement in the nonblocking mode of communication