1257 search results - page 149 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
HPCA
2006
IEEE
15 years 10 months ago
2006
IEEE
Allowing loads to issue out-of-order with respect to earlier unresolved store addresses is very important for extracting parallelism in large-window superscalar processors. Blindl...
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been presented in the literature to improve performance and re...
99
Voted
EUROPAR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We consider approaches that allow task migration for scheduling recurrent directed-acyclic-graph (DAG) tasks on symmetric, shared-memory multiprocessors (SMPs) in order t...
ICDCS
2006
IEEE
15 years 4 months ago
2006
IEEE
Earlier work has developed the underpinnings of a theory of scheduling computations having intertask dependencies—modeled via dags—for Internet-based computing. The goal of th...
104
click to vote
PDP
2005
IEEE
15 years 3 months ago
2005
IEEE
Clusters of SMPs are becoming increasingly common. However, the shared memory design of SMPs and the consequential contention between system processors for access to main memory c...