Simulations of three adaptive, decentralized controlled, job scheduling algorithms
Computer Networks and ISDN Systems
Optimal static load balancing in distributed computer systems
Journal of the ACM (JACM)
MOS: a multicomputer distributed operating system
Software—Practice & Experience
A distributed load-balancing policy for a multicomputer
Software—Practice & Experience
Stability and Distributed Scheduling Algorithms
IEEE Transactions on Software Engineering
Effects of job loading policies for multiprogramming systems in processing a job stream
ACM Transactions on Computer Systems (TOCS)
UNIX process behavior and load balancing among loosely-coupled computers
Proc. of the international seminar on Teletraffic analysis and computer performance evaluation
A comparison of receiver-initiated and sender-initiated adaptive load sharing (extended abstract)
SIGMETRICS '85 Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Load balancing in homogeneous broadcast distributed systems
Proceedings of the Computer Network Performance Symposium
LOCUS a network transparent, high reliability distributed system
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
An experimental investigation of scheduling strategies for UNIX
SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems
A User-Process Oriented Performance Study of Ethernet Networking Under
A User-Process Oriented Performance Study of Ethernet Networking Under
A survey of process migration mechanisms
ACM SIGOPS Operating Systems Review
A Trace-Driven Simulation Study of Dynamic Load Balancing
IEEE Transactions on Software Engineering
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
Predictability of Process Resource Usage: A Measurement-Based Study on UNIX
IEEE Transactions on Software Engineering
Analysis of task migration in shared-memory multiprocessor scheduling
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
An examination of strategies for estimating capacity to share among private workstations
SIGSMALL '91 Proceedings of the 1991 ACM SIGSMALL/PC symposium on Small systems
Design and Analysis of Master/Slave Multiprocessors
IEEE Transactions on Computers
The Probability of Load Balancing Success in a Homogeneous Network
IEEE Transactions on Software Engineering
Estimating Capacity for Sharing in a Privately Owned Workstation Environment
IEEE Transactions on Software Engineering
An examination of strategies for estimating capacity to share among private workstations
ACM SIGSMALL/PC Notes
A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors
ACM Transactions on Computer Systems (TOCS)
A periodic symmetrically-initiated load balancing algorithm for distributed systems
ACM SIGOPS Operating Systems Review
Runtime compilation techniques for data partitioning and communication schedule reuse
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
An intelligent dynamic load balancer for workstation clusters
ACM SIGOPS Operating Systems Review
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Scheduling memory constrained jobs on distributed memory parallel computers
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Exploiting process lifetime distributions for dynamic load balancing
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Exploiting process lifetime distributions for dynamic load balancing
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Exploiting process lifetime distributions for dynamic load balancing
ACM Transactions on Computer Systems (TOCS)
A comparative study of load sharing in heterogeneous multicomputer systems
ANSS '92 Proceedings of the 25th annual symposium on Simulation
On comparing load indices using oracle simulation
WSC' 90 Proceedings of the 22nd conference on Winter simulation
Optimal schedules for data-parallel cycle-stealing in networks of workstations (extended abstract)
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Exploiting Fine-Grained Idle Periods in Networks of Workstations
IEEE Transactions on Parallel and Distributed Systems
ACM Computing Surveys (CSUR)
Analysis of SRPT scheduling: investigating unfairness
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Difficulties in simulating the internet
IEEE/ACM Transactions on Networking (TON)
Task assignment with unknown duration
Journal of the ACM (JACM)
Optimal Schedules for Cycle-Stealing in a Network of Workstations with a Bag-of-Tasks Workload
IEEE Transactions on Parallel and Distributed Systems
ACM Transactions on Computer Systems (TOCS)
Linger Longer: fine-grain cycle stealing for networks of workstations
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Job placement with unknown duration and no preemption
ACM SIGMETRICS Performance Evaluation Review
Host load prediction using linear models
Cluster Computing
Online Prediction of the Running Time of Tasks
Cluster Computing
Queueing Systems: Theory and Applications
Prediction-Based Dynamic Load-Sharing Heuristics
IEEE Transactions on Parallel and Distributed Systems
Runtime Support and Compilation Methods for User-Specified Irregular Data Distributions
IEEE Transactions on Parallel and Distributed Systems
Predicting Queue Times on Space-Sharing Parallel Computers
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Metrics for Parallel Job Scheduling and Their Convergence
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
SRPT Scheduling for Web Servers
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
Performance Evaluation with Heavy Tailed Distributions
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
Workload Modeling for Performance Evaluation
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
On Choosing a Task Assignment Policy for a Distributed Server System
TOOLS '98 Proceedings of the 10th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Performance Evaluation with Heavy Tailed Distributions
TOOLS '00 Proceedings of the 11th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
The Statistical Properties of Hoast Load
LCR '98 Selected Papers from the 4th International Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers
Cycle stealing under immediate dispatch task assignment
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Measuring Scalability of Resource Management Systems
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02
Models and Modeling Infrastructures for Global Computational Platforms
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 10 - Volume 11
Optimal capacity allocation for Web systems with end-to-end delay guarantees
Performance Evaluation - Performance 2005
Systems with multiple servers under heavy-tailed workloads
Performance Evaluation - Performance 2005
On checkpointing and heavy-tails in unreliable computing environments
ACM SIGMETRICS Performance Evaluation Review
Predictive Resource Management for Wearable Computing
Proceedings of the 1st international conference on Mobile systems, applications and services
The statistical properties of host load
Scientific Programming
Design and analysis of a replicated server architecture for supporting IP-Host mobility
ACM SIGMOBILE Mobile Computing and Communications Review
Adaptive work-stealing with parallelism feedback
ACM Transactions on Computer Systems (TOCS)
Planning and execution with phase transitions
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
A collaborative-aware task balancing delivery model for clusters
GPC'07 Proceedings of the 2nd international conference on Advances in grid and pervasive computing
Activity regions for the specification of discrete event systems
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
A novel resource-driven job allocation scheme for desktop grid environments
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Modeling machine availability in enterprise and wide-area distributed computing environments
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
On the nature and impact of self-similarity in real-time systems
Real-Time Systems
Distributed oblivious load balancing using prioritized job replication
Proceedings of the 8th International Conference on Network and Service Management
Hi-index | 0.00 |
Dynamic load balancing in a system of loosely-coupled homogeneous processors may employ both judicious initial placement of processes and migration of existing processes to processors with fewer resident processes. In order to predict the possible benefits of these dynamic assignment techniques, we analyzed the behavior (CPU, disk, and memory use) of 9.5 million Unix* processes during normal use. The observed process behavior was then used to drive simulation studies of particular dynamic assignment heuristics.Let F(·) be the probability distribution of the amount of CPU time used by an arbitrary process. In the environment studied we found:(1-F(x)) ≉ rx-c, 1.05cF(·) is far enough from exponential to make exponential models of little use.With a foreground-background process scheduling policy in each processor, simple heuristics for initial placement and processor migration can significantly improve the response ratios of processes that demand exceptional amounts of CPU, without harming the response ratios of ordinary processes.