Sciweavers

457 search results - page 69 / 92
» Decay-Usage Scheduling in Multiprocessors
Sort
View
PPOPP
1990
ACM
13 years 11 months ago
Employing Register Channels for the Exploitation of Instruction Level Parallelism
Abstract - A multiprocessor system capable of exploiting fine-grained parallelism must support efficient synchronization and data passing mechanisms. This paper demonstrates the us...
Rajiv Gupta
PPOPP
2003
ACM
14 years 24 days ago
Improving server software support for simultaneous multithreaded processors
Simultaneous multithreading (SMT) represents a fundamental shift in processor capability. SMT's ability to execute multiple threads simultaneously within a single CPU offers ...
Luke McDowell, Susan J. Eggers, Steven D. Gribble
SPAA
2003
ACM
14 years 24 days ago
The load rebalancing problem
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
Gagan Aggarwal, Rajeev Motwani, An Zhu
IWOMP
2009
Springer
14 years 3 days ago
Dynamic Task and Data Placement over NUMA Architectures: An OpenMP Runtime Perspective
Abstract. Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-...
François Broquedis, Nathalie Furmento, Bric...
DATE
2009
IEEE
89views Hardware» more  DATE 2009»
14 years 2 months ago
Robust non-preemptive hard real-time scheduling for clustered multicore platforms
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
Michele Lombardi, Michela Milano, Luca Benini