Sciweavers

835 search results - page 98 / 167
» On optimal slicing of parallel programs
Sort
View
IWOMP
2009
Springer
14 years 4 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
IPPS
2008
IEEE
14 years 4 months ago
Adaptive tuning in a dynamically changing resource environment
We present preliminary results of a project to create a tuning system that adaptively optimizes programs to the underlying execution platform. We will show initial results from tw...
Seyong Lee, Rudolf Eigenmann
IPPS
2006
IEEE
14 years 4 months ago
Solving generic role assignment exactly
role assignment is a programming abstraction that supports the assignment of user-defined roles to sensor nodes such that certain conditions are met. Many common network configu...
Christian Frank, Kay Römer
IPPS
2005
IEEE
14 years 3 months ago
Automated Analysis of Memory Access Behavior
Abstract— We developed an automated environment to measure the memory access behavior of applications on high performance clusters. Code optimization for processor caches is cruc...
Michael Gerndt, Tianchao Li
EUROGP
2004
Springer
123views Optimization» more  EUROGP 2004»
14 years 3 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