2924 search results - page 98 / 585 » Lower Bounds in Distributed Computing |
SPAA
1990
ACM
15 years 7 months ago
1990
ACM
d Abstract) Richard J. Anderson Paul Beame Walter L. Ruzzo Department of Computer Science and Engineering University of Washingtoni We introduce a task scheduling model which is u...
124
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
This work presents a scalability analysis of embarrassingly parallel applications running on cluster and multi-cluster machines. Several applications can be included in this catego...
139
Voted
FOCS
1990
IEEE
15 years 7 months ago
1990
IEEE
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
147
click to vote
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...