2924 search results - page 98 / 585 » Lower Bounds in Distributed Computing |
80
Voted
SPAA
1990
ACM
15 years 4 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...
98
Voted
IPPS
2010
IEEE
14 years 10 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...
118
Voted
FOCS
1990
IEEE
15 years 4 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 ...
ADHOCNOW
2006
Springer
15 years 6 months ago
2006
Springer
116
Voted
SPAA
2005
ACM
15 years 6 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...