Sciweavers

1884 search results - page 325 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
SIGCOMM
2004
ACM
15 years 7 months ago
Vivaldi: a decentralized network coordinate system
Large-scale Internet applications can benefit from an ability to predict round-trip times to other hosts without having to contact them first. Explicit measurements are often un...
Frank Dabek, Russ Cox, M. Frans Kaashoek, Robert M...
RTCSA
2000
IEEE
15 years 6 months ago
Task attribute assignment of fixed priority scheduled tasks to reenact off-line schedules
A number of industrial applications advocate the use of time-triggered approaches for reasons of predictability, distribution, and particular constraints such as jitter or end-to-...
Radu Dobrin, Yusuf Özdemir, Gerhard Fohler
RTSS
1999
IEEE
15 years 6 months ago
Design and Implementation of Statistical Rate Monotonic Scheduling in KURT Linux
Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] for periodic tasks with highly variable execution times and...
Alia Atlas, Azer Bestavros
CONEXT
2009
ACM
15 years 3 months ago
FairTorrent: bringing fairness to peer-to-peer systems
Peer-to-Peer file-sharing applications suffer from a fundamental problem of unfairness. Free-riders cause slower download times for others by contributing little or no upload band...
Alex Sherman, Jason Nieh, Clifford Stein
TIT
2008
110views more  TIT 2008»
15 years 2 months ago
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
Venkatesan Guruswami, Atri Rudra