A case for on-machine load balancing
From MaRDI portal
Publication:635348
DOI10.1016/J.JPDC.2010.11.003zbMath1219.68078OpenAlexW2057995059MaRDI QIDQ635348
Shoukat Ali, Zehra Shah, Behdis Eslamnour
Publication date: 19 August 2011
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.2010.11.003
modelingevaluationresource allocationmeasurementapplication studies resulting in better multiple-processor systemsload balancing and task assignmentsimulation of multiple-processor systems
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer system organization (68M99)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling jobs on heterogeneous processors
- Task assignment with unknown duration
- A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors
- Stochastically Minimizing Total Delay of Jobs Subject to Random Deadlines
- Preemptive Scheduling of Stochastic Jobs with a Two-Stage Processing Time Distribution on M + 1 Parallel Machines
- On the Assignment of Customers to Parallel Queues
- Deciding Which Queue to Join: Some Counterexamples
- The “Largest Variance First” Policy in Some Stochastic Scheduling Problems
- Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
- Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
- Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
- Minimizing the Expected Makespan in Stochastic Flow Shops
- Scheduling jobs on non-identical IFR processors to minimize general cost functions
- Scheduling two classes of exponential jobs on parallel processors: structural results and worst-case analysis
- The optimality of LEPT in parallel machine scheduling
This page was built for publication: A case for on-machine load balancing
