Sciweavers

1982 search results - page 358 / 397
» New Products
Sort
View
SOSP
2007
ACM
15 years 6 months ago
Tolerating byzantine faults in transaction processing systems using commit barrier scheduling
This paper describes the design, implementation, and evaluation of a replication scheme to handle Byzantine faults in transaction processing database systems. The scheme compares ...
Ben Vandiver, Hari Balakrishnan, Barbara Liskov, S...
SOSP
2009
ACM
15 years 6 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
SOSP
2009
ACM
15 years 6 months ago
PRES: probabilistic replay with execution sketching on multiprocessors
Bug reproduction is critically important for diagnosing a production-run failure. Unfortunately, reproducing a concurrency bug on multi-processors (e.g., multi-core) is challengin...
Soyeon Park, Yuanyuan Zhou, Weiwei Xiong, Zuoning ...
STACS
2010
Springer
15 years 4 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
TEI
2010
ACM
160views Hardware» more  TEI 2010»
15 years 4 months ago
Think globally, build locally: a technological platform for low-cost, open-source, locally-assembled programmable bricks for edu
“Programmable bricks” are microcontroller-based devices that can be used in various educational projects, such as robotic prototypes, environmental sensing, and interactive ar...
Arnan Sipitakiat, Paulo Blikstein