Sciweavers

874 search results - page 56 / 175
» Predicting the Running Times of Parallel Programs by Simulat...
Sort
View
ICCD
2008
IEEE
370views Hardware» more  ICCD 2008»
15 years 6 months ago
Simulation points for SPEC CPU 2006
— Increasing sizes of benchmarks make detailed simulation an extremely time consuming process. Statistical techniques such as the SimPoint methodology have been proposed in order...
Arun A. Nair, Lizy K. John
PLDI
2006
ACM
15 years 3 months ago
The Compressor: concurrent, incremental, and parallel compaction
The widely used Mark-and-Sweep garbage collector has a drawback in that it does not move objects during collection. As a result, large long-running realistic applications, such as...
Haim Kermany, Erez Petrank
ASPLOS
2009
ACM
15 years 10 months ago
Leak pruning
Managed languages improve programmer productivity with type safety and garbage collection, which eliminate memory errors such as dangling pointers, double frees, and buffer overfl...
Michael D. Bond, Kathryn S. McKinley
IFIPPACT
1994
14 years 11 months ago
Exploiting the Parallelism Exposed by Partial Evaluation
: We describe an approach to parallel compilation that seeks to harness the vast amount of ne-grain parallelism that is exposed through partial evaluation of numerically-intensive ...
Rajeev J. Surati, Andrew A. Berlin
ICS
1999
Tsinghua U.
15 years 2 months ago
Nonlinear array layouts for hierarchical memory systems
Programming languages that provide multidimensional arrays and a flat linear model of memory must implement a mapping between these two domains to order array elements in memory....
Siddhartha Chatterjee, Vibhor V. Jain, Alvin R. Le...