<--- Back to Details
First PageDocument Content
Subroutines / Computability theory / Programming idioms / Mathematical logic / Compiler optimizations / Divide and conquer algorithm / Recursion / Inline expansion / Loop unwinding / Computer programming / Computing / Software engineering
Date: 2003-05-21 20:14:13
Subroutines
Computability theory
Programming idioms
Mathematical logic
Compiler optimizations
Divide and conquer algorithm
Recursion
Inline expansion
Loop unwinding
Computer programming
Computing
Software engineering

Add to Reading List

Source URL: people.csail.mit.edu

Download Document from Source Website

File Size: 133,96 KB

Share Document on Facebook

Similar Documents

Communication Optimizations in the Berkeley UPC Compiler Wei Chen, Costin Iancu, Kathy Yelick UC Berkeley/LBNL http://upc.lbl.gov

DocID: 1tINr - View Document

Graphical Visualization of Compiler Optimizations* MICKEY R. BOYD AND DAVID B. WHALLEY Department of Computer Science 4019, Florida State University, Tallahassee, FL 32306, U.S.A. e-mail: phone: (904)

DocID: 1tFS8 - View Document

Optimizations in a dynamic compiler © 2015 Oracle, Mario Wolczko Part 1 — Optimizing

DocID: 1sZyS - View Document

An Experimental Study of the Influence of Dynamic Compiler Optimizations on Scala Performance Lukas Stadler, Gilles Duboscq, Hanspeter Mössenböck Thomas Würthinger, Doug Simon

DocID: 1sv4l - View Document

Parameterization of Compiler Optimizations For Empirical Tuning Qing Yi University of Texas at San Antonio Empirical Tuning of Compiler

DocID: 1spAM - View Document