Sciweavers

108 search results - page 9 / 22
» Compactly representing parallel program executions
Sort
View
ATAL
2010
Springer
13 years 3 months ago
Approximate dynamic programming with affine ADDs
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
Scott Sanner, William T. B. Uther, Karina Valdivia...
ICS
1993
Tsinghua U.
14 years 20 days ago
The EM-4 Under Implicit Parallelism
: The EM-4 is a supercomputer that offers very fast inter processor communication and support for multi threading. In this paper we demonstrate that the EM-4, Together with an auto...
Lubomir Bic, Mayez A. Al-Mouhamed
IPPS
2005
IEEE
14 years 2 months ago
Automatic Construction and Evaluation of Performance Skeletons
The performance skeleton of an application is a short running program whose execution time in any scenario reflects the estimated execution time of the application it represents....
Sukhdeep Sodhi, Jaspal Subhlok
MICRO
1996
IEEE
106views Hardware» more  MICRO 1996»
14 years 22 days ago
Optimization of Machine Descriptions for Efficient Use
A machine description facility allows compiler writers to specify machine execution constraints to the optimization and scheduling phases of an instruction-level parallelism (ILP)...
John C. Gyllenhaal, Wen-mei W. Hwu, B. Ramakrishna...
LCPC
2007
Springer
14 years 2 months ago
Using ZBDDs in Points-to Analysis
Binary Decision Diagrams (BDDs) have recently become widely accepted as a space-efficient method of representing relations in points-to analyses. When BDDs are used to represent re...
Ondrej Lhoták, Stephen Curial, José ...