Sciweavers

3300 search results - page 284 / 660
» Performance Trade-Off in Distributed Simulation
Sort
View
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
15 years 11 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
SPAA
2005
ACM
16 years 7 days ago
Parallelizing time with polynomial circuits
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
Ryan Williams
IMC
2006
ACM
16 years 19 days ago
Measurement based analysis, modeling, and synthesis of the internet delay space
Understanding the characteristics of the Internet delay space (i.e., the all-pairs set of static round-trip propagation delays among edge networks in the Internet) is important fo...
Bo Zhang, T. S. Eugene Ng, Animesh Nandi, Rudolf H...
COREGRID
2007
Springer
16 years 26 days ago
Co-Allocating Compute and Network Resources
Distributed applications or workflows need to access and use compute, storage and network resources simultaneously or chronologically coordinated respectively. Examples are distri...
Thomas Eickermann, Lidia Westphal, Oliver Wäl...
IPPS
2006
IEEE
16 years 21 days ago
Improving cooperation in peer-to-peer systems using social networks
Rational and selfish nodes in P2P systems usually lack effective incentives to cooperate, contributing to the increase of free-riders, and degrading the system performance. Variou...
Wenyu Wang, Li Zhao, Ruixi Yuan