Sciweavers

466 search results - page 78 / 94
» A Worst Case Timing Analysis Technique for Optimized Program...
Sort
View
PLDI
1995
ACM
14 years 16 hour ago
Selective Specialization for Object-Oriented Languages
Dynamic dispatching is a major source of run-time overhead in object-oriented languages, due both to the direct cost of method lookup and to the indirect effect of preventing othe...
Jeffrey Dean, Craig Chambers, David Grove
LCTRTS
2005
Springer
14 years 2 months ago
Efficient application migration under compiler guidance
Mobile computing based upon wireless technology as the interconnect and PDAs, Web-enabled cell phones etc. as the end devices provide a rich infrastructure for anywhere, anytime i...
Kun Zhang, Santosh Pande
SAS
1997
Springer
111views Formal Methods» more  SAS 1997»
14 years 21 hour ago
Fast and Effective Procedure Inlining
is an important optimization for programs that use procedural abstraction. Because inlining trades code size for execution speed, the effectiveness of an inlining algorithm is det...
Oscar Waddell, R. Kent Dybvig
SC
2009
ACM
14 years 3 months ago
Enabling high-fidelity neutron transport simulations on petascale architectures
The UNIC code is being developed as part of the DOE’s Nuclear Energy Advanced Modeling and Simulation (NEAMS) program. UNIC is an unstructured, deterministic neutron transport c...
Dinesh K. Kaushik, Micheal Smith, Allan Wollaber, ...
ACMMSP
2005
ACM
101views Hardware» more  ACMMSP 2005»
14 years 2 months ago
Transparent pointer compression for linked data structures
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...
Chris Lattner, Vikram S. Adve