Sciweavers

6299 search results - page 28 / 1260
» Data and Computation Abstractions for Dynamic and Irregular ...
Sort
View
TPDS
2008
113views more  TPDS 2008»
13 years 8 months ago
Evaluating a High-Level Parallel Language (GpH) for Computational GRIDs
Computational Grids potentially offer low cost, readily available, and large-scale high-performance platforms. For the parallel execution of programs, however, computational GRIDs ...
Abdallah Al Zain, Philip W. Trinder, Greg Michaels...
ASPLOS
2008
ACM
13 years 10 months ago
Optimistic parallelism benefits from data partitioning
Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism ar...
Milind Kulkarni, Keshav Pingali, Ganesh Ramanaraya...
JSSPP
2005
Springer
14 years 2 months ago
AnthillSched: A Scheduling Strategy for Irregular and Iterative I/O-Intensive Parallel Jobs
Irregular and iterative I/O-intensive jobs need a different approach from parallel job schedulers. The focus in this case is not only the processing requirements anymore: memory, ...
Luís Fabrício Wanderley Góes,...
TSMC
1998
103views more  TSMC 1998»
13 years 8 months ago
Obstacle avoidance in a dynamic environment: a collision cone approach
—A novel collision cone approach is proposed as an aid to collision detection and avoidance between irregularly shaped moving objects with unknown trajectories. It is shown that ...
Animesh Chakravarthy, Debasish Ghose
PPOPP
2010
ACM
14 years 5 months ago
Structure-driven optimizations for amorphous data-parallel programs
Irregular algorithms are organized around pointer-based data structures such as graphs and trees, and they are ubiquitous in applications. Recent work by the Galois project has pr...
Mario Méndez-Lojo, Donald Nguyen, Dimitrios...