并行计算期末考试模拟题原题.docVIP

Reviews on parallel programming并行计算 英文班复习 考试范围及题型：（1—10章） 1 基本概念解释；Translation (Chinese) 2 问答题。Questions and answer 3 算法的画图描述。Graphical description on algorithms 4 编程。Algorithms Reviews on parallel programming并行计算 1 基本概念解释；Translation (Chinese) SMP MPP Cluster of Workstation Parallelism, pipelining, Network topology, diameter of a network, Bisection width, data decomposition, task dependency graphs granularity concurrency process processor, linear array, mesh, hypercube, reduction, prefix-sum, gather, scatter, thread s, mutual exclusion shared address space, synchronization, the degree of concurrency, Dual of a communication operation, 2 问答题。Questions and answer Chapter 1 第1章 1) Why we need parallel computing? 1）为什么我们需要并行计算？ 答： 2) Please explain what are the main difference between parallel computing and sequential computing 2）解释并行计算与串行计算在算法设计中的主要不同点在那里？ 答： Chapter 2 第2章 1) What are SIMD, SPMD and MIMD denote? 1）解释SIMD, SPMD 和 MIMD是什么含义。 答： 2) Please draw a typical architecture of SIMD and a typical architecture of MIMD to explan. 2）请绘制一个典型的SIMD的体系结构和MIMD的架构。 答： 3) What are the two typical communication models of Parallel Platforms? You can give a short introduction on Massage Passing and Shared address space models. 3）并行平台的两个典型的通信模式是什么？你可以给一个简短的介绍信息传递和共享地址空间模型。 能说出Massage Passing和Shared address space models两种通讯模型。 答： 4) In the ideal parallel random access machine(PRAM), what are the meaning of EREW, CREW and CRCW? 4）在理想并行计算模型中（parallel random access machine(PRAM), EREW, CREW, 和CRCW表示的意思是什么？ 答： Chapter 3 第3章 1) Be able to explain at least 2 kinds of the basic decomposition techniques, i.e., Recursive decomposition, Data decomposition, Exploration decomposition and Speculative decomposition. 1）能够解释的基本的把问题分解技术，至少有2种，例如，递归分解，数据分解，探索分解和投机分解。 (1)递归分解， 如快速排序 (2)数据分解，矩阵乘法，矩阵与向量的乘法，按行或格网的数据划分。 (3)探索分解，人工智能中的状态空间的问题求解、如16数码问题。 (4)投机分解， 利用处理器大多数时间处于空闲的特点，把后面可以先计算的任务，提前计算出，在许多情况下会加速程序的运行。如对 case, if 语句的句子同时计算出来。 答： 2) When the work bala