Sciweavers

4889 search results - page 878 / 978
» A Refactoring Approach to Parallelism
Sort
View
MICRO
1996
IEEE
106views Hardware» more  MICRO 1996»
15 years 8 months 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...
VVS
1996
IEEE
202views Visualization» more  VVS 1996»
15 years 8 months ago
Direct Volume Rendering with Shading via Three-Dimensional Textures
A new and easy-to-implement method for direct volume rendering that uses 3D texture maps for acceleration, and incorporates directional lighting, is described. The implementation,...
Allen Van Gelder, Kwansik Kim
PLDI
1996
ACM
15 years 8 months ago
A Reduced Multipipeline Machine Description that Preserves Scheduling Constraints
High performance compilers increasingly rely on accurate modeling of the machine resources to efficiently exploit the instruction level parallelism of an application. In this pape...
Alexandre E. Eichenberger, Edward S. Davidson
166
Voted
MICRO
1993
IEEE
131views Hardware» more  MICRO 1993»
15 years 8 months ago
Superblock formation using static program analysis
Compile-time code transformations which expose instruction-level parallelism (ILP) typically take into account the constraints imposed by all execution scenarios in the program. H...
Richard E. Hank, Scott A. Mahlke, Roger A. Bringma...
COMPGEOM
1993
ACM
15 years 8 months ago
Approximating Center Points with Iterated Radon Points
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
Kenneth L. Clarkson, David Eppstein, Gary L. Mille...