3202 search results - page 285 / 641 » Memory access scheduling |
191
click to vote
SIGMETRICS
2008
ACM
15 years 6 months ago
2008
ACM
We consider a wireless collision channel, shared by a finite number of mobile users who transmit to a common base station using a random access protocol. Mobiles are selfoptimizin...
187
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
— The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this pape...
312
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
Speed improvements in today's processors have largely been delivered in the form of multiple cores, increasing the importance of ions that ease parallel programming. Software...
160
click to vote
IPPS
2006
IEEE
16 years 19 days ago
2006
IEEE
The load/store queue (LSQ) is one of the most complex parts of contemporary processors. Its latency is critical for the processor performance and it is usually one of the processo...
182
click to vote
RTAS
2008
IEEE
16 years 1 months ago
2008
IEEE
Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a schedu...