Sciweavers

125 search results - page 20 / 25
» Transforming Normal Programs by Replacement
Sort
View
ENTCS
2002
181views more  ENTCS 2002»
13 years 7 months ago
Alias verification for Fortran code optimization
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...
Thi Viet Nga Nguyen, François Irigoin
PLDI
2009
ACM
14 years 2 months ago
PetaBricks: a language and compiler for algorithmic choice
It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when considering different choices for data distributions, parallelism, transformati...
Jason Ansel, Cy P. Chan, Yee Lok Wong, Marek Olsze...
MICRO
2000
IEEE
176views Hardware» more  MICRO 2000»
13 years 7 months ago
An Advanced Optimizer for the IA-64 Architecture
level of abstraction, compared with the program representation for scalar optimizations. For example, loop unrolling and loop unrolland-jam transformations exploit the large regist...
Rakesh Krishnaiyer, Dattatraya Kulkarni, Daniel M....
JDCTA
2010
146views more  JDCTA 2010»
13 years 2 months ago
Modelling for Cruise Two-Dimensional Online Revenue Management System
To solve the cruise two-dimensional revenue management problem and develop such an automated system under uncertain environment, a static model which is a stochastic integer progr...
Bingzhou Li
ICS
2003
Tsinghua U.
14 years 18 days 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