urfu poster on the russian supercomputing days conference

2
MultiGPU implementation of Graph500 supercomputer benchmark Parallel Computing Education in English Yet Another RussNet: A Large Open WordNet for Russian Made Using Crowdsourcing YARN (Yet Another RussNet), a project started in 2013, aims at creation of a large open WordNet-like thesaurus for Russian using crowdsourcing. The first stage of the project was to create noun synsets. Currently, the resource comprises of 100K+ word entries and 46K+ synsets. More than 200 people took part in synset assembling using our distributed annotation tools. The project is developed by joint efforts of researchers from IMM UB RAS, UrFU, HSE and SPbSU. Deliverables of YARN are available under the CC BY- SA license on the project website ( http://russianword.net/en/ ) in XML, CSV, and RDF formats. The documentation is hosted on NLPub: https://nlpub.ru/YARN . Since that the crowd-obtained data are noisy, we Graph500 benchmark is first attempt to rank supercomputers according to its ability to solve “data intensive” tasks, which characterized by the irregular memory access pattern and relatively small amount of computational operations. Kernel of Graph500 is parallel breadth-first search on Kronecker graph with power law degree distribution. Main obstacle to effectively parallelize breadth-first search for such type of graphs is workload imbalance across computational processes. To overcome this challenge, the method of workload balancing was developed. It’s move focus from parallelization of vertices array to parallelization of edges array. To get profit from using Nvidia GPU, MPI-OpenMP-CUDA parallelization scheme was developed. The single MPI process per node spawns multiple OpenMP threads. Each OpenMP thread manage the single GPGPU. Results of running our custom multiGPU Graph500 implementation for the case of 16 nodes and 128 GPUs presented on the Figure. More than two times speedup achieved for scale=30 (billion nodes graph) in comparison to replicated implementation (obtained from www.graph500.org ). Scale is logarithm base two of the number of vertices. Master Program in Computer Science A comprehensive and professionally-oriented computer science program that combines the foundations of computer science with the applied and in-demand skills. Students can focus on one of the following topics: High Performance Computing Computer Networks and Security System Software Development Duration: 2 years. Target audience: students with Bachalor’s degree in Computer Science or Software Engineering. 20 21 22 23 24 25 26 27 28 29 30 0 0.5 1 1.5 2 2.5 3 16 nodes / 128 GPUs replicated custom multiGPU Scale Traversal rate, GTEPS High Performance Computing Internship Short term internship program on parallel computing, which includes theoretical courses, practice, and projects. Duration: 1-3 months. Credits: 10-20 ECTS Target audience: Bachelor and Master students in Computer Science. Courses: Parallel Software Development, GPU Programming, Xeon Phi Programming, Application Performance Optimization, Introduction to Big Data technologies, Linux Operating System. Practice takes place at the High Performance Computing Center of UrFU. Examples of projects topics: heart modeling and simulation, distributed image processing, GPU graph processing. Contacts Andrej.Sozykin@ur fu.ru urfu.ru/en

Upload: andrey-sozykin

Post on 07-Apr-2017

317 views

Category:

Education


1 download

TRANSCRIPT

Page 1: UrFU poster on the Russian Supercomputing Days Conference

MultiGPU implementation of Graph500 supercomputer benchmark

Parallel Computing Education in English

Yet Another RussNet: A Large Open WordNet for Russian Made Using Crowdsourcing

YARN (Yet Another RussNet), a project started in 2013, aims at creation of a large open WordNet-like thesaurus for Russian using crowdsourcing. The first stage of the project was to create noun synsets. Currently, the resource comprises of 100K+ word entries and 46K+ synsets. More than 200 people took part in synset assembling using our distributed annotation tools.

The project is developed by joint efforts of researchers from IMM UB RAS, UrFU, HSE and SPbSU. Deliverables of YARN are available under the CC BY-SA license on the project website (http://russianword.net/en/) in XML, CSV, and RDF formats. The documentation is hosted on NLPub: https://nlpub.ru/YARN.

Since that the crowd-obtained data are noisy, we develop various adaptive crowdsourcing workflows and approaches for worker ranking, task allocation and answer aggregation: https://nlpub.ru/MTsar. The figure demonstrates the learning effect among top-5 workers: average time per synset tends to decrease while the editor proceeds through tasks.

Graph500 benchmark is first attempt to rank supercomputers according to its ability to solve “data intensive” tasks, which characterized by the irregular memory access pattern and relatively small amount of computational operations. Kernel of Graph500 is parallel breadth-first search on Kronecker graph with power law degree distribution.

Main obstacle to effectively parallelize breadth-first search for such type of graphs is workload imbalance across computational processes.

To overcome this challenge, the method of workload balancing was developed. It’s move focus from parallelization of vertices array to parallelization of edges array.

To get profit from using Nvidia GPU, MPI-OpenMP-CUDA parallelization scheme was developed. The single MPI process per node spawns multiple OpenMP threads. Each OpenMP thread manage the single GPGPU.

Results of running our custom multiGPU Graph500 implementation for the case of 16 nodes and 128 GPUs presented on the Figure. More than two times speedup achieved for scale=30 (billion nodes graph) in comparison to replicated implementation (obtained from www.graph500.org). Scale is logarithm base two of the number of vertices.

Master Program in Computer Science A comprehensive and professionally-

oriented computer science program that combines the foundations of computer science with the applied and in-demand skills. Students can focus on one of the following topics:• High Performance Computing• Computer Networks and Security• System Software DevelopmentDuration: 2 years.Target audience: students with Bachalor’s

degree in Computer Science or Software Engineering.

20 21 22 23 24 25 26 27 28 29 300

0.5

1

1.5

2

2.5

3

16 nodes / 128 GPUsreplicated custom multiGPU

Scale

Trav

ersa

l rat

e, G

TEPS

High Performance Computing InternshipShort term internship program on parallel

computing, which includes theoretical courses, practice, and projects.

Duration: 1-3 months.Credits: 10-20 ECTSTarget audience: Bachelor and Master

students in Computer Science.Courses: Parallel Software Development,

GPU Programming, Xeon Phi Programming, Application Performance Optimization, Introduction to Big Data technologies, Linux Operating System.

Practice takes place at the High Performance Computing Center of UrFU.

Examples of projects topics: heart modeling and simulation, distributed image processing, GPU graph processing.

[email protected]/en

Page 2: UrFU poster on the Russian Supercomputing Days Conference

Математическое моделирование и исследование решений NP-сложных задач составления расписаний в условиях больших данных (Big Data), разработка эффективных алгоритмов решения задач логистики на больших графах с использованием суперкомпьютеров

Построение и исследование методов решения обратных геофизических задач на сетках большой размерности, разработка эффективных параллельных алгоритмов решения задач с использованием суперкомпьютеров

Приз на международном суперкомпьютерном соревновании ASC 15 Student Supercomputer Challenge

С 18 по 22 мая 2015 г. в г. Тайюань, Китай, проводилось Международное суперкомпьютерное соревнование ASC 15 Student Supercomputer Challenge.

Первый приз «Серебрянный кубок» получила команда студентов и магистрантов кафедры Вычислительных методов и уравнений математической физики ИРИТ-РтФ УрФУ под руководством доктора физико-математических наук, ведущего научного сотрудника Института математики и механики УрО РАН Елены Николаевны Акимовой.

Команда Уральского федерального университета вошла в число 16 команд-победителей из 152 команд 135 университетов мира.

Исследуется задача составления расписания движения поездов для линейного участка железной дороги с однопутными перегонами. Задача состоит в том, чтобы организовать движение в обоих направлениях наиболее эффективным способом.

Оптимизация расписания позволяет увеличить пропускную способность маршрута при использовании одних и тех же физических ресурсов, а также позволяет моделировать различные варианты дальнейшей модернизации рассматриваемого участка.

Построен класс алгоритмов составления расписаний, дана оценка максимальной пропускной способности, составлена параллельная программа для моделирования.

Дамир Н. Гайнанов, президент компании «Дата-центр», к. т. н.

Антон В. Коныгин, к. ф.-м. н., н. с. ИММ УрО РАН

Елена Н. Акимова, д. ф.-м. н., в. н. с. ИММ УрО РАН

Олег А. Голубев,Илья Д. Колмогорцев,магистранты кафедры ВМиУМФ ИРИТ-РтФ УрФУ

Петр С. Мартышко,член-корр. РАН,профессор,зав. каф. ВМиУМФ ИРИТ-РТФ УрФУ

Елена Н. Акимова, д. ф.-м. н., доцент, проф. каф. ВМиУМФ

Владимир Е. Мисиловм. н. с. ИММ УрО РАН

Алия Ф. Скурыдина,аспирант каф. ВМиУМФ

Изучаются обратные задачи гравиметрии и магнитометрии в классе контактных поверхностей в рамках модели кусочно-однородной среды. Предложен новый подход к решению задачи о нахождении нескольких поверхностей раздела.

В рамках предложенного подхода построены эффективные методы и параллельные алгоритмы, реализованные на многоядерных и графических процессорах суперкомпьютера «Уран». Построены примеры практической интерпретации гравитационных данных.