|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ИНХС РАН |
||
Studying the Structure of Parallel Algorithms as a Key Element of High-Performance Computing Educationстатья
Информация о цитировании статьи получена из
Scopus
Дата последнего поиска статьи во внешних источниках: 20 мая 2019 г.
- Авторы: Vladimir Voevodin, Alexander Antonov, Nina Popova
- Сборник: Euro-Par 2018: Parallel Processing Workshops
- Серия: Lecture Notes in Computer Science
- Том: 11339
- Год издания: 2019
- Издательство: Springer International Publishing AG
- Местоположение издательства: Cham, Switzerland
- Первая страница: 199
- Последняя страница: 210
- DOI: 10.1007/978-3-030-10549-5_16
- Аннотация: Since the computing world has become fully parallel, every software developer today should be familiar with the notion of “parallel algorithm structure.” If in recent years, students have studied a basic introduction to algorithms; today, parallel algorithm structure must become a vital part of computer science education. In this work we present two years of experience teaching a “Supercomputer Modeling and Technologies” course, and running practical assignments at the Computational Mathematics and Cybernetics faculty of Lomonosov Moscow State University, aimed at teaching students a methodology for analyzing parallel algorithm properties.
- Добавил в систему: Антонов Александр Сергеевич