20 search results - page 2 / 4 » Improving Scalability and Complexity of Dynamic Scheduler th... |
PPOPP
2009
ACM
14 years 5 months ago
2009
ACM
Recent advances in polyhedral compilation technology have made it feasible to automatically transform affine sequential loop nests for tiled parallel execution on multi-core proce...
SPAA
2012
ACM
11 years 7 months ago
2012
ACM
GPU-based heterogeneous clusters continue to draw attention from vendors and HPC users due to their high energy efficiency and much improved single-node computational performance...
ICRA
2000
IEEE
13 years 9 months ago
2000
IEEE
Manufacturing enterprise automation was focused on factory level where scheduling is a key issue in the past. As more and more companies are relying on their business parmers or s...
ISCA
2002
IEEE
13 years 10 months ago
2002
IEEE
Increasing the number of instruction queue (IQ) entries in a dynamically scheduled processor exposes more instruction-level parallelism, leading to higher performance. However, in...
HPCA
2006
IEEE
14 years 5 months ago
2006
IEEE
We propose dynamic scheduler designs to improve the scheduler scalability and reduce its complexity in the SMT processors. Our first design is an adaptation of the recently propos...