3228 search results - page 31 / 646 » Basics of Compiler Design |
57
Voted
DAC
2000
ACM
15 years 10 months ago
2000
ACM
EMSOFT
2010
Springer
14 years 7 months ago
2010
Springer
We propose the first polynomial-time code selection algorithm for minimising the worst-case execution time of a nonnested loop executed on a fully pipelined processor that uses sc...
PPOPP
1999
ACM
15 years 2 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...
ENTCS
2010
14 years 9 months ago
2010
This paper extends previous work on the compilation of higher-order imperative languages into digital circuits [4]. We introduce concurrency, an essential feature in the context o...
EURODAC
1994
IEEE
15 years 1 months ago
1994
IEEE
Modern CAD systems allow the designers to come up with powerful programmable datapaths in avery short time. The time to develop compilers for this datapaths is much longer. This p...