Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
198
Pseudo-naive Evaluation
- PROCEEDINGS OF THE TENTH AUSTRALASIAN DATABASE CONFERENCE, AUCKLAND, NEW ZEALAND, JANUARY 18–21 1999
, 1999
"... We introduce pseudo-naive evaluation, a method for execution of mixed top-down/bottom-up logic programs and deductive databases. The method is intermediate in power between naive evaluation and semi-naive evaluation. Pseudo-naive evaluation adds a data-driven component to naive evaluation without ex ..."
Abstract
-
Cited by 43 (8 self)
- Add to MetaCart
We introduce pseudo-naive evaluation, a method for execution of mixed top-down/bottom-up logic programs and deductive databases. The method is intermediate in power between naive evaluation and semi-naive evaluation. Pseudo-naive evaluation adds a data-driven component to naive evaluation without
Computer Science at Kent Naïve tools for studying compilation histories
, 2003
"... We are interested in assessing the impact of pedagogic programming environments in the teaching of programming to novices. As part of this work, we are interested in studying student compilation histories—a sequence of snapshots of a student’s program taken each time they compile. Much like a sequen ..."
Abstract
- Add to MetaCart
We are interested in assessing the impact of pedagogic programming environments in the teaching of programming to novices. As part of this work, we are interested in studying student compilation histories—a sequence of snapshots of a student’s program taken each time they compile. Much like a
Constructive and destructive use of compilers in elliptic curve cryptography
- J. Cryptology
"... Although cryptographic software implementation is often performed by expert programmers, the range of performance and security driven options, as well as more mundane software engineering issues, still make it a challenge. The use of domain specific language and compiler techniques to assist in desc ..."
Abstract
-
Cited by 6 (1 self)
- Add to MetaCart
in a manner close to the original mathematics; the corresponding compiler allows automatic production of an executable whose performance is competitive with that of a handoptimised implementation. In contrast, we study the worrying potential for naïve compiler driven optimisation to render
A GPGPU Compiler for Memory Optimization and Parallelism Management
- In Proceedings of PLDI
, 2010
"... This paper presents a novel optimizing compiler for general purpose computation on graphics processing units (GPGPU). It addresses two major challenges of developing high performance GPGPU programs: effective utilization of GPU memory hierarchy and judicious management of parallelism. The input to o ..."
Abstract
-
Cited by 53 (4 self)
- Add to MetaCart
to our compiler is a naïve GPU kernel function, which is functionally correct but without any consideration for performance optimization. The compiler analyzes the code, identifies its memory access patterns, and generates both the optimized kernel and the kernel invocation parameters. Our optimization
The Naive Execution of Affine Recurrence Equations
- INTERNATIONAL CONFERENCE ON APPLICATION--SPECIFIC ARRAY PROCESSORS
, 1995
"... In recognition of the fundamental relation between regular arrays and systems of affine recurrence equations, the Alpha language was developed as the basis of a computer aided design methodology for regular array architectures. Alpha is used to initially specify algorithms at a very high algorith ..."
Abstract
-
Cited by 7 (4 self)
- Add to MetaCart
. In this paper, we address the problem of validating an initial specification. We demonstrate a translation methodolody which compiles Alpha into the imperative sequential language C. The C-code may then be compiled and executed to test the specification. We show how an Alpha program can be naively
Compiling C for the EARTH Multithreaded Architecture
- INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING
, 1996
"... Multithreaded architectures provide an opportunity for efficiently executing programs with irregular parallelism and/or irregular locality. This paper presents a strategy that makes use of the multithreaded execution model without exposing multithreading to the programmer. Our approach is to desi ..."
Abstract
-
Cited by 31 (19 self)
- Add to MetaCart
variables and atomic operations. Based on EARTH-C, we describe compiler techniques that are used for translating to lower-level Threaded-C programs for the EARTH multithreaded architecture. We demonstrate our approach with six benchmark programs. We show that even naive EARTH-C programs can lead
Optimizing Pattern Matching Compilation
"... Abstract: Motivated by the promotion of rewriting techniques and their use in major industrial applications, we have designed Tom: a pattern matching layer on top of conventional programming languages. The main originality is to support pat-tern matching against native data-structures like objects o ..."
Abstract
- Add to MetaCart
-known many-to-one automaton-based techniques cannot be used. We present a two-stages approach which first compiles pattern matching constructs in a naive way, and then optimize the resulting code by program transformation us-ing rewriting. As a benefit, the compilation algorithm is simpler, easier to extend
Efficient Model Generation through Compilation
- PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON AUTOMATED DEDUCTION, NUMBER 1104 IN LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
, 1997
"... We present a collection of simple but powerful techniques for enhancing the efficiency of tableau-based model generators such as Satchmo. The central ideas are to compile a clausal first order theory into a procedural Prolog program and to avoid redundant work of a naive implementation. We have comp ..."
Abstract
-
Cited by 14 (4 self)
- Add to MetaCart
We present a collection of simple but powerful techniques for enhancing the efficiency of tableau-based model generators such as Satchmo. The central ideas are to compile a clausal first order theory into a procedural Prolog program and to avoid redundant work of a naive implementation. We have
AAtomicity Refinement for Verified Compilation
"... We consider the verified compilation of high-level managed languages like Java or C # whose intermediate representations provide support for shared-memory synchronization and automatic memory management. Our development is framed in the context of the Total Store Order relaxed memory model. Ensuring ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
We consider the verified compilation of high-level managed languages like Java or C # whose intermediate representations provide support for shared-memory synchronization and automatic memory management. Our development is framed in the context of the Total Store Order relaxed memory model
Halide: A language and compiler . . .
, 2013
"... Image processing pipelines combine the challenges of stencil computations and stream programs. They are composed of large graphs of different stencil stages, as well as complex reductions, and stages with global or data-dependent access patterns. Because of their complex structure, the performance d ..."
Abstract
- Add to MetaCart
difference between a naive implementation of a pipeline and an optimized one is often an order of magnitude. Efficient implementations require optimization of both parallelism and locality, but due to the nature of stencils, there is a fundamental tension between parallelism, locality, and introducing
Results 1 - 10
of
198
