并行算法学习-1课程介绍

Syllabus

The course topics are centered on three different ideas or extensions to the usual serial RAM model you encounter in CS 101. Recall that a serial RAM assumes a sequential or serial processor connected to a main memory.
教学大纲
课程主题集中于您在CS 101中遇到的常见串行RAM模型的三个不同概念或扩展。回想一下，串行RAM假定将顺序或串行处理器连接到主存储器。

Unit 1: The work-span or dynamic multithreading model

第1单元：工作范围或动态多线程模型

In this model, the idea is that there are multiple processors connected to the main memory. Since they can all “see” the same memory, the processors can coordinate and communicate via reads and writes to that “shared” memory.
在此模型中，想法是将多个处理器连接到主存储器。由于它们都可以“看到”相同的内存，因此处理器可以通过对该“共享”内存的读写进行协调和通信。

Sub-topics include:

子主题包括：
Intro to the basic algorithmic model
Intro to OpenMP, a practical programming model
Comparison-based sorting algorithms
Scans and linked list algorithms
Tree algorithms
Graph algorithms,
e.g., breadth-first search
介绍基本的算法模型
介绍OpenMP，一个实用的编程模型
基于比较的排序算法
扫描和链表算法
树算法
图算法,
例如,广度优先搜索

Unit 2: Distributed memory or network models

分布式内存或网络模型

In this model, the idea is that there is not one serial RAM, but many serial RAMs connected by a network. In this model, each serial RAM’s memory is private to the other RAMs; consequently, the processors must coordinate and communicate by sending and receiving messages.
在这种模型中，其思想是不存在一个串行 RAM，而是由一个网络连接多个串行 RAM。 在这种模型中，每个串行 RAM 的内存对其他 RAM 是私有的; 因此，处理器必须通过发送和接收消息来协调和通信。

Sub-topics include:

The basic algorithmic model Intro to the Message Passing Interface, a practical programming model Reasoning about the effects of network topology Dense linear algebra Sorting Sparse graph algorithms ** Graph partitioning

基本算法模型介绍了消息传递接口，一个实用的编程模型,讨论了网络拓扑对稠密线性代数排序、稀疏图算法**图划分的影响

Unit 3: Two-level memory or I/O models

两级内存或I/O模型

In this model, we return to a serial RAM, but instead of having only a processor connected to a main memory, there is a smaller but faster scratchpad memory in between the two. The algorithmic question here is how to use the scratchpad effectively, in order to minimize costly data transfers from main memory.
在这个模型中，我们返回到串行RAM，但不是只让一个处理器连接到主内存，而是在这两者之间有一个更小但更快的暂存器。这里的算法问题是如何有效地使用暂存板，以最小化来自主存的昂贵数据传输。

Sub-topics include:

Basic models Efficiency metrics, including “emerging” metrics like energy and power I/O-aware algorithms,Cache-oblivious algorithms
基本模型的效率指标，包括“新兴”指标，如能源和电力I/O感知算法,缓存无关算法