Sciweavers

223 search results - page 2 / 45
» A Compiler Scheme for Reusing Intermediate Computation Resul...
Sort
View
LISP
2008
104views more  LISP 2008»
13 years 6 months ago
Flattening tuples in an SSA intermediate representation
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
Lukasz Ziarek, Stephen Weeks, Suresh Jagannathan
SC
1993
ACM
13 years 10 months ago
Runtime compilation techniques for data partitioning and communication schedule reuse
In this paper, we describe two new ideas by which HPF compiler can deal with irregular computations e ectively. The rst mechanism invokes a user speci ed mapping procedure via a s...
Ravi Ponnusamy, Joel H. Saltz, Alok N. Choudhary
FAST
2008
13 years 8 months ago
Improving I/O Performance of Applications through Compiler-Directed Code Restructuring
Ever-increasing complexity of large-scale applications and continuous increases in sizes of the data they process make the problem of maximizing performance of such applications a...
Mahmut T. Kandemir, Seung Woo Son, Mustafa Karak&o...
PLILP
1998
Springer
13 years 10 months ago
Compiling Erlang to Scheme
The programming languages Erlang and Scheme have many common features, yet the performance of the current implementations of Erlang appears to be below that of good implementations...
Marc Feeley, Martin Larose
IPPS
1999
IEEE
13 years 10 months ago
A Novel Compilation Framework for Supporting Semi-Regular Distributions in Hybrid Applications
This paper explains how efficient support for semiregular distributions can be incorporated in a uniform compilation framework for hybrid applications. The key focus of this work ...
Dhruva R. Chakrabarti, Prithviraj Banerjee