PPT-PetaBricks: A Language and Compiler based on Autotuning

Saman Amarasinghe Joint work with Jason Ansel Marek Olszewski Cy Chan Yee Lok Wong Maciej Pacula UnaMay OReilly and Alan Edelman Computer Science and Artificial Intelligence Laboratory. specified by programmer into binary Typically assemblers make two passes over the assembly file First pass reads each line and records labels in a symbol table Second pass use info in symbol table to produce actual machine code for each line brPage Hollingsw orth Univ ersit of Maryland Univ ersit of Utah Departmen of Computer Science Sc ho ol of Computing College ark MD 20740 Salt Lak Cit UT 84112 tiw ari hollings csumdedu unc hen mhall csutahedu Univ ersit of Southern California Information S 1 Introduction Any autotuning procedure starts by taking inputoutput measurements from the pro cess This can be done in open or closedloop by deliberately injecting some stim ulus or simply relying on the excitation provided by standard manoeuvres li -- Basic functions. Generally, an independent course, maybe plus one semester on implementation of a compiler.. High level language program .  program in assembly language or object code directly. Hiding Exploit in Compilers. bootstrapping, self-generating code, . tombstone diagrams. Ras Bodik . Mangpo . and Ali. Hack Your Language!. CS164. : Introduction to Programming . Languages and Compilers, Spring . CS164. : Introduction to Programming. Languages and Compilers, Spring 2012. UC . Berkeley. Ras, Ali, and Mangpo. . Lecture 1: Why Take . CS164?. Today. What is a programming language. Why you will write a few in your life. Hans-J. Boehm, HP Labs. Presented by . Seema Saijpaul. CS-510. Premise. . Multithreaded programs are often written in languages that are not designed with threading primitives. . Thread support in these languages are added through thread libraries (. Computational . Exascale. Workshop. December 2010. Dan Quinlan. Chunhua. Liao, Justin Too, Robb . Matzke. , Peter . Pirkelbauer. Center for Applied Scientific Computing. Lawrence Livermore National Laboratory. By Namita Dave. Overview. What are compiler optimizations?. Challenges with optimizations. Current Solutions. Machine learning techniques. Structure of Adaptive compilers. Introduction. O. ptimization . of Evolving Surfaces. Wei Yu. Citadel Investment Group. Franz Franchetti, James C. Hoe, José M. F. Moura . Carnegie Mellon University. Tsuhan Chen. Cornell University. This work was supported . by DARPA, ONR, NSF, Intel, Mercury, and ITRI. Size of the source language (bigger = harder). Extent of change during compiler construction (more changes = harder). Performance Criteria. Compiler Speed. Code Quality. Error Diagnostics. Portability. Environment: . The . Need and Current . Challenges. Presenting . Author. : Contact. :. Taher Ahmed Ghaleb . . g201106210@kfupm.edu.sa. 1. st.  International Conference on Open Source Software Computing (OSSCOM 2015. Tharindu Rusira. ✝. , Mary Hall. ✝. , Protonu Basu. *. ✝. School of Computing, University of Utah. * . Lawrence Berkeley National Laboratory. . Outline. GMG and phased performance behavior. Domain-specific optimizations. usually machine language, sometimes assembly language as an intermediate. for Java and . .net. , compilers convert code into an intermediate format. a just-in-time (JIT) compiler or interpreter then converts it into machine code.