Sciweavers

4716 search results - page 669 / 944
» Iterative-free program analysis
Sort
View
IWMM
2007
Springer
122views Hardware» more  IWMM 2007»
16 years 11 days ago
Overlooking roots: a framework for making nondeferred reference-counting garbage collection fast
Numerous optimizations exist for improving the performance of nondeferred reference-counting (RC) garbage collection. Their designs are ad hoc, intended to exploit different count...
Pramod G. Joisha
WAOA
2007
Springer
158views Algorithms» more  WAOA 2007»
16 years 10 days ago
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
Anke van Zuylen, David P. Williamson
FCCM
2006
IEEE
101views VLSI» more  FCCM 2006»
16 years 9 days ago
A Type Architecture for Hybrid Micro-Parallel Computers
Recently, platform FPGAs that integrate sequential processors with a spatial fabric have become prevalent. While these hybrid architectures ease the burden of integrating sequenti...
Benjamin Ylvisaker, Brian Van Essen, Carl Ebeling
IEEEPACT
2006
IEEE
16 years 8 days ago
Whole-program optimization of global variable layout
On machines with high-performance processors, the memory system continues to be a performance bottleneck. Compilers insert prefetch operations and reorder data accesses to improve...
Nathaniel McIntosh, Sandya Mannarswamy, Robert Hun...
ASPLOS
2006
ACM
16 years 6 days ago
Stealth prefetching
Prefetching in shared-memory multiprocessor systems is an increasingly difficult problem. As system designs grow to incorporate larger numbers of faster processors, memory latency...
Jason F. Cantin, Mikko H. Lipasti, James E. Smith