Sciweavers

279 search results - page 38 / 56
» Low Overhead Parallel Schedules for Task Graphs
Sort
View
EUROPAR
2010
Springer
13 years 8 months ago
Optimized On-Chip-Pipelined Mergesort on the Cell/B.E
Abstract. Limited bandwidth to off-chip main memory is a performance bottleneck in chip multiprocessors for streaming computations, such as Cell/B.E., and this will become even mor...
Rikard Hultén, Christoph W. Kessler, Jö...
CGO
2009
IEEE
14 years 2 months ago
Software Pipelined Execution of Stream Programs on GPUs
—The StreamIt programming model has been proposed to exploit parallelism in streaming applications on general purpose multicore architectures. This model allows programmers to sp...
Abhishek Udupa, R. Govindarajan, Matthew J. Thazhu...
GRID
2008
Springer
13 years 8 months ago
Rescheduling co-allocation requests based on flexible advance reservations and processor remapping
Large-scale computing environments, such as TeraGrid, Distributed ASCI Supercomputer (DAS), and Grid’5000, have been using resource co-allocation to execute applications on mult...
Marco Aurélio Stelmar Netto, Rajkumar Buyya
ICPADS
2002
IEEE
14 years 20 days ago
Adaptive Matrix Multiplication in Heterogeneous Environments
In this paper, an adaptive matrix multiplication algorithm for dynamic heterogeneous environments is developed and evaluated. Unlike the state-of-the-art approaches, where load ba...
Bo Hong, Viktor K. Prasanna
SBACPAD
2005
IEEE
177views Hardware» more  SBACPAD 2005»
14 years 1 months ago
Automatic Data-Flow Graph Generation of MPI Programs
The Data-Flow Graph (DFG) of a parallel application is frequently used to take scheduling decisions, based on the information that it models (dependencies among the tasks and volu...
Rafael Ennes Silva, Guilherme P. Pezzi, Nicolas Ma...