500 search results - page 18 / 100 » Compiling SA-C Programs to FPGAs: Performance Results |
116
click to vote
PACT
1997
Springer
15 years 3 months ago
1997
Springer
A technique for estimating the cost of executing a loop nest in parallel (parallel start-up overhead) is described in this paper. This technique is of utmost importance for paralle...
108
click to vote
PPOPP
1999
ACM
15 years 4 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
112
click to vote
CASES
2008
ACM
15 years 1 months ago
2008
ACM
Java applications rely on Just-In-Time (JIT) compilers or adaptive compilers to generate and optimize binary code at runtime to boost performance. In conventional Java Virtual Mac...
110
Voted
IPPS
1999
IEEE
15 years 4 months ago
1999
IEEE
Parallelizing compiler technology has improved in recent years. One area in which compilers have made progress is in handling DOACROSS loops, where crossprocessor data dependencie...
100
click to vote
CGO
2003
IEEE
15 years 3 months ago
2003
IEEE
In this paper, we describe a novel execution environment for Java programs that substantially improves execution performance by incorporating both on-line and off-line profile inf...