Sciweavers

601 search results - page 75 / 121
» Lattice-based memory allocation
Sort
View
ISCA
2005
IEEE
115views Hardware» more  ISCA 2005»
14 years 1 months ago
RENO - A Rename-Based Instruction Optimizer
RENO is a modified MIPS R10000 register renamer that uses map-table “short-circuiting” to implement dynamic versions of several well-known static optimizations: move eliminat...
Vlad Petric, Tingting Sha, Amir Roth
ICPP
1999
IEEE
14 years 8 hour ago
Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints
In past massively parallel processing systems, such as the TMC CM-5 and the CRI T3E, the scheduling problem consisted of allocating a single type of resource among the waiting job...
William Leinberger, George Karypis, Vipin Kumar
CGO
2007
IEEE
14 years 2 months ago
Run-Time Support for Optimizations Based on Escape Analysis
The JavaTM programming language does not allow the programmer to influence memory management. An object is usually allocated on the heap and deallocated by the garbage collector ...
Thomas Kotzmann, Hanspeter Mössenböck
LCTRTS
2005
Springer
14 years 1 months ago
Syncopation: generational real-time garbage collection in the metronome
Real-time garbage collection has been shown to be feasible, but for programs with high allocation rates, the utilization achievable is not sufficient for some systems. Since a hi...
David F. Bacon, Perry Cheng, David Grove, Martin T...
ICCD
2006
IEEE
97views Hardware» more  ICCD 2006»
14 years 4 months ago
Pesticide: Using SMT Processors to Improve Performance of Pointer Bug Detection
Pointer bugs associated with dynamically-allocated objects resulting in out-of-bounds memory access are an important class of software bugs. Because such bugs cannot be detected e...
Jin-Yi Wang, Yen-Shiang Shue, T. N. Vijaykumar, Sa...