1140 search results - page 63 / 228 » Generating compilers for generated datapaths |
126
click to vote
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
Abstract. The combination of a language with ne-grain implicit parallelism and a data
ow evaluation scheme is suitable for high-level programming on massively parallel architectur...
114
click to vote
ARC
2010
Springer
15 years 10 months ago
2010
Springer
Dot-products are one of the essential and recurrent building blocks in scientific computing, and often take-up a large proportion of the scientific acceleration circuitry. The ac...
111
click to vote
PPDP
1999
Springer
15 years 7 months ago
1999
Springer
For a compiler writer, generating good machine code for a variety of platforms is hard work. One might try to reuse a retargetable code generator, but code generators are complex a...
149
click to vote
CSFW
2009
IEEE
15 years 7 months ago
2009
IEEE
We present the design and implementation of a compiler that, given high-level multiparty session descriptions, generates custom cryptographic protocols. Our sessions specify pre-a...
144
click to vote
PPOPP
1999
ACM
15 years 7 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...