On the Analysis of Randomized Load Balancing Schemes

No abstract is available for this paper.

• Publication year

  1997

• Venue

  ACM Symposium on Parallelism in Algorithms and Architectures

• Publication date

  1997-06-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s002240000122
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Qualitative Analysis of Large Scale Dynamical Systems

  2012cited by this paper
• Balanced Allocations

  1999influential reference
• Load profiling: a methodology for scheduling real-time tasks in a distributed system

  1997cited by this paper
• Analysis of Simple Algorithms for Dynamic Load Balancing

  1997cited by this paper
• Design of the Rio (randomized I/o) Storage Server

  1997cited by this paper
• Load Profiling in Distributed Real-Time Systems

  1997cited by this paper
• How useful is old information (extended abstract)?

  1997cited by this paper
• Queueing system with selection of the shortest of two queues: an assymptotic approach

  1996cited by this paper
• Constant time per edge is optimal on rooted tree networks

  1996cited by this paper
• Load balancing and density dependent jump Markov processes

  1996cited by this paper
• Serverless network file systems

  1995cited by this paper
• Differential Equations for Random Processes and Random Graphs

  1995cited by this paper
• Bounding delays in packet-routing networks

  1995cited by this paper
• Bounds on the greedy routing algorithm for array networks

  1994cited by this paper
• Upper and lower bounds for the waiting time in the symmetric shortest queue system

  1994cited by this paper
• Balanced allocations (extended abstract)

  1994cited by this paper
• Efficient PRAM simulation on a distributed memory machine

  1992cited by this paper
• Extremal properties of the FIFO discipline in queueing networks

  1992cited by this paper
• The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme

  1991cited by this paper
• Analysis of the asymmetric shortest queue problem

  1991influential reference
• The efficiency of greedy routing in hypercubes and butterflies

  1991cited by this paper
• Analysis of the symmetric shortest queue problem

  1990cited by this paper
• An optimal algorithm for on-line bipartite matching

  1990cited by this paper
• Asymptotic analysis of an assignment problem arising in a distributed communications protocol

  1988cited by this paper
• The limited performance benefits of migrating active processes for load sharing

  1988cited by this paper
• Approximation of Population Processes

  1987cited by this paper
• A Trace-Driven Simulation Study of Dynamic Load Balancing

  1987influential reference
• Adaptive load sharing in homogeneous distributed systems

  1986cited by this paper
• A comparison of receiver-initiated and sender-initiated adaptive load sharing (extended abstract)

  1985cited by this paper
• Maximum Matchings in Sparse Random Graphs

  1981cited by this paper
• Reversibility and Stochastic Networks

  1980cited by this paper
• Review: Anthony N. Michel and Richard K. Miller, Qualitative analysis of large scale dynamical systems

  1978cited by this paper
• Strong approximation theorems for density dependent Markov chains

  1978cited by this paper
• Queueing Systems: Volume I-Theory

  1975cited by this paper
• Limit theorems for sequences of jump Markov processes approximating ordinary differential processes

  1971cited by this paper
• Solutions of ordinary differential equations as limits of pure jump markov processes

  1970cited by this paper

• Distributed Load Balancing in the Face of Reappearance Dependencies

  2024cites this paper
• An asymptotically optimal algorithm for generating bin cardinalities

  2024cites this paper
• SUMF: Efficient, Stable, and Reliable SPDK Userspace IO Multipathing Framework

  2024cites this paper
• Resource Management in Aurora Serverless

  2024cites this paper
• Stream-aware indexing for distributed inequality join processing

  2024cites this paper
• Provably Good Randomized Strategies for Data Placement in Distributed Key-Value Stores

  2023cites this paper
• An Improved Drift Theorem for Balanced Allocations

  2023cites this paper
• Mean-Biased Processes for Balanced Allocations

  2023cites this paper
• Balanced Allocations in Batches: The Tower of Two Choices

  2023cites this paper
• Balanced Allocation in Batches: The Tower of Two Choices

  2023cites this paper
• The Power of Filling in Balanced Allocations

  2022cites this paper
• Balanced Allocations with the Choice of Noise

  2022cites this paper
• Pre‐filtering based summarization for data partitioning in distributed stream processing

  2021cites this paper
• Balanced Allocations: Caching and Packing, Twinning and Thinning

  2021cites this paper
• Balanced Allocations with Incomplete Information: The Power of Two Queries

  2021cites this paper
• Martingales and buffer overflow for the symmetric shortest queue model

  2019cites this paper
• PageRankVM: A PageRank Based Algorithm with Anti-Collocation Constraints for Virtual Machine Placement in Cloud Datacenters

  2018cites this paper
• Optimal Ball Recycling

  2018cites this paper
• Multiserver queueing systems in heavy traffic

  2017cites this paper
• A novel performance constrained power management framework for cloud computing using an adaptive node scaling approach

  2017cites this paper
• Stationary analysis of the shortest queue problem

  2017cites this paper
• Node discovery with development of routing tree in wireless networks

  2017cites this paper
• Local-on-Average Distributed Tasks

  2016cites this paper
• System Modeling and Evaluation on Factors Influencing Power and Performance Management of Cloud Load Balancing Algorithms

  2016cites this paper
• Supermarket Queueing System in the Heavy Traffic Regime. Short Queue Dynamics

  2016cites this paper
• Reward processes and performance simulation in supermarket models with different servers

  2015cites this paper
• On a doubly dynamically controlled supermarket model with impatient customers

  2015influential citation
• Efficient Use of Geographically Spread Cloud Resources Research

  2014cites this paper
• Block-structured supermarket models

  2014cites this paper
• Two-Choice Randomized Dynamic I/O Scheduler for Object Storage Systems

  2014cites this paper
• Scheduling Algorithms in Web Servers Clusters

  2013cites this paper
• On the interplay between resource-management overhead and performance in sensor networks: An information theoretic approach

  2013cites this paper
• The mean-field computation in a supermarket model with server multiple vacations

  2013cites this paper
• STUDY OF SERVER LOAD BALANCING TECHNIQUES

  2013cites this paper
• Efficient Use of Geographically Spread Cloud Resources

  2013cites this paper
• On the supermarket model with memory

  2012cites this paper
• Tail Probabilities in Queueing Processes

  2012cites this paper
• Super-Exponential Solution in Markovian Supermarket Models: Framework and Challenge

  2011influential citation
• Tight bounds for parallel randomized load balancing

  2011influential citation
• A Matrix-Analytic Solution for Randomized Load Balancing Models with Phase-Type Service Times

  2011cites this paper
• The Chaos of Propagation in a Retrial Supermarket Model

  2011influential citation
• Super-Exponential Solution for a Retrial Supermarket Model

  2011cites this paper
• Randomized load balancing strategies with churn resilience in peer-to-peer networks

  2011influential citation
• Randomised load balancing

  2011cites this paper
• Synchronization and symmetry breaking in distributedsystems

  2011cites this paper
• Doubly Exponential Solution for Randomized Load Balancing Models with Markovian Arrival Processes and PH Service Times

  2010influential citation
• Tight Bounds for Parallel Randomized Load Balancing (TIK Report Number 324)

  2010cites this paper
• Doubly Exponential Solution for Randomized Load Balancing Models with General Service Times

  2010cites this paper
• A Matrix-Analytic Solution for Randomized Load Balancing Models with PH Service Times

  2010cites this paper
• Load Balancing in Peer-to-Peer Systems

  2010cites this paper
• Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks

  2008cites this paper
• Random choices for churn resilient load balancing in peer-to-peer networks

  2008cites this paper
• Resource Allocation Strategies in a 2-Level Hierarchical Grid System

  2008cites this paper
• Competitive Evaluation of

  2007cites this paper
• Performance Evaluation of A Load Self-Balancing Method for Heterogeneous Metadata Server Cluster Using Trace-Driven and Synthetic Workload Simulation

  2007cites this paper
• Competitive evaluation of switch architectures

  2007cites this paper
• Competitive Evaluation of

  2007cites this paper
• Locality-Aware and Churn-Resilient Load-Balancing Algorithms in Structured Peer-to-Peer Networks

  2007cites this paper
• Game theory based job allocation/load balancing in distributed systems with applications to grid computing

  2007cites this paper
• Performance Evaluation of A Load Self-Balancing Method for Heterogeneous Metadata Server Cluster Using Trace-Driven and Synthetic Workload Simulation

  2007cites this paper
• FairTrust: Toward secure and high performance P2P networks

  2007cites this paper
• Rate of relaxation for a mean-field zero-range process

  2007cites this paper
• Load Management and File System in Heterogeneous Environment

  2007cites this paper
• Replicating Nondeterministic Services on Grid Environments

  2006influential citation
• Predicting performance and scaling behaviour in a data center with multiple application servers

  2006cites this paper
• Changing Challenges for Collaborative Algorithmics

  2006cites this paper
• Modelling Parallel Service Systems in GPSS

  2006cites this paper
• Probabilistic Techniques in the Analysis of Dynamic Processes

  2006cites this paper
• DYNAMIC LOAD BALANCING FOR ACTIVE OBJECTS ON COMPUTER GRIDS

  2006cites this paper
• Elastic Routing Table with Provable Performance for Congestion Control in DHT Networks

  2006cites this paper
• Randomization does not reduce the average delay in parallel packet switches

  2005cites this paper
• Practical performance model for optimizing dynamic load balancing of adaptive applications

  2005cites this paper
• Tunable randomization for load management in shared-disk clusters

  2005cites this paper
• Locality-aware randomized load balancing algorithms for DHT networks

  2005influential citation
• Dual and multiple token based approaches for load balancing

  2005cites this paper
• Load Balancing in Parallel and Distributed Databases

  2005cites this paper
• Network Design and Management with Strategic Agents

  2005cites this paper
• Performance modeling and system management for multi-component online services

  2005cites this paper
• Transfer theorems and asymptotic distributional results for m-ary search trees

  2005cites this paper
• Improving the Reliability of Internet Paths with One-hop Source Routing

  2004cites this paper
• Achieving performance consistency in heterogeneous clusters

  2004cites this paper
• Dynamic resource location in peer-to-peer networks

  2004cites this paper
• Runtime support for load balancing of parallel adaptive and irregular applications

  2004cites this paper
• Optimizing data aggregation for cluster-based internet services

  2003cites this paper
• Clustering Support and Replication Management for Scalable Network Services

  2003cites this paper
• Handling Heterogeneity in Shared-Disk File Systems

  2003cites this paper
• Stability of load balancing algorithms in dynamic adversarial systems

  2002cites this paper
• Randomised dynamic load balancing

  2002cites this paper
• Clustering, resource management, and replication support for scalable network services

  2002influential citation
• Steady state analysis of balanced‐allocation routing

  2002cites this paper
• An improved algorithm of two choices in randomized dynamic load-balancing

  2002cites this paper
• Cluster load balancing for fine-grain network services

  2002cites this paper
• The power of two random choices: a survey of tech-niques and results

  2001cites this paper
• Functionally homogeneous clustering: a framework for building scalable data-intensive internet services

  2001cites this paper
• The natural work-stealing algorithm is stable

  2001cites this paper
• The Power of Two Choices in Randomized Load Balancing

  2001influential citation
• Energy efficient battery management

  2000cites this paper
• How Useful Is Old Information?

  2000influential citation
• Infinite parallel job allocation (extended abstract)

  2000cites this paper
• Simplified Witness Tree Arguments

  2000cites this paper