Efficient scheduling strategies for processing multiple divisible loads on bus networks

DOI10.1006/JPDC.2001.1778zbMath1006.68004OpenAlexW2087297185MaRDI QIDQ1604304

Bharadwaj Veeravalli, Gerassimos Barlas

Publication date: 4 July 2002

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

Full work available at URL: https://doi.org/10.1006/jpdc.2001.1778

zbMATH Keywords

schedulingbus networkscomputation delays

Mathematics Subject Classification ID

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

Related Items (2)

Scheduling multiple divisible loads in homogeneous star systems ⋮ TSP race: minimizing completion time in time-sensitive applications

This page was built for publication: Efficient scheduling strategies for processing multiple divisible loads on bus networks