Back to Results
First PageMeta Content
Subroutines / Computability theory / Programming idioms / Mathematical logic / Compiler optimizations / Divide and conquer algorithm / Recursion / Inline expansion / Loop unwinding / Computer programming / Computing / Software engineering


Document Date: 2003-05-21 20:14:13

Open Document

File Size: 133,96 KB

Share Result on Facebook

City

Portland / Montreal / New York / /

Company

IBM / Las Vegas NV / Martin Rinard Laboratory / /

Country

France / Canada / /

/

Facility

Princeton University / Computer Science Massachusetts Institute of Technology Cambridge / M. W. Hall / /

IndustryTerm

compiler infrastructure / level algorithm / dense linear-algebra algorithms / recursion unrolling algorithms / divide-and-conquer algorithm / call site / conditional fusion algorithm / recursion rerolling algorithm / compiler technology / overall algorithm / recursion inlining algorithm / recursion inline algorithm / overall recursion unrolling algorithm / recursion unrolling algorithm / /

OperatingSystem

Linux / IRIX / /

Organization

Institute of Technology Cambridge / National Science Foundation / Princeton University / Massachusetts Institute of Technology / /

Person

Andrew W. Appel / /

Position

translator / programmer / /

ProgrammingLanguage

Cilk / C / /

ProvinceOrState

New York / /

Technology

object-oriented programming / 3 Algorithms / r−1 Algorithm / inlining algorithm / recursion inlining algorithm / Optimizing compiler technology / overall algorithm / recursive / divide-and-conquer algorithm / Linux / overall recursion unrolling algorithm / recursion rerolling algorithm / dense linear-algebra algorithms / analysis algorithms / recursion unrolling algorithms / Conditional Fusion Algorithm / recursion unrolling algorithm / Recursion Re-Rolling Algorithm / 3.2 Recursion Inlining The recursion inline algorithm / /

SocialTag