Design and analysis of load distribution strategies with start-up costs in scheduling divisible loads on distributed networks

DOI10.1016/S0895-7177(00)00179-5zbMath0961.68020MaRDI QIDQ1591881

R. Smith

Publication date: 14 January 2001

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

zbMATH Keywords

greedy algorithmbus networksdivisible loads

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Optimal algorithm for scheduling large divisible workload on heterogeneous system

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Scheduling divisible loads in bus networks with arbitrary processor release times
• Distributed processing of divisible jobs with communication startup costs
• An efficient load distribution strategy for a distributed linear network of processors with communication delays
• Load sequencing for a parallel processing utility

This page was built for publication: Design and analysis of load distribution strategies with start-up costs in scheduling divisible loads on distributed networks