Lattner

Results: 47



#Item
31Macroscopic Data Structure Analysis & Optimization Chris Lattner, Prof. Vikram Adve, UIUC Macroscopic Data Structure Optimization  DSA Algorithm Highlights

Macroscopic Data Structure Analysis & Optimization Chris Lattner, Prof. Vikram Adve, UIUC Macroscopic Data Structure Optimization DSA Algorithm Highlights

Add to Reading List

Source URL: llvm.org

Language: English - Date: 2010-02-25 20:19:41
32c Copyright by Chris Arthur Lattner, 2002 LLVM: AN INFRASTRUCTURE FOR MULTI-STAGE OPTIMIZATION  BY

c Copyright by Chris Arthur Lattner, 2002 LLVM: AN INFRASTRUCTURE FOR MULTI-STAGE OPTIMIZATION BY

Add to Reading List

Source URL: llvm.org

Language: English - Date: 2010-02-25 20:19:41
33MACROSCOPIC DATA STRUCTURE ANALYSIS AND OPTIMIZATION  BY CHRIS LATTNER B.S., University of Portland, 2000

MACROSCOPIC DATA STRUCTURE ANALYSIS AND OPTIMIZATION BY CHRIS LATTNER B.S., University of Portland, 2000

Add to Reading List

Source URL: llvm.org

Language: English - Date: 2010-02-25 20:19:41
34MACROSCOPIC DATA STRUCTURE ANALYSIS AND OPTIMIZATION  BY CHRIS LATTNER B.S., University of Portland, 2000

MACROSCOPIC DATA STRUCTURE ANALYSIS AND OPTIMIZATION BY CHRIS LATTNER B.S., University of Portland, 2000

Add to Reading List

Source URL: llvm.org

Language: English - Date: 2010-02-25 20:19:41
35LLVM: AN INFRASTRUCTURE FOR MULTI-STAGE OPTIMIZATION  BY CHRIS ARTHUR LATTNER B.S., University of Portland, 2000

LLVM: AN INFRASTRUCTURE FOR MULTI-STAGE OPTIMIZATION BY CHRIS ARTHUR LATTNER B.S., University of Portland, 2000

Add to Reading List

Source URL: llvm.org

Language: English - Date: 2010-02-25 20:19:41
36Automatic Pool Allocation: Improving Performance by Controlling Data Structure Layout in the Heap Chris Lattner

Automatic Pool Allocation: Improving Performance by Controlling Data Structure Layout in the Heap Chris Lattner

Add to Reading List

Source URL: llvm.org

Language: English - Date: 2010-02-25 20:19:41
37Transparent Pointer Compression for Linked Data Structures Chris Lattner Vikram S. Adve University of Illinois at Urbana-Champaign {lattner,vadve}@cs.uiuc.edu

Transparent Pointer Compression for Linked Data Structures Chris Lattner Vikram S. Adve University of Illinois at Urbana-Champaign {lattner,vadve}@cs.uiuc.edu

Add to Reading List

Source URL: llvm.org

Language: English - Date: 2010-02-25 20:19:41
38Making Context-sensitive Points-to Analysis with Heap Cloning Practical For The Real World ∗ Chris Lattner Andrew Lenharth

Making Context-sensitive Points-to Analysis with Heap Cloning Practical For The Real World ∗ Chris Lattner Andrew Lenharth

Add to Reading List

Source URL: llvm.org

Language: English - Date: 2010-02-25 20:19:41
39Transparent Pointer Compression for Linked Data Structures Chris Lattner Vikram Adve

Transparent Pointer Compression for Linked Data Structures Chris Lattner Vikram Adve

Add to Reading List

Source URL: llvm.org

Language: English - Date: 2010-02-25 20:19:41
40LLVA: A Low-level Virtual Instruction Set Architecture Vikram Adve Chris Lattner Michael Brukman Anand Shukla Brian Gaeke Computer Science Department University of Illinois at Urbana-Champaign {vadve,lattner,brukman,ashu

LLVA: A Low-level Virtual Instruction Set Architecture Vikram Adve Chris Lattner Michael Brukman Anand Shukla Brian Gaeke Computer Science Department University of Illinois at Urbana-Champaign {vadve,lattner,brukman,ashu

Add to Reading List

Source URL: llvm.org

Language: English - Date: 2010-02-25 20:19:41