193 search results - page 11 / 39 » Key Derivation for Squared-Friendly Applications: Lower Boun... |
FGCN
2007
IEEE
15 years 4 months ago
2007
IEEE
In many applications of sensor networks, it is essential to ensure that messages are transmitted to their destinations as early as possible and the buffer size of each sensor node...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
The earliest-deadline-first (EDF) scheduling of a sporadic real-time task system on a multiprocessor may require that the total utilization of the task system, Usum, not exceed (...
103
click to vote
IOPADS
1997
14 years 11 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
ICLP
2007
Springer
15 years 1 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
JPDC
2006
14 years 9 months ago
2006
Several schemes for checkpointing and rollback recovery have been reported in the literature. In this paper, we analyze some of these schemes under a stochastic model. We have der...