Resource allocation in grid computing
From MaRDI portal
Publication:835593
DOI10.1007/s10951-007-0018-8zbMath1168.90488OpenAlexW2128530065WikidataQ126155546 ScholiaQ126155546MaRDI QIDQ835593
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1871/11432
Related Items
On the Stability of Redundancy Models ⋮ The cost of collaboration ⋮ Queueing with redundant requests: exact analysis ⋮ Multi-Actor Markov Decision Processes ⋮ Job replication on multiserver systems ⋮ Grid scheduling with NBU service times ⋮ Subdiffusive Load Balancing in Time-Varying Queueing Systems ⋮ A Survey of Stability Results for Redundancy Systems ⋮ Replicate to the shortest queues
Cites Work
- Unnamed Item
- Unnamed Item
- Task allocation in a multi-server system
- Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
- Marked point processes as limits of Markovian arrival streams
- Optimal Scheduling on Parallel Processors with Precedence Constraints and General Costs
This page was built for publication: Resource allocation in grid computing