Grid scheduling divisible loads from two sources
From MaRDI portal
Publication:979924
DOI10.1016/J.CAMWA.2009.07.046zbMATH Open1189.68028OpenAlexW1968662283MaRDI QIDQ979924FDOQ979924
Authors: J. Martínez
Publication date: 28 June 2010
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2009.07.046
Recommendations
Parallel numerical computation (65Y05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)
Cites Work
Cited In (8)
- Divisible load scheduling in single-level tree networks: optimal sequencing and arrangement in the nonblocking mode of communication
- Grid scheduling divisible loads from two sources
- Title not available (Why is that?)
- An incentive-based distributed mechanism for scheduling divisible loads in tree networks
- Distributed scheduling strategy for divisible loads on arbitrarily configured distributed networks using load balancing via virtual routing
- An equivalent network for divisible load scheduling in nonblocking mode of communication
- Efficient job division for grids running SIMD algorithms
- Closed form solutions for bus and tree networks of processors load sharing a divisible job
This page was built for publication: Grid scheduling divisible loads from two sources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q979924)