generated from learning-process/parallel_programming_course
-
Notifications
You must be signed in to change notification settings - Fork 59
Сизов Дмитрий. Технология SEQ-MPI. Подсчет числа несовпадающих символов двух строк. Вариант 27 #24
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Open
SizovDmitry
wants to merge
99
commits into
learning-process:master
Choose a base branch
from
SizovDmitry:sizov_d_string_mismatch_count
base: master
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Сизов Дмитрий. Технология SEQ-MPI. Подсчет числа несовпадающих символов двух строк. Вариант 27 #24
SizovDmitry
wants to merge
99
commits into
learning-process:master
from
SizovDmitry:sizov_d_string_mismatch_count
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Codecov Report✅ All modified and coverable lines are covered by tests. Additional details and impacted files@@ Coverage Diff @@
## master #24 +/- ##
==========================================
+ Coverage 94.03% 94.62% +0.59%
==========================================
Files 15 17 +2
Lines 486 540 +54
Branches 181 200 +19
==========================================
+ Hits 457 511 +54
Partials 29 29 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Описание
В рамках данной задачи реализовано решение для определения количества несовпадающих символов в двух строках одинаковой длины.
SEQ:
Строки читаются целиком. Выполняется линейный проход от начала до конца: на каждой позиции символы сравниваются, и при несовпадении счётчик увеличивается.
MPI:
Обe строки разбиваются на фрагменты и распределяются между процессами. На основе вычисленных массивов counts и displs, каждому процессу передаётся только его подстрока. Каждый процесс выполняет локальный подсчет несовпадающих символов. Частичные результаты суммируются на корневом процессе и итоговое значение рассылается всем процессам.
Чек-лист
<фамилия>_<первая_буква_имени>_<короткое_название_задачи>(sizov_d_string_mismatch_count)clang-formatлокально в моем форке (нет ошибок форматирования)clang-tidyлокально в моем форке (нет предупреждений/ошибок)nesterov_a_vector_sum), а не вmaster