Distributed scheduling strategy for divisible loads on arbitrarily configured distributed networks using load balancing via virtual routing

DOI10.1016/j.jpdc.2006.05.007zbMath1178.68112OpenAlexW1987326724MaRDI QIDQ861318

Zeng Zeng, Bharadwaj Veeravalli

Publication date: 9 January 2007

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2006.05.007

zbMATH Keywords

schedulingload balancingprocessing timeminimum cost spanning treearbitrary networksdivisible load theoryrouting path

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

An incentive-based distributed mechanism for scheduling divisible loads in tree networks

This page was built for publication: Distributed scheduling strategy for divisible loads on arbitrarily configured distributed networks using load balancing via virtual routing