Sciweavers

119 search results - page 6 / 24
» A New Method for Compiling Parallel Replacement Rules
Sort
View
IWMM
2009
Springer
152views Hardware» more  IWMM 2009»
14 years 5 months ago
A new approach to parallelising tracing algorithms
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
Cosmin E. Oancea, Alan Mycroft, Stephen M. Watt
PASTE
2005
ACM
14 years 4 months ago
Automatically generating refactorings to support API evolution
When library APIs change, client code should change in response, in order to avoid erroneous behavior, compilation failures, or warnings. Previous research has introduced techniqu...
Jeff H. Perkins
ICPP
1996
IEEE
14 years 2 months ago
Mechanisms for Mapping High-Level Parallel Performance Data
A primary problem in the performance measurement of high-level parallel programming languages is to map lowlevel events to high-level programming constructs. We discuss several as...
R. Bruce Irvin, Barton P. Miller
MICRO
2000
IEEE
133views Hardware» more  MICRO 2000»
14 years 3 months ago
Compiler controlled value prediction using branch predictor based confidence
Value prediction breaks data dependencies in a program thereby creating instruction level parallelism that can increase program performance. Hardware based value prediction techni...
Eric Larson, Todd M. Austin
LPNMR
2001
Springer
14 years 3 months ago
plp: A Generic Compiler for Ordered Logic Programs
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
James P. Delgrande, Torsten Schaub, Hans Tompits