Sciweavers

1024 search results - page 4 / 205
» Complexity and Performance in Parallel Programming Languages
Sort
View
PAAPP
2002
101views more  PAAPP 2002»
13 years 8 months ago
Static performance prediction of skeletal parallel programs
We demonstrate that the run time of implicitly parallel programs can be statically predicted with considerable accuracy when expressed within the constraints of a skeletal, shapel...
Yasushi Hayashi, Murray Cole
ICS
1998
Tsinghua U.
14 years 24 days ago
High-level Management of Communication Schedules in HPF-like Languages
The goal of High Performance Fortran (HPF) is to "address the problems of writing data parallel programs where the distribution of data affects performance", providing t...
Siegfried Benkner, Piyush Mehrotra, John Van Rosen...
PLDI
2012
ACM
11 years 11 months ago
Scalable and precise dynamic datarace detection for structured parallelism
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel thre...
Raghavan Raman, Jisheng Zhao, Vivek Sarkar, Martin...
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
14 years 3 months ago
Characterizing the genetic programming environment for fifth (GPE5) on a high performance computing cluster
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
Kenneth Holladay
CPE
1994
Springer
170views Hardware» more  CPE 1994»
14 years 20 days ago
Automatic Scalability Analysis of Parallel Programs Based on Modeling Techniques
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...