Consider an on-line scheduling problem in which a set of abstract processes are competing for the use of a number of resources. Further assume that it is either prohibitively expensive or impossible for any two of the processes to directly communicate with one another. If several processes simultaneously attempt to allocate a particular resource (as may be expected to occur, since the processes cannot easily coordinate their allocations), then none succeed. In such a framework, it is a challenge to design efficient contention resolution protocols. Two recently-proposed approaches to the problem of PRAM emulation give rise to scheduling problems of the above kind. In one approach, the resources (in this case, the shared memory cells) are duplicated and distributed randomly. We analyze a simple and efficient deterministic algorithm for accessing some subset of the duplicated resources. In the other approach, we analyze how quickly we can access the given (nonduplicated) resource using a simple randomized strategy. We obtain precise bounds on the performance of both strategies. We anticipate that our results
|
1289
|
The Probabilistic Method
– Alon, Spencer, et al.
- 1992
|
|
715
|
Probability inequalities for sums of bounded random variables
– Hoeffding
- 1963
|
|
470
|
Universal classes of hash functions
– Carter, Wegman
- 1979
|
|
427
|
A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
– Chernoff
- 1995
|
|
300
|
Ethernet: Distributed packet switching for local computer networks
– Metcalfe, Boggs
- 1976
|
|
220
|
Genaral purpose parallel architectures
– Valiant
- 1990
|
|
86
|
bounds by probabilistic arguments
– Lower
- 1980
|
|
82
|
auf der Heide. Efficient PRAM simulation on a distributed memory machine
– Karp, Luby, et al.
- 1992
|
|
68
|
A lower bound for radio broadcast
– Alon, Bar-Noy, et al.
- 1991
|
|
68
|
How to Share Memory in a Distributed System
– Upfal, Wigderson
- 1987
|
|
65
|
Optical Communication for Pointer Based Algorithms
– Anderson, Miller
- 1988
|
|
47
|
Doubly Logarithmic Communication Algorithms for Optical Communication Parallel Computers, To appear in this journal. (A preliminary version appeared
– Goldberg, Jerrum, et al.
- 1993
|
|
42
|
An Optical Simulation of Shared Memory
– Goldberg, Matias, et al.
- 1994
|
|
42
|
On universal classes of fast high performance hash functions, their time-space tradeo , and their applications
– Siegel
- 1989
|
|
41
|
E cient Optical Communication in Parallel Computers
– Gereb-Graus, Tsantilas
- 1992
|
|
38
|
auf der Heide. Simple, efficient shared memory simulations
– Dietzfelbinger, Meyer
- 1993
|
|
35
|
Randomized routing on fat-trees
– Greenberg, Leiserson
- 1989
|
|
31
|
The tail of the hypergeometric distribution
– Chvátal
- 1979
|
|
30
|
Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
– Greenberg, Flajolet, et al.
- 1987
|
|
22
|
Randomized Routing on Fat-trees
– Greenberg, Leiserson
- 1989
|
|
20
|
The ALOHA system
– Abramson
- 1973
|
|
16
|
Transversal numbers of uniform hypergraphs
– Alon
- 1990
|
|
16
|
A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
– Greenberg, Winograd
- 1985
|
|
12
|
Efficient PRAM simulation on a distributed memory machine
– Karp, Luby, et al.
- 1992
|
|
12
|
An asymptotically nonadaptive algorithm for conflict resolution in mutliple-access channels
– Komlos, Greenberg
- 1985
|
|
7
|
Simple, efficient shared memory simulations
– Dietzfelbinger, Heide, et al.
- 1993
|
|
4
|
Efficient optical communication in parallel computers
– eb-Graus, M, et al.
- 1992
|
|
4
|
A sub-logarithmic communication algorithm for the completely connected optical communication parallel computer
– Goldberg, Jerrum
- 1992
|
|
4
|
The complexity of selection resolution, conflict resolution, and maximum finding on multiple access channels
– Martel, Vayda
- 1988
|
|
4
|
Fast simple dictionaries and shared memory simulation on distributed memory machines; upper and lower bounds
– Heide, Scheideler, et al.
- 1994
|
|
3
|
An asymptotically optimal nonadaptive algorithm for conflict resolution in multiple-access channels
– Koml'os, Greenberg
- 1985
|
|
1
|
The tail of the hypergeometric distribution
– atal, V
- 1979
|
|
1
|
An asymptotically optimal nonadaptive algorithm for conflict resolution in multiple-access channels
– os, J, et al.
- 1985
|
|
1
|
simple dictionaries and shared memory simulations on distributed memory machines; upper and lower bounds
– Fast
- 1994
|
|
1
|
22] F. Meyer auf der
– Heide, Stemann
- 1976
|
|
