Optimal static load balancing in distributed computer systems
Journal of the ACM (JACM)
A distributed load-balancing policy for a multicomputer
Software—Practice & Experience
Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
Allocating programs containing branches and loops within a multiple processor system
IEEE Transactions on Software Engineering
A comparison of receiver-initiated and sender-initiated adaptive load sharing
Performance Evaluation
The limited performance benefits of migrating active processes for load sharing
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Analysis of the Effects of Delays on Load Sharing
IEEE Transactions on Computers
Adaptive load sharing in heterogeneous distributed systems
Journal of Parallel and Distributed Computing
Load-balancing heuristics and process behavior
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
A comparison of priority-based decentralized load balancing policies
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
Using Processor-Cache Affinity Information in Shared-Memory Multiprocessor Scheduling
IEEE Transactions on Parallel and Distributed Systems
Analysis of Contention in Multiprocessor Scheduling
Performance '90 Proceedings of the 14th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
Load balancing in homogeneous broadcast distributed systems
Proceedings of the Computer Network Performance Symposium
SOSP '83 Proceedings of the ninth ACM symposium on Operating systems principles
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Using processor affinity in loop scheduling on shared-memory multiprocessors
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Scheduling and page migration for multiprocessor compute servers
ASPLOS VI Proceedings of the sixth international conference on Architectural support for programming languages and operating systems
Optimal stochastic scheduling in multiclass parallel queues
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
ACM Computing Surveys (CSUR)
Using Processor-Cache Affinity Information in Shared-Memory Multiprocessor Scheduling
IEEE Transactions on Parallel and Distributed Systems
Using Processor Affinity in Loop Scheduling on Shared-Memory Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Analysis of Processor Allocation in Multiprogrammed, Distributed-Memory Parallel Processing Systems
IEEE Transactions on Parallel and Distributed Systems
A Tool to Schedule Parallel Applications on Multiprocessors: The NANOS CPU MANAGER
IPDPS '00/JSSPP '00 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Analysis of cycle stealing with switching cost
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Modeling and Analysis of Task Migration in Shared-Memory Multiprocessor Computer Systems
MASCOTS '96 Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Analysis of cycle stealing with switching times and thresholds
Performance Evaluation
Optimal scheduling in a multiserver stochastic network
ACM SIGMETRICS Performance Evaluation Review
Performance Evaluation of Work Stealing for Streaming Applications
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Dynamic load balancing in MPI jobs
ISHPC'05/ALPS'06 Proceedings of the 6th international symposium on high-performance computing and 1st international conference on Advanced low power systems
Collaborative scheduling of DAG structured computations on multicore processors
Proceedings of the 7th ACM international conference on Computing frontiers
A mean field model of work stealing in large-scale systems
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Perfect sampling of load sharing policies in large scale distributed systems
ASMTA'10 Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications
ARCS'11 Proceedings of the 24th international conference on Architecture of computing systems
Join-Idle-Queue: A novel load balancing algorithm for dynamically scalable web services
Performance Evaluation
Pull versus push mechanism in large distributed networks: closed form results
Proceedings of the 24th International Teletraffic Congress
| Hi-index | 0.00 |
In shared-memory multiprocessor systems it may be more efficient to schedule a task on one processor than on mother. Due to the inevitability of idle processors in these environments, there exists an important tradeoff between keeping the workload balanced and scheduling tasks where they run most efficiently. The purpose of an adaptive task migration policy is to determine the appropriate balance between the extremes of this load sharing tradeoff.We make the observation that there are considerable differences between this load sharing problem in distributed and shared-memory multiprocessor systems, and we formulate a queueing theoretic model of task migration to study the problem. A detailed mathematical analysis of the model is developed, which includes the effects of increased contention for system resources induced by the task migration policy. Our objective is to provide a better understanding of task migration in shared-memory multiprocessor environments. In particular, we illustrate the potential for significant improvements in system performance, and we show that even when migration costs are large it may still be beneficial to migrate waiting tasks to idle processors. We further demonstrate the potential for unstable behavior under migratory scheduling policies, and we provide optimal policy thresholds that yield the best performance and avoid this form of processor thrashing.