Sciweavers

1294 search results - page 164 / 259
» FFT Compiler Techniques
Sort
View
ICLP
1998
Springer
14 years 2 months ago
Efficient Implementation of a Linear Logic Programming Language
A number of logic programming languages based on Linear Logic [3] have been proposed. However, the implementation techniques proposed for these languages have relied heavily on th...
Joshua S. Hodas, K. M. Watkins, Naoyuki Tamura, Ky...
HPDC
1997
IEEE
14 years 2 months ago
Optimizing Layered Communication Protocols
Layering of protocols o ers several well-known advantages, but typically leads to performance ine ciencies. We present a model for layering, and point out where the performance pr...
Mark Hayden, Robbert van Renesse
LCR
1998
Springer
109views System Software» more  LCR 1998»
14 years 2 months ago
Expressing Irregular Computations in Modern Fortran Dialects
Abstract. Modern dialects of Fortran enjoy wide use and good support on highperformance computers as performance-oriented programming languages. By providing the ability to express...
Jan Prins, Siddhartha Chatterjee, Martin Simons
ICFP
1997
ACM
14 years 2 months ago
Strongly Typed Flow-Directed Representation Transformations
d Abstract) Allyn Dimock Harvard University Robert Muller Boston College Franklyn Turbak Wellesley College J. B. Wells∗ Glasgow University Topic Areas: compilation, lambda calcul...
Allyn Dimock, Robert Muller, Franklyn A. Turbak, J...
ICLP
1993
Springer
14 years 2 months ago
On Copy Avoidance in Single Assignment Languages
: Copy avoidance refers to the safe replacement, at compile time, of copying operations by destructive updates in single-assignment languages. Conceptually, the problem can be divi...
Saumya K. Debray