Sciweavers

72 search results - page 7 / 15
» Verifying Local Transformations on Relaxed Memory Models
Sort
View
ASPLOS
1994
ACM
14 years 1 months ago
Compiler Optimizations for Improving Data Locality
In the past decade, processor speed has become significantly faster than memory speed. Small, fast cache memories are designed to overcome this discrepancy, but they are only effe...
Steve Carr, Kathryn S. McKinley, Chau-Wen Tseng
CORR
2007
Springer
83views Education» more  CORR 2007»
13 years 9 months ago
Simulation of Phase Combinations in Shape Memory Alloys Patches by Hybrid Optimization Methods
In this paper, phase combinations among martensitic variants in shape memory alloys patches and bars are simulated by a hybrid optimization methodology. The mathematical model is ...
Linxiang X. Wang, Roderick V. N. Melnik
PLDI
2011
ACM
13 years 19 days ago
Safe optimisations for shared-memory concurrent programs
Current proposals for concurrent shared-memory languages, including C++ and C, provide sequential consistency only for programs without data races (the DRF guarantee). While the i...
Jaroslav Sevcík
ICS
1999
Tsinghua U.
14 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...
ICS
2003
Tsinghua U.
14 years 3 months ago
Estimating cache misses and locality using stack distances
Cache behavior modeling is an important part of modern optimizing compilers. In this paper we present a method to estimate the number of cache misses, at compile time, using a mac...
Calin Cascaval, David A. Padua