Sciweavers

11384 search results - page 1996 / 2277
» Achieved IPC Performance
Sort
View
IEEEPACT
2000
IEEE
15 years 9 months ago
A Lightweight Algorithm for Dynamic If-Conversion during Dynamic Optimization
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...
Kim M. Hazelwood, Thomas M. Conte
INFOCOM
2000
IEEE
15 years 9 months ago
Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...
Murali S. Kodialam, T. V. Lakshman
PLDI
2000
ACM
15 years 9 months ago
Dynamo: a transparent dynamic optimization system
We describe the design and implementation of Dynamo, a software dynamic optimization system that is capable of transparently improving the performance of a native instruction stre...
Vasanth Bala, Evelyn Duesterwald, Sanjeev Banerjia
SC
2000
ACM
15 years 9 months ago
Parallel Smoothed Aggregation Multigrid: Aggregation Strategies on Massively Parallel Machines
Algebraic multigrid methods offer the hope that multigrid convergence can be achieved (for at least some important applications) without a great deal of effort from engineers an...
Ray S. Tuminaro, Charles Tong
SIGGRAPH
2000
ACM
15 years 9 months ago
Illuminating micro geometry based on precomputed visibility
Many researchers have been arguing that geometry, bump maps, and BRDFs present a hierarchy of detail that should be exploited for efficient rendering purposes. In practice howeve...
Wolfgang Heidrich, Katja Daubert, Jan Kautz, Hans-...
« Prev « First page 1996 / 2277 Last » Next »