Sciweavers

141 search results - page 11 / 29
» Core Algorithms of the Maui Scheduler
Sort
View
ASPLOS
2010
ACM
14 years 2 months ago
Flexible architectural support for fine-grain scheduling
To make efficient use of CMPs with tens to hundreds of cores, it is often necessary to exploit fine-grain parallelism. However, managing tasks of a few thousand instructions is ...
Daniel Sanchez, Richard M. Yoo, Christos Kozyrakis
ECCC
2000
140views more  ECCC 2000»
13 years 7 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis
DAC
2009
ACM
14 years 9 months ago
Efficient program scheduling for heterogeneous multi-core processors
Heterogeneous multicore processors promise high execution efficiency under diverse workloads, and program scheduling is critical in exploiting this efficiency. This paper present...
Jian Chen, Lizy Kurian John
IWMM
2011
Springer
270views Hardware» more  IWMM 2011»
12 years 11 months ago
Memory management in NUMA multicore systems: trapped between cache contention and interconnect overhead
Multiprocessors based on processors with multiple cores usually include a non-uniform memory architecture (NUMA); even current 2-processor systems with 8 cores exhibit non-uniform...
Zoltan Majo, Thomas R. Gross
ICCD
2008
IEEE
160views Hardware» more  ICCD 2008»
14 years 4 months ago
Fast arbiters for on-chip network switches
— The need for efficient implementation of simple crossbar schedulers has increased in the recent years due to the advent of on-chip interconnection networks that require low la...
Giorgos Dimitrakopoulos, Nikos Chrysos, Costas Gal...