Sciweavers

540 search results - page 50 / 108
» Scheduling dynamic parallelism on accelerators
Sort
View
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
15 years 10 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
IPPS
2003
IEEE
15 years 9 months ago
Dynamic Mapping in a Heterogeneous Environment with Tasks Having Priorities and Multiple Deadlines
In a distributed heterogeneous computing system, the resources have different capabilities and tasks have different requirements. To maximize the performance of the system, it is ...
Jong-Kook Kim, Sameer Shivle, Howard Jay Siegel, A...
EUROPAR
2005
Springer
15 years 10 months ago
Non-uniform Instruction Scheduling
Dynamic instruction scheduling logic is one of the most critical and cycle-limiting structures in modern superscalar processors, and it is not easily pipelined without significant ...
Joseph J. Sharkey, Dmitry V. Ponomarev
IEEEHPCS
2010
15 years 2 months ago
Reducing memory requirements of stream programs by graph transformations
Stream languages explicitly describe fork-join parallelism and pipelines, offering a powerful programming model for many-core Multi-Processor Systems on Chip (MPSoC). In an embedd...
Pablo de Oliveira Castro, Stéphane Louise, ...
DAC
1994
ACM
15 years 8 months ago
Incorporating Speculative Execution in Exact Control-Dependent Scheduling
- This paper describes a symbolic formulation that allows incorporation of speculative operation execution (preexecution) in an exact control-dependent scheduling of arbitrary forw...
Ivan P. Radivojevic, Forrest Brewer