Sciweavers

567 search results - page 66 / 114
» Program Optimization and Parallelization Using Idioms
Sort
View
161
Voted
CPHYSICS
2006
182views more  CPHYSICS 2006»
15 years 4 months ago
MinFinder: Locating all the local minima of a function
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
Ioannis G. Tsoulos, Isaac E. Lagaris
LCPC
2009
Springer
15 years 8 months ago
MIMD Interpretation on a GPU
Programming heterogeneous parallel computer systems is notoriously difficult, but MIMD models have proven to be portable across multi-core processors, clusters, and massively paral...
Henry G. Dietz, B. Dalton Young
IWOMP
2009
Springer
15 years 10 months ago
Evaluating OpenMP 3.0 Run Time Systems on Unbalanced Task Graphs
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
Stephen Olivier, Jan Prins
EUROGP
2004
Springer
123views Optimization» more  EUROGP 2004»
15 years 9 months ago
Global Distributed Evolution of L-Systems Fractals
Internet based parallel genetic programming (GP) creates fractal patterns like Koch’s snow flake. Pfeiffer, http://www.cs.ucl.ac.uk /staff/W.Langdon/pfeiffer.html, by analogy w...
William B. Langdon
INTENSIVE
2009
IEEE
15 years 10 months ago
Accelerating K-Means on the Graphics Processor via CUDA
In this paper an optimized k-means implementation on the graphics processing unit (GPU) is presented. NVIDIA’s Compute Unified Device Architecture (CUDA), available from the G8...
Mario Zechner, Michael Granitzer