A case for on-machine load balancing

DOI10.1016/J.JPDC.2010.11.003zbMATH Open1219.68078OpenAlexW2057995059MaRDI QIDQ635348FDOQ635348

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

Recommendations

• Load Balancing for Response Time
• Load balancing for response time
• On-Line Load Balancing of Temporary Tasks
• scientific article; zbMATH DE number 1629979
• Improved bounds for on-line load balancing

zbMATH Keywords

measurementevaluationmodelingresource allocationapplication studies resulting in better multiple-processor systemsload balancing and task assignmentsimulation of multiple-processor systems

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer system organization (68M99)

Cites Work

• Title not available (Why is that?)
• On the Assignment of Customers to Parallel Queues
• Deciding Which Queue to Join: Some Counterexamples
• Scheduling jobs on non-identical IFR processors to minimize general cost functions
• Title not available (Why is that?)
• Task assignment with unknown duration
• Title not available (Why is that?)
• Scheduling precedence-constrained jobs with stochastic processing times on parallel machines
• Scheduling jobs on heterogeneous processors
• 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
• 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 two classes of exponential jobs on parallel processors: structural results and worst-case analysis
• The optimality of LEPT in parallel machine scheduling

Cited In (1)

• Performance analysis of backup-task scheduling with deadline time in cloud computing

This page was built for publication: A case for on-machine load balancing

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