Sciweavers

1792 search results - page 92 / 359
» Improved scheduling in rings
Sort
View
HPCA
2008
IEEE
14 years 10 months ago
Runahead Threads to improve SMT performance
In this paper, we propose Runahead Threads (RaT) as a valuable solution for both reducing resource contention and exploiting memory-level parallelism in Simultaneous Multithreaded...
Tanausú Ramírez, Alex Pajuelo, Olive...
RTAS
2005
IEEE
14 years 3 months ago
Improving WCET by Optimizing Worst-Case Paths
It is advantageous to perform compiler optimizations to lower the WCET of a task since tasks with lower WCETs are easier to schedule and more likely to meet their deadlines. Compi...
Wankang Zhao, William C. Kreahling, David B. Whall...
STACS
2005
Springer
14 years 3 months ago
Improved Algorithms for Dynamic Page Migration
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzen...
EOR
2007
75views more  EOR 2007»
13 years 10 months ago
Improved modeling and solution methods for the multi-resource routing problem
This paper presents modeling and solution method improvements for the Multi-Resource Routing Problem (MRRP) with flexible tasks. The MRRP with flexible tasks is used to model ro...
Peter Francis, Guangming Zhang, Karen R. Smilowitz
RTS
2006
84views more  RTS 2006»
13 years 10 months ago
Improving WCET by applying worst-case path optimizations
It is advantageous to perform compiler optimizations that attempt to lower the worst-case execution time (WCET) of an embedded application since tasks with lower WCETs are easier ...
Wankang Zhao, William C. Kreahling, David B. Whall...