637 search results - page 52 / 128 » Scalable Linux Scheduling |
MICRO
2005
IEEE
14 years 4 months ago
2005
IEEE
Conventional processors use a fully-associative store queue (SQ) to implement store-load forwarding. Associative search latency does not scale well to capacities and bandwidths re...
RTSS
2009
IEEE
14 years 5 months ago
2009
IEEE
An empirical study of implementation tradeoffs (choice of ready queue implementation, quantum-driven vs. eventdriven scheduling, and interrupt handling strategy) affecting global ...
CORR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract— A power optimal scheduling algorithm that guarantees desired throughput and bounded delay to each user is developed for fading multi-access multi-band channels that can...
MM
2006
ACM
14 years 5 months ago
2006
ACM
The required real-time and high-rate transfers for multimedia data severely limit the number of requests that can be serviced concurrently by Video-on-Demand (VOD) servers. Resour...
MICRO
2003
IEEE
14 years 4 months ago
2003
IEEE
Large instruction window processors achieve high performance by exposing large amounts of instruction level parallelism. However, accessing large hardware structures typically req...