3934 search results - page 610 / 787 » Approximate Schedulability Analysis |
258
click to vote
ASIACRYPT
1999
Springer
15 years 10 months ago
1999
Springer
This paper presents a weakness in the key schedule of the AES candidate HPC (Hasty Pudding Cipher). It is shown that for the HPC version with a 128-bit key, 1 in 256 keys is weak i...
153
click to vote
RTSS
1999
IEEE
15 years 10 months ago
1999
IEEE
The e ective design of composite dependable and real-time protocols entails demonstrating their proof of correctness and, in practice, the e cient delivery of services. We focus o...
173
click to vote
SSDBM
1999
IEEE
15 years 10 months ago
1999
IEEE
In many scientific domains, experimental devices or simulation programs generate large volumes of data. The volumes of data may reach hundreds of terabytes and therefore it is imp...
178
click to vote
ICS
1999
Tsinghua U.
15 years 10 months ago
1999
Tsinghua U.
Memory operations remain a significant bottleneck in dynamically scheduled pipelined processors, due in part to the inability to statically determine the existence of memory addr...
322
click to vote
LCN
1998
IEEE
15 years 10 months ago
1998
IEEE
The ATM Guaranteed Frame Rate GFR service is intended for best e ort tra c that can bene t from minimum throughput guarantees. Edge devices connecting LANs to an ATM network can u...