540 search results - page 57 / 108 » Scheduling dynamic parallelism on accelerators |
143
Voted
PDP
2002
IEEE
2002
IEEE
A Fault-Tolerant Reservation-Based Strategy for Scheduling Aperiodic Tasks in Multiprocessor Systems
15 years 9 months ago
Periodic and aperiodic tasks co-exist in many realtime systems. The periodic tasks typically arise from sensor data or control loops, while the aperiodic tasks generally arise fro...
171
click to vote
PDP
2010
IEEE
15 years 8 months ago
2010
IEEE
Scheduling large amounts of tasks in distributed computing platforms composed of millions of nodes is a challenging goal, even more in a fully decentralized way and with low overhe...
158
click to vote
HPDC
1998
IEEE
15 years 8 months ago
1998
IEEE
In this paper we present a model for dynamically scheduling HTTP requests across clusters of servers, optimizing the use of client resources as well as the scattered server nodes....
159
click to vote
HPCA
2000
IEEE
15 years 8 months ago
2000
IEEE
We consider a variety of dynamic, hardware-based methods for exploiting load/store parallelism, including mechanisms that use memory dependence speculation. While previous work ha...
123
click to vote
HPCA
2004
IEEE
16 years 4 months ago
2004
IEEE
For highest performance, a modern microprocessor must be able to determine if an instruction is ready in the same cycle in which it is to be selected for execution. This creates a...