77 search results - page 6 / 16 » Keeping Bits Safe: How Hard Can It Be |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--A delay-constrained scheduling problem for pointto-point communication is considered: a packet of B bits must be transmitted by a hard deadline of T slots over a timevary...
DEBU
2010
13 years 5 months ago
2010
Solid-state disks are currently based on NAND flash and expose a standard disk interface. To accommodate limitations of the medium, solid-state disk implementations avoid rewritin...
CADE
2008
Springer
14 years 8 months ago
2008
Springer
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
EMSOFT
2006
Springer
13 years 11 months ago
2006
Springer
We present a deadlock avoidance algorithm for distributed systems that guarantees liveness. Deadlock avoidance in distributed systems is a hard problem and general solutions are c...
VEE
2012
ACM
12 years 3 months ago
2012
ACM
Time Of Check To Time Of Use (TOCTTOU) race conditions for file accesses in user-space applications are a common problem in Unix-like systems. The mapping between filename and i...