Sciweavers

2110 search results - page 354 / 422
» What is the complexity of a distributed computing system
Sort
View
PPOPP
2009
ACM
16 years 4 months ago
Detecting and tolerating asymmetric races
Because data races represent a hard-to-manage class of errors in concurrent programs, numerous approaches to detect them have been proposed and evaluated. We specifically consider...
Paruj Ratanaworabhan, Martin Burtscher, Darko Kiro...
ISCA
2011
IEEE
269views Hardware» more  ISCA 2011»
14 years 7 months ago
Power management of online data-intensive services
Much of the success of the Internet services model can be attributed to the popularity of a class of workloads that we call Online Data-Intensive (OLDI) services. These workloads ...
David Meisner, Christopher M. Sadler, Luiz Andr&ea...
ATAL
2010
Springer
15 years 5 months ago
Honor among thieves: collusion in multi-unit auctions
We consider collusion in multi-unit auctions where the allocation and payments are determined using the VCG mechanism. We show how collusion can increase the utility of the collud...
Yoram Bachrach
TOG
2012
222views Communications» more  TOG 2012»
13 years 6 months ago
Plastic trees: interactive self-adapting botanical tree models
We present a dynamic tree modeling and representation technique that allows complex tree models to interact with their environment. Our method uses changes in the light distributi...
Sören Pirk, Ondrej Stava, Julian Kratt, Miche...
PPOPP
2006
ACM
15 years 10 months ago
Fast and transparent recovery for continuous availability of cluster-based servers
Recently there has been renewed interest in building reliable servers that support continuous application operation. Besides maintaining system state consistent after a failure, o...
Rosalia Christodoulopoulou, Kaloian Manassiev, Ang...