Sciweavers

6105 search results - page 64 / 1221
» A Parallel Algorithm for Bound-Smoothing
Sort
View
PC
2007
343views Management» more  PC 2007»
14 years 9 months ago
Runtime scheduling of dynamic parallelism on accelerator-based multi-core systems
We explore runtime mechanisms and policies for scheduling dynamic multi-grain parallelism on heterogeneous multi-core processors. Heterogeneous multi-core processors integrate con...
Filip Blagojevic, Dimitrios S. Nikolopoulos, Alexa...
MST
2002
128views more  MST 2002»
14 years 9 months ago
A Simple and Efficient Parallel Disk Mergesort
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
Rakesh D. Barve, Jeffrey Scott Vitter
IPPS
2010
IEEE
14 years 7 months ago
Parallelization of DQMC simulation for strongly correlated electron systems
Abstract--Determinant Quantum Monte Carlo (DQMC) simulation has been widely used to reveal macroscopic properties of strong correlated materials. However, parallelization of the DQ...
Che-Rung Lee, I-Hsin Chung, Zhaojun Bai
POPL
2011
ACM
14 years 18 days ago
Safe nondeterminism in a deterministic-by-default parallel language
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
Robert L. Bocchino Jr., Stephen Heumann, Nima Hona...
IPPS
2005
IEEE
15 years 3 months ago
An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
Guojing Cong, David A. Bader