Sciweavers

59 search results - page 6 / 12
» Evolution-Based Scheduling of Fault-Tolerant Programs on Mul...
Sort
View
EUROPAR
1998
Springer
13 years 11 months ago
A Lower Bound for Dynamic Scheduling of Data Parallel Programs
Instruction Balanced Time Slicing IBTS allows multiple parallel jobs to be scheduled in a manner akin to the well-known gang scheduling scheme in parallel computers. IBTS however a...
Fabrício Alves Barbosa da Silva, Luis Migue...
ICASSP
2008
IEEE
14 years 1 months ago
Address assignment sensitive variable partitioning and scheduling for DSPS with multiple memory banks
Multiple memory banks design is employed in many high performance DSP processors. This architectural feature supports higher memory bandwidth by allowing multiple data memory acce...
Chun Jason Xue, Tiantian Liu, Zili Shao, Jingtong ...
ICFP
2008
ACM
14 years 7 months ago
A scheduling framework for general-purpose parallel languages
The trend in microprocessor design toward multicore and manycore processors means that future performance gains in software will largely come from harnessing parallelism. To reali...
Matthew Fluet, Mike Rainey, John H. Reppy
ASPLOS
2004
ACM
14 years 24 days ago
Continual flow pipelines
Increased integration in the form of multiple processor cores on a single die, relatively constant die sizes, shrinking power envelopes, and emerging applications create a new cha...
Srikanth T. Srinivasan, Ravi Rajwar, Haitham Akkar...
IWOMP
2010
Springer
13 years 9 months ago
How OpenMP Applications Get More Benefit from Many-Core Era
With the approaching of the many-core era, it becomes more and more difficult for a single OpenMP application to efficiently utilize all the available processor cores. On the other...
Jianian Yan, Jiangzhou He, Wentao Han, Wenguang Ch...