Sciweavers

1145 search results - page 27 / 229
» The Correctness of an Optimized Code Generation
Sort
View
PLDI
1996
ACM
13 years 11 months ago
Target-Sensitive Construction of Diagnostic Programs for Procedure Calling Sequence Generators
Building compilers that generate correct code is difficult. In this paper we present a compiler testing technique that closes the gap between actual compiler implementations and c...
Mark W. Bailey, Jack W. Davidson
CORR
2007
Springer
155views Education» more  CORR 2007»
13 years 7 months ago
Low-density graph codes that are optimal for source/channel coding and binning
We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-...
Martin J. Wainwright, Emin Martinian
MICRO
2002
IEEE
159views Hardware» more  MICRO 2002»
14 years 15 days ago
Master/slave speculative parallelization
Master/Slave Speculative Parallelization (MSSP) is an execution paradigm for improving the execution rate of sequential programs by parallelizing them speculatively for execution ...
Craig B. Zilles, Gurindar S. Sohi
MICRO
2002
IEEE
113views Hardware» more  MICRO 2002»
14 years 15 days ago
Vacuum packing: extracting hardware-detected program phases for post-link optimization
This paper presents Vacuum Packing, a new approach to profile-based program optimization. Instead of using traditional aggregate or summarized execution profile weights, this ap...
Ronald D. Barnes, Erik M. Nystrom, Matthew C. Mert...
CATS
2006
13 years 9 months ago
A Polynomial Algorithm for Codes Based on Directed Graphs
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
A. V. Kelarev