Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.Cataloged from PDF version of thesis.Includes bibliographical references (pages 231-251).The process of optimizing programs and libraries, both for performance and quality of service, can be viewed as a search problem over the space of implementation choices. This search is traditionally manually conducted by the programmer and often must be repeated when systems, tools, or requirements change. The overriding goal of this work is to automate this search so that programs can change themselves and adapt to achieve performance portability across different environments and requirements. To achieve this, first, this work present...
AbstractAn autotuning framework based on an algorithm description language dedicated to array proces...
It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when c...
Abstract—Autotuning systems intelligently navigate a search space of possible implementations of a c...
Program autotuning has been shown to achieve better or more portable performance in a number of doma...
It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when c...
It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when c...
It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when c...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
Abstract. The increasing complexities of modern architectures require compilers to extensively apply...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Algorithmic choice is essential in any problem domain to realizing optimal computational performance...
A daunting challenge faced by program performance autotuning is input sensitivity, where the best au...
Modern high performance libraries, such as ATLAS and FFTW, and programming languages, such as PetaBr...
Empirical autotuning is increasingly being used in many domains to achieve optimized performance in ...
Automatic tuning (auto-tuning) of software has emerged in recent years as a promising method that tr...
AbstractAn autotuning framework based on an algorithm description language dedicated to array proces...
It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when c...
Abstract—Autotuning systems intelligently navigate a search space of possible implementations of a c...
Program autotuning has been shown to achieve better or more portable performance in a number of doma...
It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when c...
It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when c...
It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when c...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
Abstract. The increasing complexities of modern architectures require compilers to extensively apply...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Algorithmic choice is essential in any problem domain to realizing optimal computational performance...
A daunting challenge faced by program performance autotuning is input sensitivity, where the best au...
Modern high performance libraries, such as ATLAS and FFTW, and programming languages, such as PetaBr...
Empirical autotuning is increasingly being used in many domains to achieve optimized performance in ...
Automatic tuning (auto-tuning) of software has emerged in recent years as a promising method that tr...
AbstractAn autotuning framework based on an algorithm description language dedicated to array proces...
It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when c...
Abstract—Autotuning systems intelligently navigate a search space of possible implementations of a c...