Sciweavers

359 search results - page 72 / 72
» On Complete Primitives for Fairness
Sort
View
CORR
2011
Springer
142views Education» more  CORR 2011»
12 years 9 months ago
On the Locality of Codeword Symbols
Consider a linear [n, k, d]q code C. We say that that i-th coordinate of C has locality r, if the value at this coordinate can be recovered from accessing some other r coordinates...
Parikshit Gopalan, Cheng Huang, Huseyin Simitci, S...
EUROSYS
2011
ACM
12 years 8 months ago
Is co-scheduling too expensive for SMP VMs?
Symmetric multiprocessing (SMP) virtual machines (VMs) allow users to take advantage of a multiprocessor infrastructure. Despite the advantage, SMP VMs can cause synchronization l...
Orathai Sukwong, Hyong S. Kim
SIGCOMM
2012
ACM
11 years 7 months ago
Finishing flows quickly with preemptive scheduling
Today’s data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from o...
Chi-Yao Hong, Matthew Caesar, Brighten Godfrey
PODC
2009
ACM
14 years 5 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan