Leiserson, Charles E. - Computer Science and Artificial Intelligence Laboratory & Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT)

• Cache-Oblivious Algorithms EXTENDED ABSTRACT
• A Type-checking Preprocessor for Cilk 2, a Multithreaded C Language
• MacroLevel Scheduling in the Cilk Network of Workstations Environment
• Scheduling Multithreaded Computations by Work Stealing
• Accurate constantz scanline perspective texture mapping Keith H. Randall
• Related Field Analysis Aneesh Aggarwal Keith H. Randall
• An Experimental Comparison of EdgeTriggering and LevelClocking
• Parallel Sparse MatrixVector and MatrixTransposeVector Multiplication Using Compressed Sparse Blocks
• A Performance Study Memorymapped transactions are easy to use because the underlying system automatically handles
• Virtual Networks: Implementation and Analysis Keith H. Randall
• Bibliography [1] C. Scott Ananian, Krste Asanovic, Bradley C. Kuszmaul, Charles E. Leiserson, and Sean Lie.
• Computation-Centric Memory Models Matteo Frigo
• The Libxac Implementation In this chapter, I describe the prototype implementation of the Libxac specification. This prototype
• In this thesis, I have argued that memorymapped transactions provide a simple yet expressive interface for writing programs with multiple processes that concurrently access disk. I described
• A New Approach to Incremental Topological Ordering Michael A. Bender # Jeremy T. Fineman + Seth Gilbert #
• MemoryMapped Transactions Submitted to the Department of Electrical Engineering and Computer Science
• Parallel Algorithms for the Circuit Value Update Problem Charles E. Leiserson
• Denali: A Goaldirected Superoptimizer Rajeev Joshi Greg Nelson Keith Randall #
• The Libxac Interface In this chapter, I present the specification for Libxac, a C library supporting memorymapped trans
• The JCilk1 Runtime System John Danaher
• Cilk: An Efficient Multithreaded Runtime System Robert D. Blumofe Christopher F. Joerg Bradley C. Kuszmaul
• Portable FaultTolerant File I/O Igor B. Lyubashevskiy
• Using Cilk to Write Multiprocessor Chess Programs Charles E. Leiserson
• The JCilk Multithreaded Language I-Ting Angelina Lee
• Brief Announcement: Serial-Parallel Reciprocity in Dynamic Multithreaded Languages
• ComputationCentric Memory Models Matteo Frigo \Lambda
• Portable Checkpointing for Heterogeneous Architectures Balkrishna Ramkumar Volker Strumpen
• Strata: A MultiLayer Communications Library Version 2.0 Beta
• The Implementation of the Cilk5 Multithreaded Language Matteo Frigo Charles E. Leiserson Keith H. Randall
• Contention Resolution with Heterogeneous Job Sizes
• A Consistency Architecture for Hierarchical Shared Caches Edya Ladan-Mozes and Charles E. Leiserson
• Nested Parallelism in Transactional Memory Kunal Agrawal Jeremy T. Fineman Jim Sukha
• Heterogeneous Multithreaded Computing Howard J. Lu
• Restrictions to the Libxac Interface A.1 Restrictions to Libxac
• MemoryMapped Transactions Submitted to the Department of Electrical Engineering and Computer Science
• Search Trees Using Libxac In this chapter I describe how memorymapped transactions can be used in a practical application,
• Introduction In this thesis, I argue that memorymapped transactions provide a simple yet expressive interface for
• Field Analysis: Getting Useful and Lowcost Interprocedural Information
• Adaptive Scheduling with Parallelism Feedback Kunal Agrawal Yuxiong He Wen Jing Hsu Charles E. Leiserson
• Detecting Data Races in Cilk Programs that Use Locks Guang-Ien Cheng Mingdong Feng Charles E. Leiserson Keith H. Randall Andrew F. Stark
• Portable Fault-Tolerant File I/O Igor B. Lyubashevskiy
• Cilk: An Efficient Multithreaded Runtime System ROBERT D. BLUMOFE, CHRISTOPHER F. JOERG, BRADLEY C. KUSZMAUL,
• Executing Multithreaded Programs Efficiently Robert D. Blumofe
• Adaptive Work Stealing with Parallelism Feedback Kunal Agrawal Yuxiong He # Charles E. Leiserson
• Safe OpenNested Transactions Through Ownership Kunal Agrawal ITing Angelina Lee Jim Sukha
• Programming with Exceptions in JCilk 1 John S. Danaher I-Ting Angelina Lee Charles E. Leiserson
• Cache Obl o D nam c Sea ch T ee Zardosht Kasheff
• Cache-Oblivious Algorithms Harald Prokop
• Brief Announcement: A Lower Bound for DepthRestricted Work Stealing
• CacheOblivious Algorithms EXTENDED ABSTRACT
• Compiler Technology for Portable Checkpoints Volker Strumpen \Lambda
• Portable High-Performance Programs Matteo Frigo
• A WorkEfficient Parallel BreadthFirst Search Algorithm (or How to Cope with the Nondeterminism of Reducers)
• Brief Announcement: SerialParallel Reciprocity in Dynamic Multithreaded Languages
• The Cilk System for Parallel Multithreaded Computing Christopher F. Joerg
• Compiler Technology for Portable Checkpoints Volker Strumpen
• Heterogeneous Multithreaded Computing Howard J. Lu
• Cilk: An Efficient Multithreaded Runtime System \Lambda ROBERT D. BLUMOFE, CHRISTOPHER F. JOERG, BRADLEY C. KUSZMAUL,
• Memory Models for OpenNested Transactions Kunal Agrawal Charles E. Leiserson Jim Sukha
• LocationBased Memory Fences Edya LadanMozes ITing Angelina Lee
• Algorithms for DataRace Detection in Multithreaded Programs
• The Cilk System for Parallel Multithreaded Computing Christopher F. Joerg
• The Libxac Implementation In this chapter, I describe the prototype implementation of the Libxac specification. This prototype
• DagConsistent Distributed Shared Memory Robert D. Blumofe Matteo Frigo Christopher F. Joerg
• Managing Storage for Multithreaded Computations Robert D. Blumofe
• The weakest reasonable memory model Matteo Frigo
• A Consistency Architecture for Hierarchical Shared Caches Edya LadanMozes and Charles E. Leiserson
• Performance Nonmonotonicities: A Case Study of the UltraSPARC Processor
• Macro-Level Scheduling in the Cilk Network of Workstations Environment
• Scheduling LargeScale Parallel Computations on Networks of Workstations
• A Fast Fourier Transform Compiler Matteo Frigo \Lambda
• Unbounded Transactional Memory C. Scott Ananian Krste Asanovi c Bradley C. Kuszmaul Charles E. Leiserson Sean Lie
• Safe OpenNested Transactions Through Ownership Kunal Agrawal ITing Angelina Lee Jim Sukha
• A Fast Fourier Transform Compiler Matteo Frigo
• Hardware Support for Unbounded Transactional Memory
• October 2006 Department of Facilities
• Programming with Exceptions in JCilk 1 John S. Danaher ITing Angelina Lee Charles E. Leiserson
• Massively Parallel Chess Christopher F. Joerg 1 and Bradley C. Kuszmaul 2
• The JCilk Multithreaded Language ITing Angelina Lee
• Scheduling Adaptively Parallel Jobs A. B. (Computer Science and Mathematics), Dartmouth College (1996)
• An Empirical Evaluation of Work Stealing with Parallelism Feedback Kunal Agrawal Yuxiong He Charles E. Leiserson
• Detecting Data Races in Cilk Programs that Use Locks GuangIen Cheng \Lambda Mingdong Feng + Charles E. Leiserson \Lambda Keith H. Randall \Lambda Andrew F. Stark \Lambda
• The JCilk-1 Runtime System John Danaher
• Selected Solutions for Chapter 5: Probabilistic Analysis and Randomized
• Managing Storage for Multithreaded Computations Robert D. Blumofe
• Massachusetts Institute of Technology November 20, 2009
• Improved Approximations for Multiprocessor Scheduling Under Uncertainty
• Cache-Oblivious Streaming B-trees Michael A. Bender
• Brief Announcement: A Lower Bound for Depth-Restricted Work Stealing
• Safe Open-Nested Transactions Through Ownership Kunal Agrawal I-Ting Angelina Lee Jim Sukha
• A Simple LATEXTemplate November 27, 2006
• Selected Solutions for Chapter 8: Sorting in Linear Time
• Selected Solutions for Chapter 9: Medians and Order Statistics
• Selected Solutions for Chapter 11: Hash Tables
• Selected Solutions for Chapter 12: Binary Search Trees
• Selected Solutions for Chapter 13: Red-Black Trees
• Selected Solutions for Chapter 14: Augmenting Data Structures
• Selected Solutions for Chapter 16: Greedy Algorithms
• Introduction In this thesis, I argue that memory-mapped transactions provide a simple yet expressive interface for
• Restrictions to the Libxac Interface A.1 Restrictions to Libxac
• Number Theory Figurate Numbers
• Solutions are left as an exercise for the reader. All answers must be simplified and exact answers unless otherwise specified (irrational decimal answers require infinitely many
• On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs
• A Work-Efficient Parallel Breadth-First Search Algorithm (or How to Cope with the Nondeterminism of Reducers)
• An Analysis of Dag-Consistent Distributed Shared-Memory Algorithms Robert D. Blumofe Matteo Frigo Christopher F. Joerg
• OntheFly Maintenance of SeriesParallel Relationships in ForkJoin Multithreaded Programs
• Synchronized MIMD Computing Bradley C. Kuszmaul
• Provably E#cient TwoLevel Adaptive Scheduling
• Algorithms for Data-Race Detection in Multithreaded Programs
• The JCilk Language for Multithreaded Computing [Extended Abstract]
• LecTix: A Lecture-Multimedia Player Timothy D. Olsen
• The Design and Implementation of FFTW3 Matteo Frigo and Steven G. Johnson
• Provably Good Race Detection That Runs in Parallel Jeremy T. Fineman
• Efficient Detection of Determinacy Races in Cilk Programs Mingdong Feng
• Concurrent CacheOblivious BTrees Using Transactional Bradley C. Kuszmaul Jim Sukha
• Debugging Multithreaded Programs that Incorporate UserLevel Locking
• Dynamic Processor Allocation for Adaptively Parallel WorkStealing Jobs
• MemoryMapped Transactions Submitted to the Department of Electrical Engineering and Computer
• Synchronized MIMD Computing Bradley C. Kuszmaul
• Memory-Mapped Transactions Submitted to the Department of Electrical Engineering and Computer Science
• Debugging Multithreaded Programs that Incorporate User-Level Locking
• Reference Manual Supercomputing Technologies Group
• In this thesis, I have argued that memory-mapped transactions provide a simple yet expressive interface for writing programs with multiple processes that concurrently access disk. I described
• An Analysis of DagConsistent Distributed SharedMemory Algorithms Robert D. Blumofe \Lambda Matteo Frigo + Christopher F. Joerg +
• Portable HighPerformance Programs Matteo Frigo
• ExternalMemory Search Trees with Fast Jelani Nelson
• CacheOblivious Algorithms Harald Prokop
• Media Lab Extension CornerofAmesandAmherstStreetsonMIT'seastcampus
• A Performance Study Memory-mapped transactions are easy to use because the underlying system automatically handles
• 1. Search for a pattern: Ex. Compute ( )( )( )( )31 30 29 28 1+ (no calculators) (1989 AIME, #1)
• Performance Nonmonotonicities: A Case Study of the UltraSPARC Processor
• Sloan School Expansion ExtendsfromMemorialDrivetoMainStreetinMIT'seastcampus
• Memory Models for Open-Nested Transactions Kunal Agrawal Charles E. Leiserson Jim Sukha
• Adaptive and Reliable Parallel Computing on Networks of Workstations
• Cilk: Efficient Multithreaded Computing Keith H. Randall
• A Typechecking Preprocessor for Cilk 2, a Multithreaded C Language
• Hardware Support for Unbounded Transactional Memory
• DataRace Detection in Transactions Everywhere Parallel Programming
• Helper Locks for ForkJoin Parallel Programming Kunal Agrawal # Charles E. Leiserson Jim Sukha
• The StarTech Massively Parallel Chess Program Bradley C. Kuszmaul
• Koch Institute Corners of Main/Vassar Streets and Main/Ames Streets
• Scheduling Large-Scale Parallel Computations on Networks of Workstations
• Environmental Goals for MIT MIT will become a leader in environmentally responsible operations, development of
• Bibliography [1] C. Scott Ananian, Krste Asanovic, Bradley C. Kuszmaul, Charles E. Leiserson, and Sean Lie.
• Competitive Analysis 6.046 Recitation Notes
• Distrib. Comput. (2008) 20:323341 DOI 10.1007/s00446-007-0050-0
• The weakest reasonable memory model Matteo Frigo
• The Implementation of the Cilk-5 Multithreaded Language Matteo Frigo Charles E. Leiserson Keith H. Randall
• CacheOblivious Streaming Btrees Michael A. Bender
• Using de Bruijn Sequences to Index a 1 in a Computer Word
• Root-Cause Analysis of SAN Performance Problems: An I/O Path Affine Search Approach
• Selected Solutions for Chapter 22: Elementary Graph Algorithms
• Selected Solutions for Chapter 2: Getting Started
• We are pleased to present our strategic plan for Fiscal Year 2007. This plan was developed
• Using Memory Mapping to Support Cactus Stacks in WorkStealing Runtime Systems
• Executing Task Graphs Using WorkStealing Kunal Agrawal
• Location-Based Memory Fences Edya Ladan-Mozes I-Ting Angelina Lee
• Search Trees Using Libxac In this chapter I describe how memory-mapped transactions can be used in a practical application,
• The Libxac Interface In this chapter, I present the specification for Libxac, a C library supporting memory-mapped trans-
• A Consistency Architecture for Hierarchical Shared Caches Edya Ladan-Mozes and Charles E. Leiserson
• Selected Solutions for Chapter 26: Maximum Flow
• Selected Solutions for Chapter 24: Single-Source Shortest Paths
• Selected Solutions for Chapter 15: Dynamic Programming
• Memory-Mapped Transactions Submitted to the Department of Electrical Engineering and Computer Science
• Parallel Sparse Matrix-Vector and Matrix-Transpose-Vector Multiplication Using Compressed Sparse Blocks
• Using Memory Mapping to Support Cactus Stacks in Work-Stealing Runtime Systems
• A Work-Efficient Parallel Breadth-First Search Algorithm (or How to Cope with the Nondeterminism of Reducers)
• Brief Announcement: A Lower Bound for Depth-Restricted Work Stealing
• Safe Open-Nested Transactions Through Ownership Kunal Agrawal I-Ting Angelina Lee Jim Sukha
• Safe Open-Nested Transactions Through Ownership Kunal Agrawal I-Ting Angelina Lee Jim Sukha
• Nested Parallelism in Transactional Memory Kunal Agrawal Jeremy T. Fineman Jim Sukha
• Cache-Oblivious Streaming B-trees Michael A. Bender
• Provably Efficient Two-Level Adaptive Scheduling
• External-Memory Search Trees with Fast Jelani Nelson
• The JCilk Language for Multithreaded Computing [Extended Abstract]
• Provably Good Race Detection That Runs in Parallel Jeremy T. Fineman
• Concurrent Cache-Oblivious B-Trees Michael A. Bender
• Memory-Mapped Transactions Submitted to the Department of Electrical Engineering and Computer
• Unbounded Transactional Memory C. Scott Ananian Krste Asanovic Bradley C. Kuszmaul Charles E. Leiserson Sean Lie
• Dynamic Processor Allocation for Adaptively Parallel Work-Stealing Jobs
• On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs
• Data-Race Detection in Transactions-Everywhere Parallel Programming
• Scheduling Multithreaded Computations by Work Stealing
• Using deBruijn Sequences to Index a 1 in a Computer Word
• Cilk: E cient Multithreaded Computing Keith H. Randall
• Scheduling Adaptively Parallel Jobs A. B. (Computer Science and Mathematics), Dartmouth College (1996)
• Efficient Detection of Determinacy Races in Cilk Programs Mingdong Feng
• Adaptive and Reliable Parallel Computing on Networks of Workstations
• The Fastest Fourier Transform in the West (MIT-LCS-TR-728)
• Portable Checkpointing for Heterogeneous Architectures Balkrishna Ramkumar Volker Strumpen
• Dag-Consistent Distributed Shared Memory Robert D. Blumofe Matteo Frigo Christopher F. Joerg
• Executing Multithreaded Programs Efficiently Robert D. Blumofe
• Cilk: An Efficient Multithreaded Runtime System Robert D. Blumofe Christopher F. Joerg Bradley C. Kuszmaul
• The StarTech Massively Parallel Chess Program Bradley C. Kuszmaul
• Massively Parallel Chess Christopher F. Joerg1
• Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs
• 4. Julie Fassett Garden 5. duPont Garden 6. Martin Luther King Jr. Garden
• CHARLOTTE'S MASSACHUSETTS
• Parking Services http://web.mit.edu/facilities/transportation/parking
• On-Campus Tree Relocation: From Dibner Garden to E32 Park
• GRAPHICSTANDARDS MIT COMPUTER SCIENCE AND ARTIFICIAL INTELLIGENCE LABORATORY
• Strata: A Multi-Layer Communications Library Version 2.0 Beta
• Facilities Customer Forum Theresa Stone, Executive Vice President and Treasurer
• Bicycle Commuting web.mit.edu/facilities/transportation/bicycling
• Join the Discussion!If you care about your health or even if you never give it a second thought, MIT Medical wants your opinion as they improve their healthy living programs.
• Doctoral Thesis Committee and Student Progress The Committee for Graduate Students feels that it would be useful to provide a set of best practices for doctoral
• TABLE OF CONTENTS Customer Service Center
• MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science
• Plan for Completing the Technical Qualifying Evaluation Name:_____________________________________________MIT ID #:___________________________
• Graduate Degree Programs and Contact Information Department of Aeronautics and Astronautics Engineering Systems Division
• September 2011 I'M PURPLE! MASSACHUSETTS INSTITUTE OF TECHNOLOGY
• Facility Information Systems MIT Campus Planning, Engineering, and Construction
• MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science
• The MIT Press Spring 2012
• MIT Department of Electrical Engineering and Computer Science Graduate Reference Guide 2011-2012
• ACADEMIC YEAR 2011-2012 MASSACHUSETTS INSTITUTE OF TECHNOLOGY
• FFTW: AN ADAPTIVE SOFTWARE ARCHITECTURE FOR THE FFT Matteo Frigo
• The Fastest Fourier Transform in the West (MITLCSTR728)
• A Fast Fourier Transform Compiler Matteo Frigo \Lambda
• Parallel Sparse Matrix-Vector and Matrix-Transpose-Vector Multiplication Using Compressed Sparse Blocks
• arXiv:0708.4399v2[cs.DS]29Jan2009 1 Type-IV DCT, DST, and MDCT algorithms
• Selected Solutions for Chapter 7: Solution to Exercise 7.2-3
• A Fast Fourier Transform Compiler Matteo Frigo
• Selected Solutions for Chapter 3: Growth of Functions
• arXiv:cs/0703150v2[cs.NA]29Jan2009 1 Type-II/III DCT/DST algorithms
• Deterministic Parallel Random-Number Generation for Dynamic-Multithreading Platforms
• The Design and Implementation of FFTW3 Matteo Frigo and Steven G. Johnson
• for version 3.3.1, 20 February 2012 Matteo Frigo
• Selected Solutions for Chapter 23: Minimum Spanning Trees
• Selected Solutions for Chapter 4: Divide-and-Conquer
• Adaptive Work Stealing with Parallelism Feedback Kunal Agrawal Yuxiong He Charles E. Leiserson
• OPTIONAL IMAGE OR RENDERING OF
• Selected Solutions for Chapter 17: Amortized Analysis
• Selected Solutions for Chapter 21: Data Structures for Disjoint Sets
• The Fastest Fourier Transform in the West (MIT-LCS-TR-728)
• Selected Solutions for Chapter 6: Solution to Exercise 6.1-1
• Selected Solutions for Chapter 25: All-Pairs Shortest Paths
• FFTW: AN ADAPTIVE SOFTWARE ARCHITECTURE FOR THE FFT Matteo Frigo
• EVENT DATES Tuesday, 3/27/12 from 8 AM to 8 PM