Studying Balanced Allocations with Differential Equations

No abstract is available for this paper.

• Publication year

  1999

• Venue

  Combinatorics, probability & computing

• Publication date

  1999-09-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1017/S0963548399003946
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The Probabilistic Method

  2015cited by this paper
• The Power of Two Choices in Randomized Load Balancing

  2001cited by this paper
• Balanced Allocations

  1999cited by this paper
• The Probabilistic Method

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

  1997cited by this paper
• Practical loss-resilient codes

  1997cited by this paper
• The analysis of a list-coloring algorithm on a random graph

  1997cited by this paper
• Randomized allocation processes

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

  1996cited by this paper
• Large Deviations for Performance Analysis: Queues, Communications, and Computing , Adam Shwartz and Alan Weiss (New York: Chapman and Hall, 1995).

  1996cited by this paper
• Parallel balanced allocations

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

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

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

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

  1992cited 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

  1988influential reference
• Approximation of Population Processes

  1987influential reference
• Adaptive load sharing in homogeneous distributed systems

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

  1981cited by this paper
• Expected Length of the Longest Probe Sequence in Hash Code Searching

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

  1970cited by this paper
• WEIGHTED SUMS OF CERTAIN DEPENDENT RANDOM VARIABLES

  1967cited by this paper
• A and V

  1962cited by this paper

• History-Independent Load Balancing

  2026cites this paper
• Two-way Linear Probing Revisited

  2023cites this paper
• (Optimal) Online Bipartite Matching with Predicted Degrees

  2022cites this paper
• Balanced Allocations: The Heavily Loaded Case with Deletions

  2022cites this paper
• Online Bipartite Matching with Predicted Degrees

  2021cites this paper
• (Optimal) Online Bipartite Matching with Degree Information

  2021cites this paper
• Function Secret Sharing for PSI-CA: With Applications to Private Contact Tracing

  2020cites this paper
• The Supermarket Model with Known and Predicted Service Times

  2019cites this paper
• Probability and Computing

  2018cites this paper
• Arithmetic Progression Hypergraphs: Examining the Second Moment Method

  2017cites this paper
• BFAST: High-Speed and Memory-Efficient Approach for NDN Forwarding Engine

  2017cites this paper
• Greedy Online Matching on Random Graphs ∗

  2016cites this paper
• Power of d Choices for Large-Scale Bin Packing

  2015cites this paper
• Area-Efficient Near-Associative Memories on FPGAs

  2015cites this paper
• Analysis of approximation and uncertainty in optimization

  2015cites this paper
• Some Practical Randomized Algorithms and Data Structures

  2014cites this paper
• Unbalanced Allocations

  2013cites this paper
• Area-efficient near-associative memories on FPGAs

  2013influential citation
• Greedy Online Bipartite Matching on Random Graphs

  2013cites this paper
• Pursuing the Giant in Random Graph Processes

  2013cites this paper
• Markov chains with discontinuous drifts have differential inclusion limits

  2012cites this paper
• Resource Allocation for Wireless Distributed Computing Networks

  2012cites this paper
• Markov chains with discontinuous drifts have differential inclusions limits

  2012cites this paper
• Mean field analysis for inhomogeneous bike sharing systems

  2012cites this paper
• Markov chains with discontinuous drifts have differential inclusions limits. Application to stochastic stability and mean field approximation.

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

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

  2011cites this paper
• A Matrix-Analytic Solution for Randomized Load Balancing Models with Phase-Type Service Times

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

  2010cites this paper
• Randomized load balancing with general service time distributions

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

  2010cites this paper
• Two-way chaining for non-uniform distributions

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

  2010cites this paper
• FPGA-based architectures for next generation communications networks

  2008cites this paper
• On the Resilience-Complexity Tradeoff of Network Coding in Dynamic P2P Networks

  2007cites this paper
• Differential equation approximations for Markov chains

  2007cites this paper
• On the Resilience-Complexity Tradeoff of Network Coding in Dynamic P 2 P Networks

  2007cites this paper
• Load-Balancing Performance of Consistent Hashing: Asymptotic Analysis of Random Node Join

  2007cites this paper
• Enhancing the effective utilisation of grid clusters by exploiting on-line performability analysis

  2005cites this paper
• On the power of two choices: Balls and bins in continuous time

  2005cites this paper
• Enhancing theeffective utilisation ofGrid clusters byexploiting on-line performability analysis

  2005cites this paper
• On Worst-Case Robin Hood Hashing

  2004cites this paper
• On zone-balancing of peer-to-peer networks: analysis of random node join

  2004cites this paper
• On Zone-Balancing of Structured Peer-to-Peer Networks : Analysis of Random Node Join

  2004influential citation
• Two-way hashing with separate chaining and linear probing

  2004cites this paper
• Cuckoo hashing: Further analysis

  2003cites this paper
• A Quantitative Law of Large Numbers via Exponential Martingales

  2003cites this paper
• The Point Of Point Crossover: Shuffling To Randomness

  2002cites this paper
• Almost all graphs with average degree 4 are 3-colorable

  2002influential citation
• Partnering Strategies For Fitness Evaluation In A Pyramidal Evolutionary Algorithm

  2002cites this paper
• Almost All Graphs of Degree 4 are 3-colorable

  2001cites this paper
• Using multiple hash functions to improve IP lookups

  2001cites this paper
• Balanced allocations: the heavily loaded case

  2000cites this paper
• The Asymptotics of Selecting the Shortest of Two, Improved

  1999cites this paper
• Recovery Time of Dynamic Allocation Processes

  1998cites this paper
• On Balls and Bins with Deletions

  1998cites this paper
• Randomized allocation processes

  1997cites this paper