Closed form solutions for bus and tree networks of processors load sharing a divisible job

DOI10.1109/12.324544zbMATH Open1068.68606OpenAlexW1992067203MaRDI QIDQ4419786FDOQ4419786

Authors: Te-Yu Hsiung, Thomas G. Robertazzi, Sameer Bataineh 

Publication date: 16 October 2003

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.324544

Recommendations

• A product form solution for tree networks with divisible loads
• Scheduling divisible loads in bus networks with arbitrary processor release times
• Grid scheduling divisible loads from two sources
• Distributed processing of divisible jobs with communication startup costs
• Design and analysis of load distribution strategies with start-up costs in scheduling divisible loads on distributed networks

Mathematics Subject Classification ID

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

Cited In (7)

• Toward an analytical solution to task allocation, processor assignment, and performance evaluation of network processors
• A product form solution for tree networks with divisible loads
• Large matrix-vector products on distributed bus networks with communication delays using the divisible load paradigm: Performance analysis and simulation
• Complexity of master-slave tasking on heterogeneous trees
• Distributing and scheduling divisible task on parallel communicating processors.
• Scheduling a divisible task in a two-dimensional toroidal mesh
• Computing BLAS level-2 operations on workstation clusters using the divisible load paradigm

This page was built for publication: Closed form solutions for bus and tree networks of processors load sharing a divisible job

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4419786)