81. CS395T: Programming Parallel Algorithms http://www.cs.utexas.edu/users/rdb/cs395T/

Programming Parallel Algorithms Fall 1997 (49120) Instructor: Robert Blumofe Lectures: Monday and Wednesday, 4:00 - 5:30 in Taylor 3.144 Assignments Handouts Lecture notes Participants ... Syllabus Messages Old messages are kept in an archive Assignments Problem Set 1 Problem Set 2 Problem Set 3 Problem Set 4 Handouts General Information Problem Set 1 Problem Set 2 Cilk-5.1 Manual ... Scheduling Multithreaded Computations by Work Stealing , by Robert D. Blumofe and Charles E. Leiserson . In Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS) , November 1994. Problem Set 4 The Weakest Reasonable Memory Model , by Matteo Frigo . Masters thesis, MIT, September 1997. Provably Efficient Scheduling for Languages with Fine-Grained Parallelism , by Guy E. Blelloch , Phillip B. Gibbons and Yossi Matias. In Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA) , July 1995. Lecture notes Lecture 1 Lecture 2 Lecture 3 Lecture 4 ... Lecture 9 Not available Lecture 11 Lecture 12 Lecture 13 Not available Lecture 15 Lecture 16 Lecture 18 Lecture notes from last year's version of this class are available from the old course web page When it is your turn to scribe, you will want the following four files.

82. CISC842 Parallel Languages And Architectures profiling. General parallelism issues; Sharedmemory programming explicitly - egCilk; implicitly - eg HPF. Distributed-memory programming message passing - eg MPI; http://www.cs.queensu.ca/home/skill/842.html

Parallel Languages and Architectures This course is being offered in Fall 2000. Classes meet on Mondays from 5.30-8.30 p.m. in Goodwin 521. For the first two weeks of term, there will be an extra class, Thursdays, 3-5 p.m. in Goodwin 524 (Sep 14 and 21). Your first mission is to find a short list of machines on which you would like to do your implementation work. Each person should use a different machine, so that we can compare the effects of varying hardware configurations. You should find out: the clock speed, L1 cache size, L2 cache size, and total memory available for your chosen machines. The emphasis will be on programming for performance over a wide range of target architectures. Outline Performance programming sequentially memory hierarchy issues making loops fast making procedures fast operator issues code tricks compilers and compiler options profiling General parallelism issues Shared-memory programming explicitly - e.g. Cilk implicitly - e.g. HPF Distributed-memory programming message passing - e.g. MPI

83. FDA125 Friday Feb 21, 2003, 0911, Linköping Knuth, VI.2(a) More parallel programminglanguages and environments cilk (PS), Split-C, NESL, ZPL, Linda, Forum; cilk. http://www.ida.liu.se/~chrke/courses/APP/

Advanced Parallel Programming: Models, Languages, Algorithms (5p) Recommended for Graduate (CUGS, ECSEL, ...) students interested in the areas of parallel computer architecture, parallel programming, compiler construction, or algorithms and complexity. The course is hosted by CUGS as an Advanced Course. Interested undergraduate students are also welcome. Registration / List of participants (internal access only) Organization Lectures (ca. 32h), programming exercises, optional theoretical exercises for self-assessment. The course will be held as block course with two intensive weeks in Linköping. The course was last given This is a new course. It complements the existing graduate course FDA101 on Parallel Programming (4p), which is aliased to the undergraduate course TDDB78. Goals The course emphasizes fundamental aspects of parallel programming such as parallel architectures and programming models, performance models, parallel complexity classes, parallel algorithmic paradigms, parallelization strategies, and the design and implementation of parallel programming languages. Practical exercises help to apply the theoretical concepts of the course to solve concrete problems in different parallel programming models. Prerequisites Data structures and algorithms (e.g. TDDB57) are absolutely required; knowledge in complexity theory and compiler construction is useful. Processprogramming (e.g. TDDB63/68/72) and Parallel Programming (e.g. TDDB78 or TANA77) are useful but not required. Most of the contents of FDA101, i.e. TDDB78, will be summarized during this course. Programming in C is necessary for the practical exercises.

84. DBLP: Charles E. Leiserson Theory of Computing Systems 31(2) 135167 (1998). 1997. 38, Charles E. LeisersonProgramming Irregular Parallel Applications in cilk. IRREGULAR 1997 61-71. http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/l/Leiserson:Charles_E=

Charles E. Leiserson List of publications from the DBLP Bibliography Server FAQ Ask others: ACM CiteSeer CSB Google ... Thomas H. Cormen , Charles E. Leiserson, Ronald L. Rivest Clifford Stein : Introduction to Algorithms, Second Edition. The MIT Press and McGraw-Hill Book Company 2001 EE Ching Law , Charles E. Leiserson: A New Competitive Analysis of Randomized Caching. ISAAC 2000 EE Matteo Frigo , Charles E. Leiserson, Harald Prokop Sridhar Ramachandran : Cache-Oblivious Algorithms. FOCS 1999 EE Charles E. Leiserson: Design and Analysis of Algorithms for Shared-Memory Multiprocessors (Abstract). WADS 1999 EE Robert D. Blumofe , Charles E. Leiserson: Scheduling Multithreaded Computations by Work Stealing. JACM 46 EE Mingdong Feng , Charles E. Leiserson: Efficient Detection of Determinacy Races in Cilk Programs. Theory of Computing Systems 32 Matteo Frigo , Charles E. Leiserson, Keith H. Randall : The Implementation of the Cilk-5 Multithreaded Language. PLDI 1998 EE Guang-Ien Cheng Mingdong Feng , Charles E. Leiserson, Keith H. Randall Andrew F. Stark : Detecting Data Rase in Cilk Programs That use Locks. SPAA 1998 Robert D. Blumofe

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Page 5     81-84 of 84    Back | 1  | 2  | 3  | 4  | 5