generated from learning-process/parallel_programming_course
-
Notifications
You must be signed in to change notification settings - Fork 62
Папулина Юлия. Технология SEQ-MPI. Подсчет числа буквенных символов в строке. Вариант 22 #25
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
ulillli
wants to merge
34
commits into
learning-process:master
Choose a base branch
from
ulillli:papulina_y_count_of_letters
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. Подсчет числа буквенных символов в строке. Вариант 22 #25
ulillli
wants to merge
34
commits into
learning-process:master
from
ulillli:papulina_y_count_of_letters
+369
−2
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❌ Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #25 +/- ##
===========================================
+ Coverage 64.91% 94.52% +29.61%
===========================================
Files 15 17 +2
Lines 456 548 +92
Branches 166 210 +44
===========================================
+ Hits 296 518 +222
+ Misses 136 0 -136
- Partials 24 30 +6 ☔ 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.
Описание
Задача: Подсчет числа буквенных символов в строке
Вариант: 22
Технология: SEQ, MPI
Описание вашей реализации и отчёта.
Последовательная версия(SEQ): Итерируясь по строке, каждый символ проверяется на принадлежность к буквам (a-z, A-Z). При обнаружении буквы счетчик увеличивается на 1.
Параллельная версия(MPI): Входная строка равномерно распределяется между процессами. Если длина строки не кратна количеству процессов, остаточные символы отдаются последнему процессу. Каждый процесс подсчитывает количество букв в своей локальной части строки. Затем корневой процесс собирает и суммирует локальные результаты со всех процессов, получая общее количество букв в строке. Далее результат рассылается всем потокам.
Чек-лист
<фамилия>_<первая_буква_имени>_<короткое_название_задачи>clang-formatлокально в моем форке (нет ошибок форматирования)clang-tidyлокально в моем форке (нет предупреждений/ошибок)nesterov_a_vector_sum), а не вmaster