High Performance Computing

High Performance Computing

课程
en
英语
此内容评级为 0/5
来源
  • 来自www.udacity.com
状况
  • 自定进度
  • 免费获取
更多信息
  • 24 序列
  • 等级 介绍

Their employees are learning daily with Edflex

  • Safran
  • Air France
  • TotalEnergies
  • Generali
Learn more

课程详情

教学大纲

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.* Unit 1: The work-span or dynamic multithreading modelIn 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* Unit 2: Distributed memory or network modelsIn 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.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 modelsIn 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.Sub-topics include:** Basic models** Efficiency metrics, including “emerging” metrics like energy and power** I/O-aware algorithms** Cache-oblivious algorithms

先决条件

没有。

讲师

  • Rich Vuduc - Rich Vuduc an associate professor in the School of Computational Science and Engineering (CSE) atGeorgia Tech. His research is in the area of high-performance computing.This year, Professor Vuduc is also serving as both the Associate Chair of Academic Affairs in the School of CSE and as the Director of CSE Programs.Research: The HPC Garage [@hpcgarage].Professor Vuduc’s lab is developing automated tools and techniques to tune, to analyze, and to debug software for parallel machines, including emerging high-end multi/manycore architectures and accelerators. They focus on applying these methods to CSE applications, which include computer-based simulation of natural and engineered systems and data analysis.

编辑

佐治亚理工学院(Georgia Institute of Technology),又称佐治亚理工学院或 GT,是一所位于美国佐治亚州亚特兰大市的男女同校公立研究型大学。它是佐治亚大学系统网络的一部分。佐治亚理工学院在萨凡纳(美国佐治亚州)、梅斯(法国)、阿斯隆(爱尔兰)、上海(中国)和新加坡设有办事处。

佐治亚理工学院的工程和计算机科学课程在世界上名列前茅5,6 ,声誉卓著。此外,佐治亚理工学院还开设了科学、建筑、人文和管理课程。

平台

Udacity est une entreprise fondé par Sebastian Thrun, David Stavens, et Mike Sokolsky offrant cours en ligne ouvert et massif.

Selon Thrun, l'origine du nom Udacity vient de la volonté de l'entreprise d'être "audacieux pour vous, l'étudiant ". Bien que Udacity se concentrait à l'origine sur une offre de cours universitaires, la plateforme se concentre désormais plus sur de formations destinés aux professionnels.

此内容评级为 4.5/5
(没有评论)

您覺得這門課如何?

完成这个资源,写一篇评论