108 search results - page 16 / 22 » A Lower Bound for Dynamic Scheduling of Data Parallel Progra... |
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—This paper presents a new receiver-initiated sensor network MAC protocol, called CyMAC, which has the following unique features. It reduces the idle listening time of sensor nod...
IJPP
2010
13 years 4 months ago
2010
Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-uniform ar...
HPDC
2011
IEEE
12 years 11 months ago
2011
IEEE
We investigate proactive dynamic load balancing on multicore systems, in which threads are continually migrated to reduce the impact of processor/thread mismatches to enhance the ...
HICSS
1995
IEEE
13 years 11 months ago
1995
IEEE
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
TII
2010
13 years 2 months ago
2010
Abstract--Real-time systems are subject to temporal constraints and require a schedulability analysis to ensure that task execution finishes within lower and upper specified bounds...