Sciweavers

151 search results - page 1 / 31
» Reinventing Scheduling for Multicore Systems
Sort
View
HOTOS
2009
IEEE
14 years 2 months ago
Reinventing Scheduling for Multicore Systems
High performance on multicore processors requires that schedulers be reinvented. Traditional schedulers focus on keeping execution units busy by assigning each core a thread to ru...
Silas Boyd-Wickizer, Robert Morris, M. Frans Kaash...
CACM
2011
84views more  CACM 2011»
13 years 5 months ago
Using simple abstraction to reinvent computing for parallelism
ple abstraction encapsulating the desired interface between programmers and system builders. Using Simple ion to Reinvent Computing for Parallelism doi:10.1145/1866739.1866757 abst...
Uzi Vishkin

Publication
165views
12 years 4 months ago
Task scheduling algorithm for multicore processor system for minimizing recovery time in case of single node fault
In this paper, we propose a task scheduling algorithm for a multicore processor system which reduces the recovery time in case of a single fail-stop failure of a multicore processo...
Shohei Gotoda, Naoki Shibata and Minoru Ito

Presentation
324views
12 years 4 months ago
Task scheduling algorithm for multicore processor system for minimizing recovery time in case of single node fault
In this paper, we propose a task scheduling al-gorithm for a multicore processor system which reduces the recovery time in case of a single fail-stop failure of a multicore process...
TOCS
2010
130views more  TOCS 2010»
13 years 5 months ago
Contention-Aware Scheduling on Multicore Systems
Sergey Blagodurov, Sergey Zhuravlev, Alexandra Fed...