2485 search results - page 112 / 497 » Time Bounded Frequency Computations |
158
click to vote
PODC
2011
ACM
14 years 7 months ago
2011
ACM
We consider the power of objects in the unbounded concurrency shared memory model, where there is an infinite set of processes and the number of processes active concurrently may...
166
click to vote
SPAA
1993
ACM
15 years 9 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
124
click to vote
SPAA
2009
ACM
16 years 5 months ago
2009
ACM
Work stealing is a popular method of scheduling fine-grained parallel tasks. The performance of work stealing has been extensively studied, both theoretically and empirically, but...
118
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
159
Voted
ECRTS
2010
IEEE
15 years 5 months ago
2010
IEEE
The Earliest Deadline First scheduling algorithm (EDF) is known to not be optimal under global scheduling on multiprocessor platforms. Results have been obtained that bound the ma...