A Minicourse on Multithreaded Programming
A Minicourse on Multithreaded Programming
复制标题
多线程编程迷你课程
DOI：
--
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
H. Prokop
中科院分区：
文献类型：
--
作者：
C. Leiserson;H. Prokop
这些笔记包含两个讲座，教多线程算法使用一个Cilk样模型这些讲座是专为麻省理工学院本科课程的后半部分介绍算法的课堂笔记的风格如下的教科书由Cormen Leiserson和Rivest，但从该教科书的伪代码已被Cilki艾德，使其能够描述多线程算法的第一个讲座教多线程背后的基础知识包括定义工作和关键路径长度的措施它最终在贪婪调度定理由于格雷厄姆和布伦特第二讲显示如何并行应用程序，包括矩阵乘法和排序可以分析使用分治递归多线程编程随着多处理器系统已经变得越来越可用的兴趣已经增长在并行编程多线程编程是一种编程一种将单个程序分解为多个控制线程的范例，这些线程相互作用以解决单个问题。这些笔记介绍了多线程算法的分析。
These notes contain two lectures that teach multithreaded algorithms using a Cilk like model These lectures were designed for the latter part of the MIT undergraduate class Introduction to Algorithms The style of the lecture notes follows that of the textbook by Cormen Leiserson and Rivest but the pseudocode from that textbook has been Cilki ed to allow it to describe multithreaded algo rithms The rst lecture teaches the basics behind multithreading including de ning the measures of work and critical path length It culminates in the greedy scheduling theorem due to Graham and Brent The second lecture shows how parallel applications including matrix multiplication and sorting can be analyzed using divide and conquer recurrences Multithreaded programming As multiprocessor systems have become increasingly available interest has grown in parallel programming Multithreaded programming is a programming paradigm in which a single program is broken into multiple threads of control which interact to solve a single problem These notes provide an introduction to the analysis of multithreaded algorithms This research was supported in part by the Defense Advanced Research Projects Agency DARPA under Grant F