146 search results - page 22 / 30 » Automatic Optimization of Parallel Dataflow Programs |
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
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...
96
Voted
LOPSTR
2004
Springer
15 years 4 months ago
2004
Springer
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...
103
click to vote
CODES
2005
IEEE
15 years 4 months ago
2005
IEEE
Arbitrary memory dependencies and variable latency memory systems are major obstacles to the synthesis of large-scale ASIC systems in high-level synthesis. This paper presents SOM...
ICSE
2003
IEEE-ACM
15 years 11 months ago
2003
IEEE-ACM
We show how the state space exploration tool VeriSoft can be used to analyze parallel C/C++ programs compositionally. VeriSoft is used to check assume/guarantee specifications of ...
IISWC
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract—Dynamic runtimes can simplify parallel programming by automatically managing concurrency and locality without further burdening the programmer. Nevertheless, implementin...