diff --git a/docs/common_information/introduction.rst b/docs/common_information/introduction.rst new file mode 100644 index 000000000..564176156 --- /dev/null +++ b/docs/common_information/introduction.rst @@ -0,0 +1,39 @@ +Introduction +============ + +Practice +~~~~~~~~ + +- We work online + + - Use GitHub repository + - Use Pull Requests + - Merge into the master branch + - Test verification + +- Task distribution is random for each student. +- An example for each technology can be found in the corresponding directory: ``tasks//example``. +- In each repository, the README.md contains a link to the course documentation (**read it fully!!!**). +- Additionally, each repository includes an example of a properly formatted PULL REQUEST. +- Submission of all tasks is mandatory to pass the course. +- A task that has been merged into the master branch continues to be monitored. + If a task fails in the master, it is disabled, and a record of this is added to the score table. All disabled tasks will result in a zero points result for those tasks at the end of the semester. +- All resources for using the repository will be provided here: + + - `Git for half an hour: A Beginner’s Guide `__ + - `Getting Started with Git and GitHub: A Beginner’s Guide `__ + - `Git: A Quick Start Guide to Using Core Operations with Explanations `__ + - `Conflicts resolving in Git `__ + - `Google testing framework (gtest) `__ + - `GoogleTest Primer `__ + - `GitHub Actions documentation `__ + - `Parallel Programming Technologies. Message Passing Interface (MPI) `__ + - `Typing and Layout in the System LaTeX `__ + - `LaTeX for the beginners `__ + - `What is OpenMP? `__ + - `TBB-1 `__ + - `Writing Multithreaded Applications in C++ `__ + - `Multithreading: New Features of the C++11 Standard `__ + - `Introduction to Parallel Computing `__ + +\* *All instructions, repositories, and tables may be updated during the learning process for better usability. Be prepared for changes, check and update them periodically!!!* diff --git a/docs/common_information/points.rst b/docs/common_information/points.rst new file mode 100644 index 000000000..b819fa8a9 --- /dev/null +++ b/docs/common_information/points.rst @@ -0,0 +1,120 @@ +Points +====== + +- For “process parallelism” semester + + - 1st MPI task + + ======== =========== + Solution Compilation + ======== =========== + 5 5 + ======== =========== + + - 2nd MPI task + + ======== =========== + Solution Performance + ======== =========== + 15 5 + ======== =========== + + - 3rd MPI task + + ======== =========== + Solution Performance + ======== =========== + 20 10 + ======== =========== + + - **Total : 60 points** + +- For “thread parallelism” semester + + - Sequential version + + ======== =========== + Solution Compilation + ======== =========== + 2 2 + ======== =========== + + - OpenMP version + + ======== =========== + Solution Performance + ======== =========== + 6 3 + ======== =========== + + - TBB version + + ======== =========== + Solution Performance + ======== =========== + 6 3 + ======== =========== + + - std::thread version + + ======== =========== + Solution Performance + ======== =========== + 8 6 + ======== =========== + + - “MPI + threads” version (The threading technology is chosen + randomly) + + ======== =========== + Solution Performance + ======== =========== + 10 8 + ======== =========== + + - **Total : 54 points** + +- Report + + +--------------+--------------+--------------------+-------+ + | Completeness | Text Quality | Formatting Quality | Total | + +=============================+====================+=======+ + | 5 | 2.5 | 2.5 | 10 | + +--------------+--------------+--------------------+-------+ + +- Conversion of points into exam assessment or pass/fail + + - For 5-point grading system + + ============ =============== ============ + Points range Exam Assessment Student Pass + ============ =============== ============ + [87, 100] 5 Passed + [70, 87) 4 Passed + [50, 70) 3 Passed + < 50 2 Not Passed + ============ =============== ============ + + - For 7-point grading system **(our current system)** + + ============ =============== ============ + Points range Exam Assessment Student Pass + ============ =============== ============ + [99, 100] 5.5 Passed + [92, 99) 5 Passed + [82, 92) 4.5 Passed + [70, 82) 4 Passed + [50, 70) 3 Passed + < 50 2 Not Passed + ============ =============== ============ + +- Penalties: + + - A deadline will be set for each version. + - 1 point is deducted from the version’s score for each day of delay in submission. + - The task is considered submitted when it is merged into the master/main branch. + - The submission time is defined as the timestamp of the last commit that successfully passes the CI pipeline. + +- Comments: + + - It is forbidden to write the report if all tasks are not completed. diff --git a/docs/common_information/processes_tasks.rst b/docs/common_information/processes_tasks.rst new file mode 100644 index 000000000..f3e20965a --- /dev/null +++ b/docs/common_information/processes_tasks.rst @@ -0,0 +1,279 @@ +Processes parallelism tasks +=========================== + +First task +---------- + ++----------------+---------------------------------------------------------------------------------+ +| Variant Number | Task | ++================+=================================================================================+ +| 1 | Sum of vector elements | ++----------------+---------------------------------------------------------------------------------+ +| 2 | Calculating the average value of vector elements | ++----------------+---------------------------------------------------------------------------------+ +| 3 | Maximum value of vector elements | ++----------------+---------------------------------------------------------------------------------+ +| 4 | Minimum value of vector elements | ++----------------+---------------------------------------------------------------------------------+ +| 5 | Finding the number of sign alternations between adjacent elements of the vector | ++----------------+---------------------------------------------------------------------------------+ +| 6 | Finding the number of order violations between adjacent elements of the vector | ++----------------+---------------------------------------------------------------------------------+ +| 7 | Finding the most similar adjacent elements of the vector | ++----------------+---------------------------------------------------------------------------------+ +| 8 | Finding the most different adjacent elements of the vector | ++----------------+---------------------------------------------------------------------------------+ +| 9 | Scalar product of vectors | ++----------------+---------------------------------------------------------------------------------+ +| 10 | Sum of matrix elements | ++----------------+---------------------------------------------------------------------------------+ +| 11 | Sum of values by rows in the matrix | ++----------------+---------------------------------------------------------------------------------+ +| 12 | Sum of values by columns in the matrix | ++----------------+---------------------------------------------------------------------------------+ +| 13 | Maximum value of matrix elements | ++----------------+---------------------------------------------------------------------------------+ +| 14 | Minimum value of matrix elements | ++----------------+---------------------------------------------------------------------------------+ +| 15 | Finding maximum values by rows in the matrix | ++----------------+---------------------------------------------------------------------------------+ +| 16 | Finding maximum values by columns in the matrix | ++----------------+---------------------------------------------------------------------------------+ +| 17 | Finding minimum values by rows in the matrix | ++----------------+---------------------------------------------------------------------------------+ +| 18 | Finding minimum values by columns in the matrix | ++----------------+---------------------------------------------------------------------------------+ +| 19 | Integration – rectangle method | ++----------------+---------------------------------------------------------------------------------+ +| 20 | Integration – trapezoidal method | ++----------------+---------------------------------------------------------------------------------+ +| 21 | Integration – Monte Carlo method | ++----------------+---------------------------------------------------------------------------------+ +| 22 | Counting the number of alphabetical characters in a string | ++----------------+---------------------------------------------------------------------------------+ +| 23 | Counting the frequency of a character in a string | ++----------------+---------------------------------------------------------------------------------+ +| 24 | Counting the number of words in a string | ++----------------+---------------------------------------------------------------------------------+ +| 25 | Counting the number of sentences in a string | ++----------------+---------------------------------------------------------------------------------+ +| 26 | Checking lexicographical order of two strings | ++----------------+---------------------------------------------------------------------------------+ +| 27 | Counting the number of differing characters between two strings | ++----------------+---------------------------------------------------------------------------------+ + +Second task +----------- + ++----------------+-------------------------------------------------------------------------------------+ +| Variant Number | Task | ++================+=====================================================================================+ +| 1 | Broadcast (one to all transfer) | ++----------------+-------------------------------------------------------------------------------------+ +| 2 | Reduce (all to one transfer) | ++----------------+-------------------------------------------------------------------------------------+ +| 3 | Allreduce (all to one and broadcast) | ++----------------+-------------------------------------------------------------------------------------+ +| 4 | Scatter (one to all transfer) | ++----------------+-------------------------------------------------------------------------------------+ +| 5 | Gather (all to one transfer) | ++----------------+-------------------------------------------------------------------------------------+ +| 6 | Line | ++----------------+-------------------------------------------------------------------------------------+ +| 7 | Ring | ++----------------+-------------------------------------------------------------------------------------+ +| 8 | Star | ++----------------+-------------------------------------------------------------------------------------+ +| 9 | Torus Grid | ++----------------+-------------------------------------------------------------------------------------+ +| 10 | Hypercube | ++----------------+-------------------------------------------------------------------------------------+ +| 11 | Horizontal strip scheme - matrix-vector multiplication | ++----------------+-------------------------------------------------------------------------------------+ +| 12 | Vertical strip scheme - matrix-vector multiplication | ++----------------+-------------------------------------------------------------------------------------+ +| 13 | Horizontal strip scheme – partitioning only matrix A - matrix-matrix multiplication | ++----------------+-------------------------------------------------------------------------------------+ +| 14 | Horizontal strip scheme A, vertical strip scheme B - matrix-matrix multiplication | ++----------------+-------------------------------------------------------------------------------------+ +| 15 | Gaussian method – horizontal strip scheme | ++----------------+-------------------------------------------------------------------------------------+ +| 16 | Gaussian method – vertical strip scheme | ++----------------+-------------------------------------------------------------------------------------+ +| 17 | Gauss-Jordan method | ++----------------+-------------------------------------------------------------------------------------+ +| 18 | Iterative methods (Jacobi) | ++----------------+-------------------------------------------------------------------------------------+ +| 19 | Iterative methods (Gauss-Seidel) | ++----------------+-------------------------------------------------------------------------------------+ +| 20 | Iterative methods (Simple) | ++----------------+-------------------------------------------------------------------------------------+ +| 21 | Bubble sort (odd-even transposition algorithm) | ++----------------+-------------------------------------------------------------------------------------+ +| 22 | Image smoothing | ++----------------+-------------------------------------------------------------------------------------+ +| 23 | Contrast enhancement | ++----------------+-------------------------------------------------------------------------------------+ + +Third task +---------- + ++----------------+----------------------------------------------------------------------------------------------------------+ +| Variant Number | Task | ++================+==========================================================================================================+ +| 1 | Dense matrix multiplication. Elements of data type double. Block scheme, Cannon's algorithm. | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 2 | Dense matrix multiplication. Elements of data type double. Block scheme, Fox's algorithm. | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 3 | Dense matrix multiplication. Elements of data type double. Strassen's algorithm. | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 4 | Sparse matrix multiplication. Elements of data type double. Matrix storage format – row format (CRS). | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 5 | Sparse matrix multiplication. Elements of data type double. Matrix storage format – column format (CCS). | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 6 | Solving systems of linear equations using the conjugate gradient method. | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 7 | Computing multidimensional integrals using a multistep scheme (rectangle method). | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 8 | Computing multidimensional integrals using a multistep scheme (trapezoidal method). | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 9 | Computing multidimensional integrals using a multistep scheme (Simpson's method). | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 10 | Computing multidimensional integrals using the Monte Carlo method. | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 11 | Global search algorithm (Strongin's) for one-dimensional optimization problems. Parallelization by | +| | characteristics. | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 12 | Multistep scheme for solving two-dimensional global optimization problems. Parallelization by dividing | +| | the search area. | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 13 | Multistep scheme for solving two-dimensional global optimization problems. Parallelization by | +| | characteristics. | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 14 | Quick sort with simple merging. | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 15 | Quick sort with odd-even merging (Batcher's method). | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 16 | Shell sort with simple merging. | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 17 | Shell sort with odd-even merging (Batcher's method). | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 18 | Radix sort for integers with simple merging. | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 19 | Radix sort for integers with odd-even merging (Batcher's method). | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 20 | Radix sort for floating-point numbers (type double) with simple merging. | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 21 | Radix sort for floating-point numbers (type double) with odd-even merging (Batcher's method). | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 22 | Shortest path search from one vertex (Dijkstra's algorithm). With CRS graphs. | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 23 | Shortest path search from one vertex (Bellman-Ford algorithm). With CRS graphs. | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 24 | Convex hull construction – Graham's scan. | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 25 | Convex hull construction – Jarvis's march. | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 26 | Linear image filtering (horizontal partition). Gaussian kernel 3x3. | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 27 | Linear image filtering (vertical partition). Gaussian kernel 3x3. | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 28 | Linear image filtering (block partition). Gaussian kernel 3x3. | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 29 | Edge detection in an image using the Sobel operator. | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 30 | Contrast enhancement of grayscale image using linear histogram stretching. | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 31 | Labeling components on a binary image (black areas correspond to objects, white to background). | ++----------------+----------------------------------------------------------------------------------------------------------+ +| 32 | Convex hull construction for components of a binary image. | ++----------------+----------------------------------------------------------------------------------------------------------+ + +Comments for tasks 2 and 3: +~~~~~~~~~~~~~~~~~~~~~~~~~~~ + +- MESSAGE PASSING METHODS “You need to implement the specified methods + using only the Send and Recv functions. The implemented function + should have the same prototype as the corresponding MPI function. The + test program should allow selecting the root process number and + perform array transmission (broadcast, gather) for at least the + following types: MPI_INT, MPI_FLOAT, MPI_DOUBLE. In all operations, + the transmission should be carried out using the ‘tree’ of processes.” + + Comments relevant for: + + =================== =================== + Variants for task 2 Variants for task 3 + =================== =================== + 1 - 5 x + =================== =================== + +- DATA COMMUNICATION NETWORK TOPOLOGIES “You need to implement the + virtual topology specified in the task using MPI capabilities for + working with communicators and topologies, and ensure the ability to + transfer data from any selected process to any other process. (Do not + use MPI_Cart_Create and MPI_Graph_Create)” + + Comments relevant for: + + =================== =================== + Varinats for task 2 Varinats for task 3 + =================== =================== + 6 - 10 x + =================== =================== + +- MATRIX COMPUTATIONS “In the horizontal scheme, the matrix is divided + among processes by rows. In the vertical scheme, it is divided by + columns, and in this case, the vector is also divided among + processes.” + + Comments relevant for: + + =================== =================== + Varinats for task 2 Varinats for task 3 + =================== =================== + 11 - 14 1 - 5 + =================== =================== + +- COMPUTER GRAPHICS AND IMAGE PROCESSING “It is assumed that the image + is given in color or grayscale, with the input data being a + one-dimensional array. Loading a real image is not required, but is + allowed.” + + Comments relevant for: + + =================== =================== + Varinats for task 2 Varinats for task 3 + =================== =================== + 26 - 27 24 - 32 + =================== =================== + +- SOLUTION OF A SYSTEM OF LINEAR ALGEBRAIC EQUATIONS + + Comments relevant for: + + =================== =================== + Varinats for task 2 Varinats for task 3 + =================== =================== + 15 - 20 6 + =================== =================== + +- SORT ALGORITHMS + + Comments relevant for: + + =================== =================== + Varinats for task 2 Varinats for task 3 + =================== =================== + 21 14 - 21 + =================== =================== + +- GRAPH PROCESSING ALGORITHMS + + Comments relevant for: + + =================== =================== + Varinats for task 2 Varinats for task 3 + =================== =================== + x 22 - 23 + =================== =================== diff --git a/docs/common_information/report.rst b/docs/common_information/report.rst new file mode 100644 index 000000000..3230db325 --- /dev/null +++ b/docs/common_information/report.rst @@ -0,0 +1,49 @@ +Report +====== + +- Report points + + +--------------+--------------+--------------------+-------+ + | Completeness | Text Quality | Formatting Quality | Total | + +==============+==============+====================+=======+ + | 5 | 2.5 | 2.5 | 10 | + +--------------+--------------+--------------------+-------+ + +- Requirements for Criteria + + - Presence and Completeness + + - Introduction (can be a short paragraph) + - Problem Statement (descriptive) + - Algorithm Description + - Description of the Parallel Algorithm Scheme + - Description of the MPI, OpenMP, TBB, std::threads, all versions (depending on the semester) – part of the software implementation description + - Experimental Results (execution time and algorithm quality assessment), description of correctness verification + - Conclusions from the Results + - Conclusion + - References + - Appendix (include code, ensuring readability) + + - Text Quality + + - Meaningfulness + - Coherence + - Clarity + - Quality of language (only the most obvious mistakes are considered) + + - Formatting Quality + + - Requirements for Headings + - Requirements for Text Alignment + - Requirements for Paragraph Indentation + - Requirements for the Formatting of Figures, Graphs, and Tables + - The “Teacher” field must include the full name, position, and title of the lecturer + +- Comments + + - Failure to meet the requirements will result in a deduction of points. + - The request will include points and comments regarding any requirement violations (if applicable). + - The report will be checked only once, and the grade will be assigned based on the submitted version according to the requirements. + - The report is reviewed online; the entire review process takes place in the request. + - If a student falls into the **blue zone** for the task, the report points will also be nullified at the end of the semester. + The report will be finally accepted and merged into the master branch only after both the **online** parts of the corresponding lab work are fully completed. diff --git a/docs/common_information/threading_tasks.rst b/docs/common_information/threading_tasks.rst new file mode 100644 index 000000000..03a85c67a --- /dev/null +++ b/docs/common_information/threading_tasks.rst @@ -0,0 +1,66 @@ +Thread parallelism tasks +======================== + ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| Variant Number | Tasks | ++================+===================================================================================================================================================+ +| 1 | Dense matrix multiplication. Elements of type double. Block scheme, Cannon's algorithm. | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 2 | Dense matrix multiplication. Elements of type double. Block scheme, Fox's algorithm. | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 3 | Dense matrix multiplication. Elements of type double. Strassen's algorithm. | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 4 | Sparse matrix multiplication. Elements of type double. Matrix storage format – row format (Compressed Row Storage). | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 5 | Sparse matrix multiplication. Elements of type double. Matrix storage format – column format (Compressed Column Storage). | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 6 | Sparse matrix multiplication. Complex type elements. Matrix storage format – row format (Compressed Row Storage). | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 7 | Sparse matrix multiplication. Complex type elements. Matrix storage format – column format (Compressed Column Storage). | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 8 | Solving systems of linear equations using the conjugate gradient method. | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 9 | Computing multidimensional integrals using a multistep scheme (rectangle method). | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 10 | Computing multidimensional integrals using a multistep scheme (trapezoidal method). | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 11 | Computing multidimensional integrals using a multistep scheme (Simpson's method). | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 12 | Computing multidimensional integrals using the Monte Carlo method. | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 13 | Quick sort with simple merging. | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 14 | Quick sort with odd-even merging (Batcher's method). | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 15 | Shell sort with simple merging. | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 16 | Shell sort with odd-even merging (Batcher's method). | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 17 | Radix sort for integers with simple merging. | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 18 | Radix sort for integers with odd-even merging (Batcher's method). | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 19 | Radix sort for floating-point numbers (type double) with simple merging. | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 20 | Radix sort for floating-point numbers (type double) with odd-even merging (Batcher's method). | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 21 | Shortest path search from one vertex (Dijkstra's algorithm). | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 22 | Convex hull construction – Graham's scan. | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 23 | Convex hull construction – Jarvis's march. | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 24 | Linear image filtering (horizontal partition). Gaussian kernel 3x3. | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 25 | Linear image filtering (vertical partition). Gaussian kernel 3x3. | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 26 | Linear image filtering (block partition). Gaussian kernel 3x3. | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 27 | Edge detection in an image using the Sobel operator. | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 28 | Contrast enhancement of grayscale image using linear histogram stretching. | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 29 | Labeling components on a binary image (black areas correspond to objects, white to background). | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 30 | Convex hull construction for components of a binary image. | ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ diff --git a/docs/index.rst b/docs/index.rst index b79ec282a..2d4e0d90c 100644 --- a/docs/index.rst +++ b/docs/index.rst @@ -12,3 +12,13 @@ Below is the table of contents for the Parallel Programming Course documentation user_guide/environment user_guide/submit_work user_guide/ci + +.. toctree:: + :maxdepth: 2 + :caption: Course Details: + + common_information/introduction + common_information/points + common_information/processes_tasks + common_information/report + common_information/threading_tasks diff --git a/docs/locale/en/LC_MESSAGES/common_information/introduction.po b/docs/locale/en/LC_MESSAGES/common_information/introduction.po new file mode 100644 index 000000000..04cc6f15f --- /dev/null +++ b/docs/locale/en/LC_MESSAGES/common_information/introduction.po @@ -0,0 +1,182 @@ +# SOME DESCRIPTIVE TITLE. +# Copyright (C) 2025, Learning Process +# This file is distributed under the same license as the Parallel +# Programming Course package. +# FIRST AUTHOR , 2025. +# +#, fuzzy +msgid "" +msgstr "" +"Project-Id-Version: Parallel Programming Course \n" +"Report-Msgid-Bugs-To: \n" +"POT-Creation-Date: 2025-02-05 13:29+0100\n" +"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" +"Last-Translator: FULL NAME \n" +"Language: en\n" +"Language-Team: en \n" +"Plural-Forms: nplurals=2; plural=(n != 1);\n" +"MIME-Version: 1.0\n" +"Content-Type: text/plain; charset=utf-8\n" +"Content-Transfer-Encoding: 8bit\n" +"Generated-By: Babel 2.17.0\n" + +#: ../../common_information/introduction.rst:2 +msgid "Introduction" +msgstr "" + +#: ../../common_information/introduction.rst:5 +msgid "Practice" +msgstr "" + +#: ../../common_information/introduction.rst:7 +msgid "We work online" +msgstr "" + +#: ../../common_information/introduction.rst:9 +msgid "Use GitHub repository" +msgstr "" + +#: ../../common_information/introduction.rst:10 +msgid "Use Pull Requests" +msgstr "" + +#: ../../common_information/introduction.rst:11 +msgid "Merge into the master branch" +msgstr "" + +#: ../../common_information/introduction.rst:12 +msgid "Test verification" +msgstr "" + +#: ../../common_information/introduction.rst:14 +msgid "Task distribution is random for each student." +msgstr "" + +#: ../../common_information/introduction.rst:15 +msgid "" +"An example for each technology can be found in the corresponding " +"directory: ``tasks//example``." +msgstr "" + +#: ../../common_information/introduction.rst:16 +msgid "" +"In each repository, the README.md contains a link to the course " +"documentation (**read it fully!!!**)." +msgstr "" + +#: ../../common_information/introduction.rst:17 +msgid "" +"Additionally, each repository includes an example of a properly formatted" +" PULL REQUEST." +msgstr "" + +#: ../../common_information/introduction.rst:18 +msgid "Submission of all tasks is mandatory to pass the course." +msgstr "" + +#: ../../common_information/introduction.rst:19 +msgid "" +"A task that has been merged into the master branch continues to be " +"monitored. If a task fails in the master, it is disabled, and a record of" +" this is added to the score table. All disabled tasks will result in a " +"zero points result for those tasks at the end of the semester." +msgstr "" + +#: ../../common_information/introduction.rst:21 +msgid "All resources for using the repository will be provided here:" +msgstr "" + +#: ../../common_information/introduction.rst:23 +msgid "" +"`Git for half an hour: A Beginner’s Guide `__" +msgstr "" + +#: ../../common_information/introduction.rst:24 +#, python-format +msgid "" +"`Getting Started with Git and GitHub: A Beginner’s Guide " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:25 +msgid "" +"`Git: A Quick Start Guide to Using Core Operations with Explanations " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:26 +msgid "" +"`Conflicts resolving in Git " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:27 +msgid "`Google testing framework (gtest) `__" +msgstr "" + +#: ../../common_information/introduction.rst:28 +msgid "" +"`GoogleTest Primer " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:29 +msgid "`GitHub Actions documentation `__" +msgstr "" + +#: ../../common_information/introduction.rst:30 +msgid "" +"`Parallel Programming Technologies. Message Passing Interface (MPI) " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:31 +msgid "" +"`Typing and Layout in the System LaTeX `__" +msgstr "" + +#: ../../common_information/introduction.rst:32 +msgid "" +"`LaTeX for the beginners " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:33 +msgid "`What is OpenMP? `__" +msgstr "" + +#: ../../common_information/introduction.rst:34 +msgid "" +"`TBB-1 " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:35 +msgid "" +"`Writing Multithreaded Applications in C++ `__" +msgstr "" + +#: ../../common_information/introduction.rst:36 +msgid "" +"`Multithreading: New Features of the C++11 Standard " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:37 +msgid "" +"`Introduction to Parallel Computing " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:39 +msgid "" +"\\* *All instructions, repositories, and tables may be updated during the" +" learning process for better usability. Be prepared for changes, check " +"and update them periodically!!!*" +msgstr "" + diff --git a/docs/locale/en/LC_MESSAGES/common_information/points.po b/docs/locale/en/LC_MESSAGES/common_information/points.po new file mode 100644 index 000000000..fdd130c96 --- /dev/null +++ b/docs/locale/en/LC_MESSAGES/common_information/points.po @@ -0,0 +1,290 @@ +# SOME DESCRIPTIVE TITLE. +# Copyright (C) 2025, Learning Process +# This file is distributed under the same license as the Parallel +# Programming Course package. +# FIRST AUTHOR , 2025. +# +#, fuzzy +msgid "" +msgstr "" +"Project-Id-Version: Parallel Programming Course \n" +"Report-Msgid-Bugs-To: \n" +"POT-Creation-Date: 2025-02-05 13:29+0100\n" +"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" +"Last-Translator: FULL NAME \n" +"Language: en\n" +"Language-Team: en \n" +"Plural-Forms: nplurals=2; plural=(n != 1);\n" +"MIME-Version: 1.0\n" +"Content-Type: text/plain; charset=utf-8\n" +"Content-Transfer-Encoding: 8bit\n" +"Generated-By: Babel 2.17.0\n" + +#: ../../common_information/points.rst:2 +msgid "Points" +msgstr "" + +#: ../../common_information/points.rst:4 +msgid "For “process parallelism” semester" +msgstr "" + +#: ../../common_information/points.rst:6 +msgid "1st MPI task" +msgstr "" + +#: ../../common_information/points.rst:9 ../../common_information/points.rst:17 +#: ../../common_information/points.rst:25 +#: ../../common_information/points.rst:37 +#: ../../common_information/points.rst:45 +#: ../../common_information/points.rst:53 +#: ../../common_information/points.rst:61 +#: ../../common_information/points.rst:70 +msgid "Solution" +msgstr "" + +#: ../../common_information/points.rst:9 ../../common_information/points.rst:37 +msgid "Compilation" +msgstr "" + +#: ../../common_information/points.rst:11 +#: ../../common_information/points.rst:19 +#: ../../common_information/points.rst:92 +#: ../../common_information/points.rst:104 +msgid "5" +msgstr "" + +#: ../../common_information/points.rst:14 +msgid "2nd MPI task" +msgstr "" + +#: ../../common_information/points.rst:17 +#: ../../common_information/points.rst:25 +#: ../../common_information/points.rst:45 +#: ../../common_information/points.rst:53 +#: ../../common_information/points.rst:61 +#: ../../common_information/points.rst:70 +msgid "Performance" +msgstr "" + +#: ../../common_information/points.rst:19 +msgid "15" +msgstr "" + +#: ../../common_information/points.rst:22 +msgid "3rd MPI task" +msgstr "" + +#: ../../common_information/points.rst:27 +msgid "20" +msgstr "" + +#: ../../common_information/points.rst:27 +#: ../../common_information/points.rst:72 +#: ../../common_information/points.rst:82 +msgid "10" +msgstr "" + +#: ../../common_information/points.rst:30 +msgid "**Total : 60 points**" +msgstr "" + +#: ../../common_information/points.rst:32 +msgid "For “thread parallelism” semester" +msgstr "" + +#: ../../common_information/points.rst:34 +msgid "Sequential version" +msgstr "" + +#: ../../common_information/points.rst:39 +#: ../../common_information/points.rst:95 +#: ../../common_information/points.rst:108 +msgid "2" +msgstr "" + +#: ../../common_information/points.rst:42 +msgid "OpenMP version" +msgstr "" + +#: ../../common_information/points.rst:47 +#: ../../common_information/points.rst:55 +#: ../../common_information/points.rst:63 +msgid "6" +msgstr "" + +#: ../../common_information/points.rst:47 +#: ../../common_information/points.rst:55 +#: ../../common_information/points.rst:94 +#: ../../common_information/points.rst:107 +msgid "3" +msgstr "" + +#: ../../common_information/points.rst:50 +msgid "TBB version" +msgstr "" + +#: ../../common_information/points.rst:58 +msgid "std::thread version" +msgstr "" + +#: ../../common_information/points.rst:63 +#: ../../common_information/points.rst:72 +msgid "8" +msgstr "" + +#: ../../common_information/points.rst:66 +msgid "“MPI + threads” version (The threading technology is chosen randomly)" +msgstr "" + +#: ../../common_information/points.rst:75 +msgid "**Total : 54 points**" +msgstr "" + +#: ../../common_information/points.rst:77 +msgid "Report" +msgstr "" + +#: ../../common_information/points.rst:80 +msgid "Completeness | Text Quality" +msgstr "" + +#: ../../common_information/points.rst:80 +msgid "Formatting Quality" +msgstr "" + +#: ../../common_information/points.rst:80 +msgid "Total" +msgstr "" + +#: ../../common_information/points.rst:82 +msgid "5 | 2.5" +msgstr "" + +#: ../../common_information/points.rst:82 +msgid "2.5" +msgstr "" + +#: ../../common_information/points.rst:85 +msgid "Conversion of points into exam assessment or pass/fail" +msgstr "" + +#: ../../common_information/points.rst:87 +msgid "For 5-point grading system" +msgstr "" + +#: ../../common_information/points.rst:90 +#: ../../common_information/points.rst:101 +msgid "Points range" +msgstr "" + +#: ../../common_information/points.rst:90 +#: ../../common_information/points.rst:101 +msgid "Exam Assessment" +msgstr "" + +#: ../../common_information/points.rst:90 +#: ../../common_information/points.rst:101 +msgid "Student Pass" +msgstr "" + +#: ../../common_information/points.rst:92 +msgid "[87, 100]" +msgstr "" + +#: ../../common_information/points.rst:92 +#: ../../common_information/points.rst:93 +#: ../../common_information/points.rst:94 +#: ../../common_information/points.rst:103 +#: ../../common_information/points.rst:104 +#: ../../common_information/points.rst:105 +#: ../../common_information/points.rst:106 +#: ../../common_information/points.rst:107 +msgid "Passed" +msgstr "" + +#: ../../common_information/points.rst:93 +msgid "[70, 87)" +msgstr "" + +#: ../../common_information/points.rst:93 +#: ../../common_information/points.rst:106 +msgid "4" +msgstr "" + +#: ../../common_information/points.rst:94 +#: ../../common_information/points.rst:107 +msgid "[50, 70)" +msgstr "" + +#: ../../common_information/points.rst:95 +#: ../../common_information/points.rst:108 +msgid "< 50" +msgstr "" + +#: ../../common_information/points.rst:95 +#: ../../common_information/points.rst:108 +msgid "Not Passed" +msgstr "" + +#: ../../common_information/points.rst:98 +msgid "For 7-point grading system **(our current system)**" +msgstr "" + +#: ../../common_information/points.rst:103 +msgid "[99, 100]" +msgstr "" + +#: ../../common_information/points.rst:103 +msgid "5.5" +msgstr "" + +#: ../../common_information/points.rst:104 +msgid "[92, 99)" +msgstr "" + +#: ../../common_information/points.rst:105 +msgid "[82, 92)" +msgstr "" + +#: ../../common_information/points.rst:105 +msgid "4.5" +msgstr "" + +#: ../../common_information/points.rst:106 +msgid "[70, 82)" +msgstr "" + +#: ../../common_information/points.rst:111 +msgid "Penalties:" +msgstr "" + +#: ../../common_information/points.rst:113 +msgid "A deadline will be set for each version." +msgstr "" + +#: ../../common_information/points.rst:114 +msgid "" +"1 point is deducted from the version’s score for each day of delay in " +"submission." +msgstr "" + +#: ../../common_information/points.rst:115 +msgid "" +"The task is considered submitted when it is merged into the master/main " +"branch." +msgstr "" + +#: ../../common_information/points.rst:116 +msgid "" +"The submission time is defined as the timestamp of the last commit that " +"successfully passes the CI pipeline." +msgstr "" + +#: ../../common_information/points.rst:118 +msgid "Comments:" +msgstr "" + +#: ../../common_information/points.rst:120 +msgid "It is forbidden to write the report if all tasks are not completed." +msgstr "" + diff --git a/docs/locale/en/LC_MESSAGES/common_information/processes_tasks.po b/docs/locale/en/LC_MESSAGES/common_information/processes_tasks.po new file mode 100644 index 000000000..2771f0cc6 --- /dev/null +++ b/docs/locale/en/LC_MESSAGES/common_information/processes_tasks.po @@ -0,0 +1,721 @@ +# SOME DESCRIPTIVE TITLE. +# Copyright (C) 2025, Learning Process +# This file is distributed under the same license as the Parallel +# Programming Course package. +# FIRST AUTHOR , 2025. +# +#, fuzzy +msgid "" +msgstr "" +"Project-Id-Version: Parallel Programming Course \n" +"Report-Msgid-Bugs-To: \n" +"POT-Creation-Date: 2025-02-05 13:29+0100\n" +"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" +"Last-Translator: FULL NAME \n" +"Language: en\n" +"Language-Team: en \n" +"Plural-Forms: nplurals=2; plural=(n != 1);\n" +"MIME-Version: 1.0\n" +"Content-Type: text/plain; charset=utf-8\n" +"Content-Transfer-Encoding: 8bit\n" +"Generated-By: Babel 2.17.0\n" + +#: ../../common_information/processes_tasks.rst:2 +msgid "Processes parallelism tasks" +msgstr "" + +#: ../../common_information/processes_tasks.rst:5 +msgid "First task" +msgstr "" + +#: ../../common_information/processes_tasks.rst:8 +#: ../../common_information/processes_tasks.rst:69 +#: ../../common_information/processes_tasks.rst:122 +msgid "Variant Number" +msgstr "" + +#: ../../common_information/processes_tasks.rst:8 +#: ../../common_information/processes_tasks.rst:69 +#: ../../common_information/processes_tasks.rst:122 +msgid "Task" +msgstr "" + +#: ../../common_information/processes_tasks.rst:10 +#: ../../common_information/processes_tasks.rst:71 +#: ../../common_information/processes_tasks.rst:124 +msgid "1" +msgstr "" + +#: ../../common_information/processes_tasks.rst:10 +msgid "Sum of vector elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:12 +#: ../../common_information/processes_tasks.rst:73 +#: ../../common_information/processes_tasks.rst:126 +msgid "2" +msgstr "" + +#: ../../common_information/processes_tasks.rst:12 +msgid "Calculating the average value of vector elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:14 +#: ../../common_information/processes_tasks.rst:75 +#: ../../common_information/processes_tasks.rst:128 +msgid "3" +msgstr "" + +#: ../../common_information/processes_tasks.rst:14 +msgid "Maximum value of vector elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:16 +#: ../../common_information/processes_tasks.rst:77 +#: ../../common_information/processes_tasks.rst:130 +msgid "4" +msgstr "" + +#: ../../common_information/processes_tasks.rst:16 +msgid "Minimum value of vector elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:18 +#: ../../common_information/processes_tasks.rst:79 +#: ../../common_information/processes_tasks.rst:132 +msgid "5" +msgstr "" + +#: ../../common_information/processes_tasks.rst:18 +msgid "" +"Finding the number of sign alternations between adjacent elements of the " +"vector" +msgstr "" + +#: ../../common_information/processes_tasks.rst:20 +#: ../../common_information/processes_tasks.rst:81 +#: ../../common_information/processes_tasks.rst:134 +#: ../../common_information/processes_tasks.rst:258 +msgid "6" +msgstr "" + +#: ../../common_information/processes_tasks.rst:20 +msgid "" +"Finding the number of order violations between adjacent elements of the " +"vector" +msgstr "" + +#: ../../common_information/processes_tasks.rst:22 +#: ../../common_information/processes_tasks.rst:83 +#: ../../common_information/processes_tasks.rst:136 +msgid "7" +msgstr "" + +#: ../../common_information/processes_tasks.rst:22 +msgid "Finding the most similar adjacent elements of the vector" +msgstr "" + +#: ../../common_information/processes_tasks.rst:24 +#: ../../common_information/processes_tasks.rst:85 +#: ../../common_information/processes_tasks.rst:138 +msgid "8" +msgstr "" + +#: ../../common_information/processes_tasks.rst:24 +msgid "Finding the most different adjacent elements of the vector" +msgstr "" + +#: ../../common_information/processes_tasks.rst:26 +#: ../../common_information/processes_tasks.rst:87 +#: ../../common_information/processes_tasks.rst:140 +msgid "9" +msgstr "" + +#: ../../common_information/processes_tasks.rst:26 +msgid "Scalar product of vectors" +msgstr "" + +#: ../../common_information/processes_tasks.rst:28 +#: ../../common_information/processes_tasks.rst:89 +#: ../../common_information/processes_tasks.rst:142 +msgid "10" +msgstr "" + +#: ../../common_information/processes_tasks.rst:28 +msgid "Sum of matrix elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:30 +#: ../../common_information/processes_tasks.rst:91 +#: ../../common_information/processes_tasks.rst:144 +msgid "11" +msgstr "" + +#: ../../common_information/processes_tasks.rst:30 +msgid "Sum of values by rows in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:32 +#: ../../common_information/processes_tasks.rst:93 +#: ../../common_information/processes_tasks.rst:147 +msgid "12" +msgstr "" + +#: ../../common_information/processes_tasks.rst:32 +msgid "Sum of values by columns in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:34 +#: ../../common_information/processes_tasks.rst:95 +#: ../../common_information/processes_tasks.rst:150 +msgid "13" +msgstr "" + +#: ../../common_information/processes_tasks.rst:34 +msgid "Maximum value of matrix elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:36 +#: ../../common_information/processes_tasks.rst:97 +#: ../../common_information/processes_tasks.rst:153 +msgid "14" +msgstr "" + +#: ../../common_information/processes_tasks.rst:36 +msgid "Minimum value of matrix elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:38 +#: ../../common_information/processes_tasks.rst:99 +#: ../../common_information/processes_tasks.rst:155 +msgid "15" +msgstr "" + +#: ../../common_information/processes_tasks.rst:38 +msgid "Finding maximum values by rows in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:40 +#: ../../common_information/processes_tasks.rst:101 +#: ../../common_information/processes_tasks.rst:157 +msgid "16" +msgstr "" + +#: ../../common_information/processes_tasks.rst:40 +msgid "Finding maximum values by columns in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:42 +#: ../../common_information/processes_tasks.rst:103 +#: ../../common_information/processes_tasks.rst:159 +msgid "17" +msgstr "" + +#: ../../common_information/processes_tasks.rst:42 +msgid "Finding minimum values by rows in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:44 +#: ../../common_information/processes_tasks.rst:105 +#: ../../common_information/processes_tasks.rst:161 +msgid "18" +msgstr "" + +#: ../../common_information/processes_tasks.rst:44 +msgid "Finding minimum values by columns in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:46 +#: ../../common_information/processes_tasks.rst:107 +#: ../../common_information/processes_tasks.rst:163 +msgid "19" +msgstr "" + +#: ../../common_information/processes_tasks.rst:46 +msgid "Integration – rectangle method" +msgstr "" + +#: ../../common_information/processes_tasks.rst:48 +#: ../../common_information/processes_tasks.rst:109 +#: ../../common_information/processes_tasks.rst:165 +msgid "20" +msgstr "" + +#: ../../common_information/processes_tasks.rst:48 +msgid "Integration – trapezoidal method" +msgstr "" + +#: ../../common_information/processes_tasks.rst:50 +#: ../../common_information/processes_tasks.rst:111 +#: ../../common_information/processes_tasks.rst:167 +#: ../../common_information/processes_tasks.rst:268 +msgid "21" +msgstr "" + +#: ../../common_information/processes_tasks.rst:50 +msgid "Integration – Monte Carlo method" +msgstr "" + +#: ../../common_information/processes_tasks.rst:52 +#: ../../common_information/processes_tasks.rst:113 +#: ../../common_information/processes_tasks.rst:169 +msgid "22" +msgstr "" + +#: ../../common_information/processes_tasks.rst:52 +msgid "Counting the number of alphabetical characters in a string" +msgstr "" + +#: ../../common_information/processes_tasks.rst:54 +#: ../../common_information/processes_tasks.rst:115 +#: ../../common_information/processes_tasks.rst:171 +msgid "23" +msgstr "" + +#: ../../common_information/processes_tasks.rst:54 +msgid "Counting the frequency of a character in a string" +msgstr "" + +#: ../../common_information/processes_tasks.rst:56 +#: ../../common_information/processes_tasks.rst:173 +msgid "24" +msgstr "" + +#: ../../common_information/processes_tasks.rst:56 +msgid "Counting the number of words in a string" +msgstr "" + +#: ../../common_information/processes_tasks.rst:58 +#: ../../common_information/processes_tasks.rst:175 +msgid "25" +msgstr "" + +#: ../../common_information/processes_tasks.rst:58 +msgid "Counting the number of sentences in a string" +msgstr "" + +#: ../../common_information/processes_tasks.rst:60 +#: ../../common_information/processes_tasks.rst:177 +msgid "26" +msgstr "" + +#: ../../common_information/processes_tasks.rst:60 +msgid "Checking lexicographical order of two strings" +msgstr "" + +#: ../../common_information/processes_tasks.rst:62 +#: ../../common_information/processes_tasks.rst:179 +msgid "27" +msgstr "" + +#: ../../common_information/processes_tasks.rst:62 +msgid "Counting the number of differing characters between two strings" +msgstr "" + +#: ../../common_information/processes_tasks.rst:66 +msgid "Second task" +msgstr "" + +#: ../../common_information/processes_tasks.rst:71 +msgid "Broadcast (one to all transfer)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:73 +msgid "Reduce (all to one transfer)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:75 +msgid "Allreduce (all to one and broadcast)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:77 +msgid "Scatter (one to all transfer)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:79 +msgid "Gather (all to one transfer)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:81 +msgid "Line" +msgstr "" + +#: ../../common_information/processes_tasks.rst:83 +msgid "Ring" +msgstr "" + +#: ../../common_information/processes_tasks.rst:85 +msgid "Star" +msgstr "" + +#: ../../common_information/processes_tasks.rst:87 +msgid "Torus Grid" +msgstr "" + +#: ../../common_information/processes_tasks.rst:89 +msgid "Hypercube" +msgstr "" + +#: ../../common_information/processes_tasks.rst:91 +msgid "Horizontal strip scheme - matrix-vector multiplication" +msgstr "" + +#: ../../common_information/processes_tasks.rst:93 +msgid "Vertical strip scheme - matrix-vector multiplication" +msgstr "" + +#: ../../common_information/processes_tasks.rst:95 +msgid "" +"Horizontal strip scheme – partitioning only matrix A - matrix-matrix " +"multiplication" +msgstr "" + +#: ../../common_information/processes_tasks.rst:97 +msgid "" +"Horizontal strip scheme A, vertical strip scheme B - matrix-matrix " +"multiplication" +msgstr "" + +#: ../../common_information/processes_tasks.rst:99 +msgid "Gaussian method – horizontal strip scheme" +msgstr "" + +#: ../../common_information/processes_tasks.rst:101 +msgid "Gaussian method – vertical strip scheme" +msgstr "" + +#: ../../common_information/processes_tasks.rst:103 +msgid "Gauss-Jordan method" +msgstr "" + +#: ../../common_information/processes_tasks.rst:105 +msgid "Iterative methods (Jacobi)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:107 +msgid "Iterative methods (Gauss-Seidel)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:109 +msgid "Iterative methods (Simple)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:111 +msgid "Bubble sort (odd-even transposition algorithm)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:113 +msgid "Image smoothing" +msgstr "" + +#: ../../common_information/processes_tasks.rst:115 +msgid "Contrast enhancement" +msgstr "" + +#: ../../common_information/processes_tasks.rst:119 +msgid "Third task" +msgstr "" + +#: ../../common_information/processes_tasks.rst:124 +msgid "" +"Dense matrix multiplication. Elements of data type double. Block scheme, " +"Cannon's algorithm." +msgstr "" + +#: ../../common_information/processes_tasks.rst:126 +msgid "" +"Dense matrix multiplication. Elements of data type double. Block scheme, " +"Fox's algorithm." +msgstr "" + +#: ../../common_information/processes_tasks.rst:128 +msgid "" +"Dense matrix multiplication. Elements of data type double. Strassen's " +"algorithm." +msgstr "" + +#: ../../common_information/processes_tasks.rst:130 +msgid "" +"Sparse matrix multiplication. Elements of data type double. Matrix " +"storage format – row format (CRS)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:132 +msgid "" +"Sparse matrix multiplication. Elements of data type double. Matrix " +"storage format – column format (CCS)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:134 +msgid "Solving systems of linear equations using the conjugate gradient method." +msgstr "" + +#: ../../common_information/processes_tasks.rst:136 +msgid "" +"Computing multidimensional integrals using a multistep scheme (rectangle " +"method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:138 +msgid "" +"Computing multidimensional integrals using a multistep scheme " +"(trapezoidal method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:140 +msgid "" +"Computing multidimensional integrals using a multistep scheme (Simpson's " +"method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:142 +msgid "Computing multidimensional integrals using the Monte Carlo method." +msgstr "" + +#: ../../common_information/processes_tasks.rst:144 +msgid "" +"Global search algorithm (Strongin's) for one-dimensional optimization " +"problems. Parallelization by characteristics." +msgstr "" + +#: ../../common_information/processes_tasks.rst:147 +msgid "" +"Multistep scheme for solving two-dimensional global optimization " +"problems. Parallelization by dividing the search area." +msgstr "" + +#: ../../common_information/processes_tasks.rst:150 +msgid "" +"Multistep scheme for solving two-dimensional global optimization " +"problems. Parallelization by characteristics." +msgstr "" + +#: ../../common_information/processes_tasks.rst:153 +msgid "Quick sort with simple merging." +msgstr "" + +#: ../../common_information/processes_tasks.rst:155 +msgid "Quick sort with odd-even merging (Batcher's method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:157 +msgid "Shell sort with simple merging." +msgstr "" + +#: ../../common_information/processes_tasks.rst:159 +msgid "Shell sort with odd-even merging (Batcher's method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:161 +msgid "Radix sort for integers with simple merging." +msgstr "" + +#: ../../common_information/processes_tasks.rst:163 +msgid "Radix sort for integers with odd-even merging (Batcher's method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:165 +msgid "Radix sort for floating-point numbers (type double) with simple merging." +msgstr "" + +#: ../../common_information/processes_tasks.rst:167 +msgid "" +"Radix sort for floating-point numbers (type double) with odd-even merging" +" (Batcher's method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:169 +msgid "" +"Shortest path search from one vertex (Dijkstra's algorithm). With CRS " +"graphs." +msgstr "" + +#: ../../common_information/processes_tasks.rst:171 +msgid "" +"Shortest path search from one vertex (Bellman-Ford algorithm). With CRS " +"graphs." +msgstr "" + +#: ../../common_information/processes_tasks.rst:173 +msgid "Convex hull construction – Graham's scan." +msgstr "" + +#: ../../common_information/processes_tasks.rst:175 +msgid "Convex hull construction – Jarvis's march." +msgstr "" + +#: ../../common_information/processes_tasks.rst:177 +msgid "Linear image filtering (horizontal partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/processes_tasks.rst:179 +msgid "Linear image filtering (vertical partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/processes_tasks.rst:181 +msgid "28" +msgstr "" + +#: ../../common_information/processes_tasks.rst:181 +msgid "Linear image filtering (block partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/processes_tasks.rst:183 +msgid "29" +msgstr "" + +#: ../../common_information/processes_tasks.rst:183 +msgid "Edge detection in an image using the Sobel operator." +msgstr "" + +#: ../../common_information/processes_tasks.rst:185 +msgid "30" +msgstr "" + +#: ../../common_information/processes_tasks.rst:185 +msgid "Contrast enhancement of grayscale image using linear histogram stretching." +msgstr "" + +#: ../../common_information/processes_tasks.rst:187 +msgid "31" +msgstr "" + +#: ../../common_information/processes_tasks.rst:187 +msgid "" +"Labeling components on a binary image (black areas correspond to objects," +" white to background)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:189 +msgid "32" +msgstr "" + +#: ../../common_information/processes_tasks.rst:189 +msgid "Convex hull construction for components of a binary image." +msgstr "" + +#: ../../common_information/processes_tasks.rst:193 +msgid "Comments for tasks 2 and 3:" +msgstr "" + +#: ../../common_information/processes_tasks.rst:195 +msgid "" +"MESSAGE PASSING METHODS “You need to implement the specified methods " +"using only the Send and Recv functions. The implemented function should " +"have the same prototype as the corresponding MPI function. The test " +"program should allow selecting the root process number and perform array " +"transmission (broadcast, gather) for at least the following types: " +"MPI_INT, MPI_FLOAT, MPI_DOUBLE. In all operations, the transmission " +"should be carried out using the ‘tree’ of processes.”" +msgstr "" + +#: ../../common_information/processes_tasks.rst:203 +#: ../../common_information/processes_tasks.rst:217 +#: ../../common_information/processes_tasks.rst:230 +#: ../../common_information/processes_tasks.rst:243 +#: ../../common_information/processes_tasks.rst:253 +#: ../../common_information/processes_tasks.rst:263 +#: ../../common_information/processes_tasks.rst:273 +msgid "Comments relevant for:" +msgstr "" + +#: ../../common_information/processes_tasks.rst:206 +msgid "Variants for task 2" +msgstr "" + +#: ../../common_information/processes_tasks.rst:206 +msgid "Variants for task 3" +msgstr "" + +#: ../../common_information/processes_tasks.rst:208 +#: ../../common_information/processes_tasks.rst:235 +msgid "1 - 5" +msgstr "" + +#: ../../common_information/processes_tasks.rst:208 +#: ../../common_information/processes_tasks.rst:222 +#: ../../common_information/processes_tasks.rst:278 +msgid "x" +msgstr "" + +#: ../../common_information/processes_tasks.rst:211 +msgid "" +"DATA COMMUNICATION NETWORK TOPOLOGIES “You need to implement the virtual " +"topology specified in the task using MPI capabilities for working with " +"communicators and topologies, and ensure the ability to transfer data " +"from any selected process to any other process. (Do not use " +"MPI_Cart_Create and MPI_Graph_Create)”" +msgstr "" + +#: ../../common_information/processes_tasks.rst:220 +#: ../../common_information/processes_tasks.rst:233 +#: ../../common_information/processes_tasks.rst:246 +#: ../../common_information/processes_tasks.rst:256 +#: ../../common_information/processes_tasks.rst:266 +#: ../../common_information/processes_tasks.rst:276 +msgid "Varinats for task 2" +msgstr "" + +#: ../../common_information/processes_tasks.rst:220 +#: ../../common_information/processes_tasks.rst:233 +#: ../../common_information/processes_tasks.rst:246 +#: ../../common_information/processes_tasks.rst:256 +#: ../../common_information/processes_tasks.rst:266 +#: ../../common_information/processes_tasks.rst:276 +msgid "Varinats for task 3" +msgstr "" + +#: ../../common_information/processes_tasks.rst:222 +msgid "6 - 10" +msgstr "" + +#: ../../common_information/processes_tasks.rst:225 +msgid "" +"MATRIX COMPUTATIONS “In the horizontal scheme, the matrix is divided " +"among processes by rows. In the vertical scheme, it is divided by " +"columns, and in this case, the vector is also divided among processes.”" +msgstr "" + +#: ../../common_information/processes_tasks.rst:235 +msgid "11 - 14" +msgstr "" + +#: ../../common_information/processes_tasks.rst:238 +msgid "" +"COMPUTER GRAPHICS AND IMAGE PROCESSING “It is assumed that the image is " +"given in color or grayscale, with the input data being a one-dimensional " +"array. Loading a real image is not required, but is allowed.”" +msgstr "" + +#: ../../common_information/processes_tasks.rst:248 +msgid "26 - 27" +msgstr "" + +#: ../../common_information/processes_tasks.rst:248 +msgid "24 - 32" +msgstr "" + +#: ../../common_information/processes_tasks.rst:251 +msgid "SOLUTION OF A SYSTEM OF LINEAR ALGEBRAIC EQUATIONS" +msgstr "" + +#: ../../common_information/processes_tasks.rst:258 +msgid "15 - 20" +msgstr "" + +#: ../../common_information/processes_tasks.rst:261 +msgid "SORT ALGORITHMS" +msgstr "" + +#: ../../common_information/processes_tasks.rst:268 +msgid "14 - 21" +msgstr "" + +#: ../../common_information/processes_tasks.rst:271 +msgid "GRAPH PROCESSING ALGORITHMS" +msgstr "" + +#: ../../common_information/processes_tasks.rst:278 +msgid "22 - 23" +msgstr "" + diff --git a/docs/locale/en/LC_MESSAGES/common_information/report.po b/docs/locale/en/LC_MESSAGES/common_information/report.po new file mode 100644 index 000000000..6e73b83a0 --- /dev/null +++ b/docs/locale/en/LC_MESSAGES/common_information/report.po @@ -0,0 +1,183 @@ +# SOME DESCRIPTIVE TITLE. +# Copyright (C) 2025, Learning Process +# This file is distributed under the same license as the Parallel +# Programming Course package. +# FIRST AUTHOR , 2025. +# +#, fuzzy +msgid "" +msgstr "" +"Project-Id-Version: Parallel Programming Course \n" +"Report-Msgid-Bugs-To: \n" +"POT-Creation-Date: 2025-02-05 13:29+0100\n" +"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" +"Last-Translator: FULL NAME \n" +"Language: en\n" +"Language-Team: en \n" +"Plural-Forms: nplurals=2; plural=(n != 1);\n" +"MIME-Version: 1.0\n" +"Content-Type: text/plain; charset=utf-8\n" +"Content-Transfer-Encoding: 8bit\n" +"Generated-By: Babel 2.17.0\n" + +#: ../../common_information/report.rst:2 +msgid "Report" +msgstr "" + +#: ../../common_information/report.rst:4 +msgid "Report points" +msgstr "" + +#: ../../common_information/report.rst:7 +msgid "Completeness" +msgstr "" + +#: ../../common_information/report.rst:7 ../../common_information/report.rst:27 +msgid "Text Quality" +msgstr "" + +#: ../../common_information/report.rst:7 ../../common_information/report.rst:34 +msgid "Formatting Quality" +msgstr "" + +#: ../../common_information/report.rst:7 +msgid "Total" +msgstr "" + +#: ../../common_information/report.rst:9 +msgid "5" +msgstr "" + +#: ../../common_information/report.rst:9 +msgid "2.5" +msgstr "" + +#: ../../common_information/report.rst:9 +msgid "10" +msgstr "" + +#: ../../common_information/report.rst:12 +msgid "Requirements for Criteria" +msgstr "" + +#: ../../common_information/report.rst:14 +msgid "Presence and Completeness" +msgstr "" + +#: ../../common_information/report.rst:16 +msgid "Introduction (can be a short paragraph)" +msgstr "" + +#: ../../common_information/report.rst:17 +msgid "Problem Statement (descriptive)" +msgstr "" + +#: ../../common_information/report.rst:18 +msgid "Algorithm Description" +msgstr "" + +#: ../../common_information/report.rst:19 +msgid "Description of the Parallel Algorithm Scheme" +msgstr "" + +#: ../../common_information/report.rst:20 +msgid "" +"Description of the MPI, OpenMP, TBB, std::threads, all versions " +"(depending on the semester) – part of the software implementation " +"description" +msgstr "" + +#: ../../common_information/report.rst:21 +msgid "" +"Experimental Results (execution time and algorithm quality assessment), " +"description of correctness verification" +msgstr "" + +#: ../../common_information/report.rst:22 +msgid "Conclusions from the Results" +msgstr "" + +#: ../../common_information/report.rst:23 +msgid "Conclusion" +msgstr "" + +#: ../../common_information/report.rst:24 +msgid "References" +msgstr "" + +#: ../../common_information/report.rst:25 +msgid "Appendix (include code, ensuring readability)" +msgstr "" + +#: ../../common_information/report.rst:29 +msgid "Meaningfulness" +msgstr "" + +#: ../../common_information/report.rst:30 +msgid "Coherence" +msgstr "" + +#: ../../common_information/report.rst:31 +msgid "Clarity" +msgstr "" + +#: ../../common_information/report.rst:32 +msgid "Quality of language (only the most obvious mistakes are considered)" +msgstr "" + +#: ../../common_information/report.rst:36 +msgid "Requirements for Headings" +msgstr "" + +#: ../../common_information/report.rst:37 +msgid "Requirements for Text Alignment" +msgstr "" + +#: ../../common_information/report.rst:38 +msgid "Requirements for Paragraph Indentation" +msgstr "" + +#: ../../common_information/report.rst:39 +msgid "Requirements for the Formatting of Figures, Graphs, and Tables" +msgstr "" + +#: ../../common_information/report.rst:40 +msgid "" +"The “Teacher” field must include the full name, position, and title of " +"the lecturer" +msgstr "" + +#: ../../common_information/report.rst:42 +msgid "Comments" +msgstr "" + +#: ../../common_information/report.rst:44 +msgid "Failure to meet the requirements will result in a deduction of points." +msgstr "" + +#: ../../common_information/report.rst:45 +msgid "" +"The request will include points and comments regarding any requirement " +"violations (if applicable)." +msgstr "" + +#: ../../common_information/report.rst:46 +msgid "" +"The report will be checked only once, and the grade will be assigned " +"based on the submitted version according to the requirements." +msgstr "" + +#: ../../common_information/report.rst:47 +msgid "" +"The report is reviewed online; the entire review process takes place in " +"the request." +msgstr "" + +#: ../../common_information/report.rst:48 +msgid "" +"If a student falls into the **blue zone** for the task, the report points" +" will also be nullified at the end of the semester. The report will be " +"finally accepted and merged into the master branch only after both the " +"**online** parts of the corresponding lab work are fully completed." +msgstr "" + diff --git a/docs/locale/en/LC_MESSAGES/common_information/threading_tasks.po b/docs/locale/en/LC_MESSAGES/common_information/threading_tasks.po new file mode 100644 index 000000000..8b4ecef8f --- /dev/null +++ b/docs/locale/en/LC_MESSAGES/common_information/threading_tasks.po @@ -0,0 +1,298 @@ +# SOME DESCRIPTIVE TITLE. +# Copyright (C) 2025, Learning Process +# This file is distributed under the same license as the Parallel +# Programming Course package. +# FIRST AUTHOR , 2025. +# +#, fuzzy +msgid "" +msgstr "" +"Project-Id-Version: Parallel Programming Course \n" +"Report-Msgid-Bugs-To: \n" +"POT-Creation-Date: 2025-02-05 13:29+0100\n" +"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" +"Last-Translator: FULL NAME \n" +"Language: en\n" +"Language-Team: en \n" +"Plural-Forms: nplurals=2; plural=(n != 1);\n" +"MIME-Version: 1.0\n" +"Content-Type: text/plain; charset=utf-8\n" +"Content-Transfer-Encoding: 8bit\n" +"Generated-By: Babel 2.17.0\n" + +#: ../../common_information/threading_tasks.rst:2 +msgid "Thread parallelism tasks" +msgstr "" + +#: ../../common_information/threading_tasks.rst:5 +msgid "Variant Number" +msgstr "" + +#: ../../common_information/threading_tasks.rst:5 +msgid "Tasks" +msgstr "" + +#: ../../common_information/threading_tasks.rst:7 +msgid "1" +msgstr "" + +#: ../../common_information/threading_tasks.rst:7 +msgid "" +"Dense matrix multiplication. Elements of type double. Block scheme, " +"Cannon's algorithm." +msgstr "" + +#: ../../common_information/threading_tasks.rst:9 +msgid "2" +msgstr "" + +#: ../../common_information/threading_tasks.rst:9 +msgid "" +"Dense matrix multiplication. Elements of type double. Block scheme, Fox's" +" algorithm." +msgstr "" + +#: ../../common_information/threading_tasks.rst:11 +msgid "3" +msgstr "" + +#: ../../common_information/threading_tasks.rst:11 +msgid "" +"Dense matrix multiplication. Elements of type double. Strassen's " +"algorithm." +msgstr "" + +#: ../../common_information/threading_tasks.rst:13 +msgid "4" +msgstr "" + +#: ../../common_information/threading_tasks.rst:13 +msgid "" +"Sparse matrix multiplication. Elements of type double. Matrix storage " +"format – row format (Compressed Row Storage)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:15 +msgid "5" +msgstr "" + +#: ../../common_information/threading_tasks.rst:15 +msgid "" +"Sparse matrix multiplication. Elements of type double. Matrix storage " +"format – column format (Compressed Column Storage)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:17 +msgid "6" +msgstr "" + +#: ../../common_information/threading_tasks.rst:17 +msgid "" +"Sparse matrix multiplication. Complex type elements. Matrix storage " +"format – row format (Compressed Row Storage)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:19 +msgid "7" +msgstr "" + +#: ../../common_information/threading_tasks.rst:19 +msgid "" +"Sparse matrix multiplication. Complex type elements. Matrix storage " +"format – column format (Compressed Column Storage)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:21 +msgid "8" +msgstr "" + +#: ../../common_information/threading_tasks.rst:21 +msgid "Solving systems of linear equations using the conjugate gradient method." +msgstr "" + +#: ../../common_information/threading_tasks.rst:23 +msgid "9" +msgstr "" + +#: ../../common_information/threading_tasks.rst:23 +msgid "" +"Computing multidimensional integrals using a multistep scheme (rectangle " +"method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:25 +msgid "10" +msgstr "" + +#: ../../common_information/threading_tasks.rst:25 +msgid "" +"Computing multidimensional integrals using a multistep scheme " +"(trapezoidal method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:27 +msgid "11" +msgstr "" + +#: ../../common_information/threading_tasks.rst:27 +msgid "" +"Computing multidimensional integrals using a multistep scheme (Simpson's " +"method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:29 +msgid "12" +msgstr "" + +#: ../../common_information/threading_tasks.rst:29 +msgid "Computing multidimensional integrals using the Monte Carlo method." +msgstr "" + +#: ../../common_information/threading_tasks.rst:31 +msgid "13" +msgstr "" + +#: ../../common_information/threading_tasks.rst:31 +msgid "Quick sort with simple merging." +msgstr "" + +#: ../../common_information/threading_tasks.rst:33 +msgid "14" +msgstr "" + +#: ../../common_information/threading_tasks.rst:33 +msgid "Quick sort with odd-even merging (Batcher's method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:35 +msgid "15" +msgstr "" + +#: ../../common_information/threading_tasks.rst:35 +msgid "Shell sort with simple merging." +msgstr "" + +#: ../../common_information/threading_tasks.rst:37 +msgid "16" +msgstr "" + +#: ../../common_information/threading_tasks.rst:37 +msgid "Shell sort with odd-even merging (Batcher's method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:39 +msgid "17" +msgstr "" + +#: ../../common_information/threading_tasks.rst:39 +msgid "Radix sort for integers with simple merging." +msgstr "" + +#: ../../common_information/threading_tasks.rst:41 +msgid "18" +msgstr "" + +#: ../../common_information/threading_tasks.rst:41 +msgid "Radix sort for integers with odd-even merging (Batcher's method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:43 +msgid "19" +msgstr "" + +#: ../../common_information/threading_tasks.rst:43 +msgid "Radix sort for floating-point numbers (type double) with simple merging." +msgstr "" + +#: ../../common_information/threading_tasks.rst:45 +msgid "20" +msgstr "" + +#: ../../common_information/threading_tasks.rst:45 +msgid "" +"Radix sort for floating-point numbers (type double) with odd-even merging" +" (Batcher's method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:47 +msgid "21" +msgstr "" + +#: ../../common_information/threading_tasks.rst:47 +msgid "Shortest path search from one vertex (Dijkstra's algorithm)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:49 +msgid "22" +msgstr "" + +#: ../../common_information/threading_tasks.rst:49 +msgid "Convex hull construction – Graham's scan." +msgstr "" + +#: ../../common_information/threading_tasks.rst:51 +msgid "23" +msgstr "" + +#: ../../common_information/threading_tasks.rst:51 +msgid "Convex hull construction – Jarvis's march." +msgstr "" + +#: ../../common_information/threading_tasks.rst:53 +msgid "24" +msgstr "" + +#: ../../common_information/threading_tasks.rst:53 +msgid "Linear image filtering (horizontal partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/threading_tasks.rst:55 +msgid "25" +msgstr "" + +#: ../../common_information/threading_tasks.rst:55 +msgid "Linear image filtering (vertical partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/threading_tasks.rst:57 +msgid "26" +msgstr "" + +#: ../../common_information/threading_tasks.rst:57 +msgid "Linear image filtering (block partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/threading_tasks.rst:59 +msgid "27" +msgstr "" + +#: ../../common_information/threading_tasks.rst:59 +msgid "Edge detection in an image using the Sobel operator." +msgstr "" + +#: ../../common_information/threading_tasks.rst:61 +msgid "28" +msgstr "" + +#: ../../common_information/threading_tasks.rst:61 +msgid "Contrast enhancement of grayscale image using linear histogram stretching." +msgstr "" + +#: ../../common_information/threading_tasks.rst:63 +msgid "29" +msgstr "" + +#: ../../common_information/threading_tasks.rst:63 +msgid "" +"Labeling components on a binary image (black areas correspond to objects," +" white to background)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:65 +msgid "30" +msgstr "" + +#: ../../common_information/threading_tasks.rst:65 +msgid "Convex hull construction for components of a binary image." +msgstr "" + diff --git a/docs/locale/en/LC_MESSAGES/index.po b/docs/locale/en/LC_MESSAGES/index.po index a6717f480..8e18a5578 100644 --- a/docs/locale/en/LC_MESSAGES/index.po +++ b/docs/locale/en/LC_MESSAGES/index.po @@ -9,7 +9,7 @@ msgid "" msgstr "" "Project-Id-Version: Parallel Programming Course \n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-01-20 23:19+0100\n" +"POT-Creation-Date: 2025-02-05 13:28+0100\n" "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" "Last-Translator: FULL NAME \n" "Language: en\n" @@ -18,12 +18,16 @@ msgstr "" "MIME-Version: 1.0\n" "Content-Type: text/plain; charset=utf-8\n" "Content-Transfer-Encoding: 8bit\n" -"Generated-By: Babel 2.16.0\n" +"Generated-By: Babel 2.17.0\n" #: ../../index.rst:6 msgid "User Guide:" msgstr "" +#: ../../index.rst:16 +msgid "Course Details:" +msgstr "" + #: ../../index.rst:2 msgid "Parallel Programming Course documentation" msgstr "" @@ -34,3 +38,6 @@ msgid "" "documentation. Follow the links to learn more about each topic." msgstr "" +#~ msgid "Common Information:" +#~ msgstr "" + diff --git a/docs/locale/ru/LC_MESSAGES/common_information/introduction.po b/docs/locale/ru/LC_MESSAGES/common_information/introduction.po new file mode 100644 index 000000000..dd836d0b6 --- /dev/null +++ b/docs/locale/ru/LC_MESSAGES/common_information/introduction.po @@ -0,0 +1,183 @@ +# SOME DESCRIPTIVE TITLE. +# Copyright (C) 2025, Learning Process +# This file is distributed under the same license as the Parallel +# Programming Course package. +# FIRST AUTHOR , 2025. +# +#, fuzzy +msgid "" +msgstr "" +"Project-Id-Version: Parallel Programming Course \n" +"Report-Msgid-Bugs-To: \n" +"POT-Creation-Date: 2025-02-05 13:29+0100\n" +"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" +"Last-Translator: FULL NAME \n" +"Language: ru\n" +"Language-Team: ru \n" +"Plural-Forms: nplurals=3; plural=(n%10==1 && n%100!=11 ? 0 : n%10>=2 && " +"n%10<=4 && (n%100<10 || n%100>=20) ? 1 : 2);\n" +"MIME-Version: 1.0\n" +"Content-Type: text/plain; charset=utf-8\n" +"Content-Transfer-Encoding: 8bit\n" +"Generated-By: Babel 2.17.0\n" + +#: ../../common_information/introduction.rst:2 +msgid "Introduction" +msgstr "" + +#: ../../common_information/introduction.rst:5 +msgid "Practice" +msgstr "" + +#: ../../common_information/introduction.rst:7 +msgid "We work online" +msgstr "" + +#: ../../common_information/introduction.rst:9 +msgid "Use GitHub repository" +msgstr "" + +#: ../../common_information/introduction.rst:10 +msgid "Use Pull Requests" +msgstr "" + +#: ../../common_information/introduction.rst:11 +msgid "Merge into the master branch" +msgstr "" + +#: ../../common_information/introduction.rst:12 +msgid "Test verification" +msgstr "" + +#: ../../common_information/introduction.rst:14 +msgid "Task distribution is random for each student." +msgstr "" + +#: ../../common_information/introduction.rst:15 +msgid "" +"An example for each technology can be found in the corresponding " +"directory: ``tasks//example``." +msgstr "" + +#: ../../common_information/introduction.rst:16 +msgid "" +"In each repository, the README.md contains a link to the course " +"documentation (**read it fully!!!**)." +msgstr "" + +#: ../../common_information/introduction.rst:17 +msgid "" +"Additionally, each repository includes an example of a properly formatted" +" PULL REQUEST." +msgstr "" + +#: ../../common_information/introduction.rst:18 +msgid "Submission of all tasks is mandatory to pass the course." +msgstr "" + +#: ../../common_information/introduction.rst:19 +msgid "" +"A task that has been merged into the master branch continues to be " +"monitored. If a task fails in the master, it is disabled, and a record of" +" this is added to the score table. All disabled tasks will result in a " +"zero points result for those tasks at the end of the semester." +msgstr "" + +#: ../../common_information/introduction.rst:21 +msgid "All resources for using the repository will be provided here:" +msgstr "" + +#: ../../common_information/introduction.rst:23 +msgid "" +"`Git for half an hour: A Beginner’s Guide `__" +msgstr "" + +#: ../../common_information/introduction.rst:24 +#, python-format +msgid "" +"`Getting Started with Git and GitHub: A Beginner’s Guide " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:25 +msgid "" +"`Git: A Quick Start Guide to Using Core Operations with Explanations " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:26 +msgid "" +"`Conflicts resolving in Git " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:27 +msgid "`Google testing framework (gtest) `__" +msgstr "" + +#: ../../common_information/introduction.rst:28 +msgid "" +"`GoogleTest Primer " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:29 +msgid "`GitHub Actions documentation `__" +msgstr "" + +#: ../../common_information/introduction.rst:30 +msgid "" +"`Parallel Programming Technologies. Message Passing Interface (MPI) " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:31 +msgid "" +"`Typing and Layout in the System LaTeX `__" +msgstr "" + +#: ../../common_information/introduction.rst:32 +msgid "" +"`LaTeX for the beginners " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:33 +msgid "`What is OpenMP? `__" +msgstr "" + +#: ../../common_information/introduction.rst:34 +msgid "" +"`TBB-1 " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:35 +msgid "" +"`Writing Multithreaded Applications in C++ `__" +msgstr "" + +#: ../../common_information/introduction.rst:36 +msgid "" +"`Multithreading: New Features of the C++11 Standard " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:37 +msgid "" +"`Introduction to Parallel Computing " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:39 +msgid "" +"\\* *All instructions, repositories, and tables may be updated during the" +" learning process for better usability. Be prepared for changes, check " +"and update them periodically!!!*" +msgstr "" + diff --git a/docs/locale/ru/LC_MESSAGES/common_information/points.po b/docs/locale/ru/LC_MESSAGES/common_information/points.po new file mode 100644 index 000000000..a3d6cdc37 --- /dev/null +++ b/docs/locale/ru/LC_MESSAGES/common_information/points.po @@ -0,0 +1,291 @@ +# SOME DESCRIPTIVE TITLE. +# Copyright (C) 2025, Learning Process +# This file is distributed under the same license as the Parallel +# Programming Course package. +# FIRST AUTHOR , 2025. +# +#, fuzzy +msgid "" +msgstr "" +"Project-Id-Version: Parallel Programming Course \n" +"Report-Msgid-Bugs-To: \n" +"POT-Creation-Date: 2025-02-05 13:29+0100\n" +"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" +"Last-Translator: FULL NAME \n" +"Language: ru\n" +"Language-Team: ru \n" +"Plural-Forms: nplurals=3; plural=(n%10==1 && n%100!=11 ? 0 : n%10>=2 && " +"n%10<=4 && (n%100<10 || n%100>=20) ? 1 : 2);\n" +"MIME-Version: 1.0\n" +"Content-Type: text/plain; charset=utf-8\n" +"Content-Transfer-Encoding: 8bit\n" +"Generated-By: Babel 2.17.0\n" + +#: ../../common_information/points.rst:2 +msgid "Points" +msgstr "" + +#: ../../common_information/points.rst:4 +msgid "For “process parallelism” semester" +msgstr "" + +#: ../../common_information/points.rst:6 +msgid "1st MPI task" +msgstr "" + +#: ../../common_information/points.rst:9 ../../common_information/points.rst:17 +#: ../../common_information/points.rst:25 +#: ../../common_information/points.rst:37 +#: ../../common_information/points.rst:45 +#: ../../common_information/points.rst:53 +#: ../../common_information/points.rst:61 +#: ../../common_information/points.rst:70 +msgid "Solution" +msgstr "" + +#: ../../common_information/points.rst:9 ../../common_information/points.rst:37 +msgid "Compilation" +msgstr "" + +#: ../../common_information/points.rst:11 +#: ../../common_information/points.rst:19 +#: ../../common_information/points.rst:92 +#: ../../common_information/points.rst:104 +msgid "5" +msgstr "" + +#: ../../common_information/points.rst:14 +msgid "2nd MPI task" +msgstr "" + +#: ../../common_information/points.rst:17 +#: ../../common_information/points.rst:25 +#: ../../common_information/points.rst:45 +#: ../../common_information/points.rst:53 +#: ../../common_information/points.rst:61 +#: ../../common_information/points.rst:70 +msgid "Performance" +msgstr "" + +#: ../../common_information/points.rst:19 +msgid "15" +msgstr "" + +#: ../../common_information/points.rst:22 +msgid "3rd MPI task" +msgstr "" + +#: ../../common_information/points.rst:27 +msgid "20" +msgstr "" + +#: ../../common_information/points.rst:27 +#: ../../common_information/points.rst:72 +#: ../../common_information/points.rst:82 +msgid "10" +msgstr "" + +#: ../../common_information/points.rst:30 +msgid "**Total : 60 points**" +msgstr "" + +#: ../../common_information/points.rst:32 +msgid "For “thread parallelism” semester" +msgstr "" + +#: ../../common_information/points.rst:34 +msgid "Sequential version" +msgstr "" + +#: ../../common_information/points.rst:39 +#: ../../common_information/points.rst:95 +#: ../../common_information/points.rst:108 +msgid "2" +msgstr "" + +#: ../../common_information/points.rst:42 +msgid "OpenMP version" +msgstr "" + +#: ../../common_information/points.rst:47 +#: ../../common_information/points.rst:55 +#: ../../common_information/points.rst:63 +msgid "6" +msgstr "" + +#: ../../common_information/points.rst:47 +#: ../../common_information/points.rst:55 +#: ../../common_information/points.rst:94 +#: ../../common_information/points.rst:107 +msgid "3" +msgstr "" + +#: ../../common_information/points.rst:50 +msgid "TBB version" +msgstr "" + +#: ../../common_information/points.rst:58 +msgid "std::thread version" +msgstr "" + +#: ../../common_information/points.rst:63 +#: ../../common_information/points.rst:72 +msgid "8" +msgstr "" + +#: ../../common_information/points.rst:66 +msgid "“MPI + threads” version (The threading technology is chosen randomly)" +msgstr "" + +#: ../../common_information/points.rst:75 +msgid "**Total : 54 points**" +msgstr "" + +#: ../../common_information/points.rst:77 +msgid "Report" +msgstr "" + +#: ../../common_information/points.rst:80 +msgid "Completeness | Text Quality" +msgstr "" + +#: ../../common_information/points.rst:80 +msgid "Formatting Quality" +msgstr "" + +#: ../../common_information/points.rst:80 +msgid "Total" +msgstr "" + +#: ../../common_information/points.rst:82 +msgid "5 | 2.5" +msgstr "" + +#: ../../common_information/points.rst:82 +msgid "2.5" +msgstr "" + +#: ../../common_information/points.rst:85 +msgid "Conversion of points into exam assessment or pass/fail" +msgstr "" + +#: ../../common_information/points.rst:87 +msgid "For 5-point grading system" +msgstr "" + +#: ../../common_information/points.rst:90 +#: ../../common_information/points.rst:101 +msgid "Points range" +msgstr "" + +#: ../../common_information/points.rst:90 +#: ../../common_information/points.rst:101 +msgid "Exam Assessment" +msgstr "" + +#: ../../common_information/points.rst:90 +#: ../../common_information/points.rst:101 +msgid "Student Pass" +msgstr "" + +#: ../../common_information/points.rst:92 +msgid "[87, 100]" +msgstr "" + +#: ../../common_information/points.rst:92 +#: ../../common_information/points.rst:93 +#: ../../common_information/points.rst:94 +#: ../../common_information/points.rst:103 +#: ../../common_information/points.rst:104 +#: ../../common_information/points.rst:105 +#: ../../common_information/points.rst:106 +#: ../../common_information/points.rst:107 +msgid "Passed" +msgstr "" + +#: ../../common_information/points.rst:93 +msgid "[70, 87)" +msgstr "" + +#: ../../common_information/points.rst:93 +#: ../../common_information/points.rst:106 +msgid "4" +msgstr "" + +#: ../../common_information/points.rst:94 +#: ../../common_information/points.rst:107 +msgid "[50, 70)" +msgstr "" + +#: ../../common_information/points.rst:95 +#: ../../common_information/points.rst:108 +msgid "< 50" +msgstr "" + +#: ../../common_information/points.rst:95 +#: ../../common_information/points.rst:108 +msgid "Not Passed" +msgstr "" + +#: ../../common_information/points.rst:98 +msgid "For 7-point grading system **(our current system)**" +msgstr "" + +#: ../../common_information/points.rst:103 +msgid "[99, 100]" +msgstr "" + +#: ../../common_information/points.rst:103 +msgid "5.5" +msgstr "" + +#: ../../common_information/points.rst:104 +msgid "[92, 99)" +msgstr "" + +#: ../../common_information/points.rst:105 +msgid "[82, 92)" +msgstr "" + +#: ../../common_information/points.rst:105 +msgid "4.5" +msgstr "" + +#: ../../common_information/points.rst:106 +msgid "[70, 82)" +msgstr "" + +#: ../../common_information/points.rst:111 +msgid "Penalties:" +msgstr "" + +#: ../../common_information/points.rst:113 +msgid "A deadline will be set for each version." +msgstr "" + +#: ../../common_information/points.rst:114 +msgid "" +"1 point is deducted from the version’s score for each day of delay in " +"submission." +msgstr "" + +#: ../../common_information/points.rst:115 +msgid "" +"The task is considered submitted when it is merged into the master/main " +"branch." +msgstr "" + +#: ../../common_information/points.rst:116 +msgid "" +"The submission time is defined as the timestamp of the last commit that " +"successfully passes the CI pipeline." +msgstr "" + +#: ../../common_information/points.rst:118 +msgid "Comments:" +msgstr "" + +#: ../../common_information/points.rst:120 +msgid "It is forbidden to write the report if all tasks are not completed." +msgstr "" + diff --git a/docs/locale/ru/LC_MESSAGES/common_information/processes_tasks.po b/docs/locale/ru/LC_MESSAGES/common_information/processes_tasks.po new file mode 100644 index 000000000..94401b366 --- /dev/null +++ b/docs/locale/ru/LC_MESSAGES/common_information/processes_tasks.po @@ -0,0 +1,722 @@ +# SOME DESCRIPTIVE TITLE. +# Copyright (C) 2025, Learning Process +# This file is distributed under the same license as the Parallel +# Programming Course package. +# FIRST AUTHOR , 2025. +# +#, fuzzy +msgid "" +msgstr "" +"Project-Id-Version: Parallel Programming Course \n" +"Report-Msgid-Bugs-To: \n" +"POT-Creation-Date: 2025-02-05 13:29+0100\n" +"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" +"Last-Translator: FULL NAME \n" +"Language: ru\n" +"Language-Team: ru \n" +"Plural-Forms: nplurals=3; plural=(n%10==1 && n%100!=11 ? 0 : n%10>=2 && " +"n%10<=4 && (n%100<10 || n%100>=20) ? 1 : 2);\n" +"MIME-Version: 1.0\n" +"Content-Type: text/plain; charset=utf-8\n" +"Content-Transfer-Encoding: 8bit\n" +"Generated-By: Babel 2.17.0\n" + +#: ../../common_information/processes_tasks.rst:2 +msgid "Processes parallelism tasks" +msgstr "" + +#: ../../common_information/processes_tasks.rst:5 +msgid "First task" +msgstr "" + +#: ../../common_information/processes_tasks.rst:8 +#: ../../common_information/processes_tasks.rst:69 +#: ../../common_information/processes_tasks.rst:122 +msgid "Variant Number" +msgstr "" + +#: ../../common_information/processes_tasks.rst:8 +#: ../../common_information/processes_tasks.rst:69 +#: ../../common_information/processes_tasks.rst:122 +msgid "Task" +msgstr "" + +#: ../../common_information/processes_tasks.rst:10 +#: ../../common_information/processes_tasks.rst:71 +#: ../../common_information/processes_tasks.rst:124 +msgid "1" +msgstr "" + +#: ../../common_information/processes_tasks.rst:10 +msgid "Sum of vector elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:12 +#: ../../common_information/processes_tasks.rst:73 +#: ../../common_information/processes_tasks.rst:126 +msgid "2" +msgstr "" + +#: ../../common_information/processes_tasks.rst:12 +msgid "Calculating the average value of vector elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:14 +#: ../../common_information/processes_tasks.rst:75 +#: ../../common_information/processes_tasks.rst:128 +msgid "3" +msgstr "" + +#: ../../common_information/processes_tasks.rst:14 +msgid "Maximum value of vector elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:16 +#: ../../common_information/processes_tasks.rst:77 +#: ../../common_information/processes_tasks.rst:130 +msgid "4" +msgstr "" + +#: ../../common_information/processes_tasks.rst:16 +msgid "Minimum value of vector elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:18 +#: ../../common_information/processes_tasks.rst:79 +#: ../../common_information/processes_tasks.rst:132 +msgid "5" +msgstr "" + +#: ../../common_information/processes_tasks.rst:18 +msgid "" +"Finding the number of sign alternations between adjacent elements of the " +"vector" +msgstr "" + +#: ../../common_information/processes_tasks.rst:20 +#: ../../common_information/processes_tasks.rst:81 +#: ../../common_information/processes_tasks.rst:134 +#: ../../common_information/processes_tasks.rst:258 +msgid "6" +msgstr "" + +#: ../../common_information/processes_tasks.rst:20 +msgid "" +"Finding the number of order violations between adjacent elements of the " +"vector" +msgstr "" + +#: ../../common_information/processes_tasks.rst:22 +#: ../../common_information/processes_tasks.rst:83 +#: ../../common_information/processes_tasks.rst:136 +msgid "7" +msgstr "" + +#: ../../common_information/processes_tasks.rst:22 +msgid "Finding the most similar adjacent elements of the vector" +msgstr "" + +#: ../../common_information/processes_tasks.rst:24 +#: ../../common_information/processes_tasks.rst:85 +#: ../../common_information/processes_tasks.rst:138 +msgid "8" +msgstr "" + +#: ../../common_information/processes_tasks.rst:24 +msgid "Finding the most different adjacent elements of the vector" +msgstr "" + +#: ../../common_information/processes_tasks.rst:26 +#: ../../common_information/processes_tasks.rst:87 +#: ../../common_information/processes_tasks.rst:140 +msgid "9" +msgstr "" + +#: ../../common_information/processes_tasks.rst:26 +msgid "Scalar product of vectors" +msgstr "" + +#: ../../common_information/processes_tasks.rst:28 +#: ../../common_information/processes_tasks.rst:89 +#: ../../common_information/processes_tasks.rst:142 +msgid "10" +msgstr "" + +#: ../../common_information/processes_tasks.rst:28 +msgid "Sum of matrix elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:30 +#: ../../common_information/processes_tasks.rst:91 +#: ../../common_information/processes_tasks.rst:144 +msgid "11" +msgstr "" + +#: ../../common_information/processes_tasks.rst:30 +msgid "Sum of values by rows in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:32 +#: ../../common_information/processes_tasks.rst:93 +#: ../../common_information/processes_tasks.rst:147 +msgid "12" +msgstr "" + +#: ../../common_information/processes_tasks.rst:32 +msgid "Sum of values by columns in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:34 +#: ../../common_information/processes_tasks.rst:95 +#: ../../common_information/processes_tasks.rst:150 +msgid "13" +msgstr "" + +#: ../../common_information/processes_tasks.rst:34 +msgid "Maximum value of matrix elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:36 +#: ../../common_information/processes_tasks.rst:97 +#: ../../common_information/processes_tasks.rst:153 +msgid "14" +msgstr "" + +#: ../../common_information/processes_tasks.rst:36 +msgid "Minimum value of matrix elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:38 +#: ../../common_information/processes_tasks.rst:99 +#: ../../common_information/processes_tasks.rst:155 +msgid "15" +msgstr "" + +#: ../../common_information/processes_tasks.rst:38 +msgid "Finding maximum values by rows in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:40 +#: ../../common_information/processes_tasks.rst:101 +#: ../../common_information/processes_tasks.rst:157 +msgid "16" +msgstr "" + +#: ../../common_information/processes_tasks.rst:40 +msgid "Finding maximum values by columns in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:42 +#: ../../common_information/processes_tasks.rst:103 +#: ../../common_information/processes_tasks.rst:159 +msgid "17" +msgstr "" + +#: ../../common_information/processes_tasks.rst:42 +msgid "Finding minimum values by rows in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:44 +#: ../../common_information/processes_tasks.rst:105 +#: ../../common_information/processes_tasks.rst:161 +msgid "18" +msgstr "" + +#: ../../common_information/processes_tasks.rst:44 +msgid "Finding minimum values by columns in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:46 +#: ../../common_information/processes_tasks.rst:107 +#: ../../common_information/processes_tasks.rst:163 +msgid "19" +msgstr "" + +#: ../../common_information/processes_tasks.rst:46 +msgid "Integration – rectangle method" +msgstr "" + +#: ../../common_information/processes_tasks.rst:48 +#: ../../common_information/processes_tasks.rst:109 +#: ../../common_information/processes_tasks.rst:165 +msgid "20" +msgstr "" + +#: ../../common_information/processes_tasks.rst:48 +msgid "Integration – trapezoidal method" +msgstr "" + +#: ../../common_information/processes_tasks.rst:50 +#: ../../common_information/processes_tasks.rst:111 +#: ../../common_information/processes_tasks.rst:167 +#: ../../common_information/processes_tasks.rst:268 +msgid "21" +msgstr "" + +#: ../../common_information/processes_tasks.rst:50 +msgid "Integration – Monte Carlo method" +msgstr "" + +#: ../../common_information/processes_tasks.rst:52 +#: ../../common_information/processes_tasks.rst:113 +#: ../../common_information/processes_tasks.rst:169 +msgid "22" +msgstr "" + +#: ../../common_information/processes_tasks.rst:52 +msgid "Counting the number of alphabetical characters in a string" +msgstr "" + +#: ../../common_information/processes_tasks.rst:54 +#: ../../common_information/processes_tasks.rst:115 +#: ../../common_information/processes_tasks.rst:171 +msgid "23" +msgstr "" + +#: ../../common_information/processes_tasks.rst:54 +msgid "Counting the frequency of a character in a string" +msgstr "" + +#: ../../common_information/processes_tasks.rst:56 +#: ../../common_information/processes_tasks.rst:173 +msgid "24" +msgstr "" + +#: ../../common_information/processes_tasks.rst:56 +msgid "Counting the number of words in a string" +msgstr "" + +#: ../../common_information/processes_tasks.rst:58 +#: ../../common_information/processes_tasks.rst:175 +msgid "25" +msgstr "" + +#: ../../common_information/processes_tasks.rst:58 +msgid "Counting the number of sentences in a string" +msgstr "" + +#: ../../common_information/processes_tasks.rst:60 +#: ../../common_information/processes_tasks.rst:177 +msgid "26" +msgstr "" + +#: ../../common_information/processes_tasks.rst:60 +msgid "Checking lexicographical order of two strings" +msgstr "" + +#: ../../common_information/processes_tasks.rst:62 +#: ../../common_information/processes_tasks.rst:179 +msgid "27" +msgstr "" + +#: ../../common_information/processes_tasks.rst:62 +msgid "Counting the number of differing characters between two strings" +msgstr "" + +#: ../../common_information/processes_tasks.rst:66 +msgid "Second task" +msgstr "" + +#: ../../common_information/processes_tasks.rst:71 +msgid "Broadcast (one to all transfer)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:73 +msgid "Reduce (all to one transfer)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:75 +msgid "Allreduce (all to one and broadcast)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:77 +msgid "Scatter (one to all transfer)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:79 +msgid "Gather (all to one transfer)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:81 +msgid "Line" +msgstr "" + +#: ../../common_information/processes_tasks.rst:83 +msgid "Ring" +msgstr "" + +#: ../../common_information/processes_tasks.rst:85 +msgid "Star" +msgstr "" + +#: ../../common_information/processes_tasks.rst:87 +msgid "Torus Grid" +msgstr "" + +#: ../../common_information/processes_tasks.rst:89 +msgid "Hypercube" +msgstr "" + +#: ../../common_information/processes_tasks.rst:91 +msgid "Horizontal strip scheme - matrix-vector multiplication" +msgstr "" + +#: ../../common_information/processes_tasks.rst:93 +msgid "Vertical strip scheme - matrix-vector multiplication" +msgstr "" + +#: ../../common_information/processes_tasks.rst:95 +msgid "" +"Horizontal strip scheme – partitioning only matrix A - matrix-matrix " +"multiplication" +msgstr "" + +#: ../../common_information/processes_tasks.rst:97 +msgid "" +"Horizontal strip scheme A, vertical strip scheme B - matrix-matrix " +"multiplication" +msgstr "" + +#: ../../common_information/processes_tasks.rst:99 +msgid "Gaussian method – horizontal strip scheme" +msgstr "" + +#: ../../common_information/processes_tasks.rst:101 +msgid "Gaussian method – vertical strip scheme" +msgstr "" + +#: ../../common_information/processes_tasks.rst:103 +msgid "Gauss-Jordan method" +msgstr "" + +#: ../../common_information/processes_tasks.rst:105 +msgid "Iterative methods (Jacobi)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:107 +msgid "Iterative methods (Gauss-Seidel)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:109 +msgid "Iterative methods (Simple)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:111 +msgid "Bubble sort (odd-even transposition algorithm)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:113 +msgid "Image smoothing" +msgstr "" + +#: ../../common_information/processes_tasks.rst:115 +msgid "Contrast enhancement" +msgstr "" + +#: ../../common_information/processes_tasks.rst:119 +msgid "Third task" +msgstr "" + +#: ../../common_information/processes_tasks.rst:124 +msgid "" +"Dense matrix multiplication. Elements of data type double. Block scheme, " +"Cannon's algorithm." +msgstr "" + +#: ../../common_information/processes_tasks.rst:126 +msgid "" +"Dense matrix multiplication. Elements of data type double. Block scheme, " +"Fox's algorithm." +msgstr "" + +#: ../../common_information/processes_tasks.rst:128 +msgid "" +"Dense matrix multiplication. Elements of data type double. Strassen's " +"algorithm." +msgstr "" + +#: ../../common_information/processes_tasks.rst:130 +msgid "" +"Sparse matrix multiplication. Elements of data type double. Matrix " +"storage format – row format (CRS)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:132 +msgid "" +"Sparse matrix multiplication. Elements of data type double. Matrix " +"storage format – column format (CCS)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:134 +msgid "Solving systems of linear equations using the conjugate gradient method." +msgstr "" + +#: ../../common_information/processes_tasks.rst:136 +msgid "" +"Computing multidimensional integrals using a multistep scheme (rectangle " +"method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:138 +msgid "" +"Computing multidimensional integrals using a multistep scheme " +"(trapezoidal method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:140 +msgid "" +"Computing multidimensional integrals using a multistep scheme (Simpson's " +"method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:142 +msgid "Computing multidimensional integrals using the Monte Carlo method." +msgstr "" + +#: ../../common_information/processes_tasks.rst:144 +msgid "" +"Global search algorithm (Strongin's) for one-dimensional optimization " +"problems. Parallelization by characteristics." +msgstr "" + +#: ../../common_information/processes_tasks.rst:147 +msgid "" +"Multistep scheme for solving two-dimensional global optimization " +"problems. Parallelization by dividing the search area." +msgstr "" + +#: ../../common_information/processes_tasks.rst:150 +msgid "" +"Multistep scheme for solving two-dimensional global optimization " +"problems. Parallelization by characteristics." +msgstr "" + +#: ../../common_information/processes_tasks.rst:153 +msgid "Quick sort with simple merging." +msgstr "" + +#: ../../common_information/processes_tasks.rst:155 +msgid "Quick sort with odd-even merging (Batcher's method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:157 +msgid "Shell sort with simple merging." +msgstr "" + +#: ../../common_information/processes_tasks.rst:159 +msgid "Shell sort with odd-even merging (Batcher's method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:161 +msgid "Radix sort for integers with simple merging." +msgstr "" + +#: ../../common_information/processes_tasks.rst:163 +msgid "Radix sort for integers with odd-even merging (Batcher's method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:165 +msgid "Radix sort for floating-point numbers (type double) with simple merging." +msgstr "" + +#: ../../common_information/processes_tasks.rst:167 +msgid "" +"Radix sort for floating-point numbers (type double) with odd-even merging" +" (Batcher's method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:169 +msgid "" +"Shortest path search from one vertex (Dijkstra's algorithm). With CRS " +"graphs." +msgstr "" + +#: ../../common_information/processes_tasks.rst:171 +msgid "" +"Shortest path search from one vertex (Bellman-Ford algorithm). With CRS " +"graphs." +msgstr "" + +#: ../../common_information/processes_tasks.rst:173 +msgid "Convex hull construction – Graham's scan." +msgstr "" + +#: ../../common_information/processes_tasks.rst:175 +msgid "Convex hull construction – Jarvis's march." +msgstr "" + +#: ../../common_information/processes_tasks.rst:177 +msgid "Linear image filtering (horizontal partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/processes_tasks.rst:179 +msgid "Linear image filtering (vertical partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/processes_tasks.rst:181 +msgid "28" +msgstr "" + +#: ../../common_information/processes_tasks.rst:181 +msgid "Linear image filtering (block partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/processes_tasks.rst:183 +msgid "29" +msgstr "" + +#: ../../common_information/processes_tasks.rst:183 +msgid "Edge detection in an image using the Sobel operator." +msgstr "" + +#: ../../common_information/processes_tasks.rst:185 +msgid "30" +msgstr "" + +#: ../../common_information/processes_tasks.rst:185 +msgid "Contrast enhancement of grayscale image using linear histogram stretching." +msgstr "" + +#: ../../common_information/processes_tasks.rst:187 +msgid "31" +msgstr "" + +#: ../../common_information/processes_tasks.rst:187 +msgid "" +"Labeling components on a binary image (black areas correspond to objects," +" white to background)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:189 +msgid "32" +msgstr "" + +#: ../../common_information/processes_tasks.rst:189 +msgid "Convex hull construction for components of a binary image." +msgstr "" + +#: ../../common_information/processes_tasks.rst:193 +msgid "Comments for tasks 2 and 3:" +msgstr "" + +#: ../../common_information/processes_tasks.rst:195 +msgid "" +"MESSAGE PASSING METHODS “You need to implement the specified methods " +"using only the Send and Recv functions. The implemented function should " +"have the same prototype as the corresponding MPI function. The test " +"program should allow selecting the root process number and perform array " +"transmission (broadcast, gather) for at least the following types: " +"MPI_INT, MPI_FLOAT, MPI_DOUBLE. In all operations, the transmission " +"should be carried out using the ‘tree’ of processes.”" +msgstr "" + +#: ../../common_information/processes_tasks.rst:203 +#: ../../common_information/processes_tasks.rst:217 +#: ../../common_information/processes_tasks.rst:230 +#: ../../common_information/processes_tasks.rst:243 +#: ../../common_information/processes_tasks.rst:253 +#: ../../common_information/processes_tasks.rst:263 +#: ../../common_information/processes_tasks.rst:273 +msgid "Comments relevant for:" +msgstr "" + +#: ../../common_information/processes_tasks.rst:206 +msgid "Variants for task 2" +msgstr "" + +#: ../../common_information/processes_tasks.rst:206 +msgid "Variants for task 3" +msgstr "" + +#: ../../common_information/processes_tasks.rst:208 +#: ../../common_information/processes_tasks.rst:235 +msgid "1 - 5" +msgstr "" + +#: ../../common_information/processes_tasks.rst:208 +#: ../../common_information/processes_tasks.rst:222 +#: ../../common_information/processes_tasks.rst:278 +msgid "x" +msgstr "" + +#: ../../common_information/processes_tasks.rst:211 +msgid "" +"DATA COMMUNICATION NETWORK TOPOLOGIES “You need to implement the virtual " +"topology specified in the task using MPI capabilities for working with " +"communicators and topologies, and ensure the ability to transfer data " +"from any selected process to any other process. (Do not use " +"MPI_Cart_Create and MPI_Graph_Create)”" +msgstr "" + +#: ../../common_information/processes_tasks.rst:220 +#: ../../common_information/processes_tasks.rst:233 +#: ../../common_information/processes_tasks.rst:246 +#: ../../common_information/processes_tasks.rst:256 +#: ../../common_information/processes_tasks.rst:266 +#: ../../common_information/processes_tasks.rst:276 +msgid "Varinats for task 2" +msgstr "" + +#: ../../common_information/processes_tasks.rst:220 +#: ../../common_information/processes_tasks.rst:233 +#: ../../common_information/processes_tasks.rst:246 +#: ../../common_information/processes_tasks.rst:256 +#: ../../common_information/processes_tasks.rst:266 +#: ../../common_information/processes_tasks.rst:276 +msgid "Varinats for task 3" +msgstr "" + +#: ../../common_information/processes_tasks.rst:222 +msgid "6 - 10" +msgstr "" + +#: ../../common_information/processes_tasks.rst:225 +msgid "" +"MATRIX COMPUTATIONS “In the horizontal scheme, the matrix is divided " +"among processes by rows. In the vertical scheme, it is divided by " +"columns, and in this case, the vector is also divided among processes.”" +msgstr "" + +#: ../../common_information/processes_tasks.rst:235 +msgid "11 - 14" +msgstr "" + +#: ../../common_information/processes_tasks.rst:238 +msgid "" +"COMPUTER GRAPHICS AND IMAGE PROCESSING “It is assumed that the image is " +"given in color or grayscale, with the input data being a one-dimensional " +"array. Loading a real image is not required, but is allowed.”" +msgstr "" + +#: ../../common_information/processes_tasks.rst:248 +msgid "26 - 27" +msgstr "" + +#: ../../common_information/processes_tasks.rst:248 +msgid "24 - 32" +msgstr "" + +#: ../../common_information/processes_tasks.rst:251 +msgid "SOLUTION OF A SYSTEM OF LINEAR ALGEBRAIC EQUATIONS" +msgstr "" + +#: ../../common_information/processes_tasks.rst:258 +msgid "15 - 20" +msgstr "" + +#: ../../common_information/processes_tasks.rst:261 +msgid "SORT ALGORITHMS" +msgstr "" + +#: ../../common_information/processes_tasks.rst:268 +msgid "14 - 21" +msgstr "" + +#: ../../common_information/processes_tasks.rst:271 +msgid "GRAPH PROCESSING ALGORITHMS" +msgstr "" + +#: ../../common_information/processes_tasks.rst:278 +msgid "22 - 23" +msgstr "" + diff --git a/docs/locale/ru/LC_MESSAGES/common_information/report.po b/docs/locale/ru/LC_MESSAGES/common_information/report.po new file mode 100644 index 000000000..8ee85a5b4 --- /dev/null +++ b/docs/locale/ru/LC_MESSAGES/common_information/report.po @@ -0,0 +1,184 @@ +# SOME DESCRIPTIVE TITLE. +# Copyright (C) 2025, Learning Process +# This file is distributed under the same license as the Parallel +# Programming Course package. +# FIRST AUTHOR , 2025. +# +#, fuzzy +msgid "" +msgstr "" +"Project-Id-Version: Parallel Programming Course \n" +"Report-Msgid-Bugs-To: \n" +"POT-Creation-Date: 2025-02-05 13:29+0100\n" +"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" +"Last-Translator: FULL NAME \n" +"Language: ru\n" +"Language-Team: ru \n" +"Plural-Forms: nplurals=3; plural=(n%10==1 && n%100!=11 ? 0 : n%10>=2 && " +"n%10<=4 && (n%100<10 || n%100>=20) ? 1 : 2);\n" +"MIME-Version: 1.0\n" +"Content-Type: text/plain; charset=utf-8\n" +"Content-Transfer-Encoding: 8bit\n" +"Generated-By: Babel 2.17.0\n" + +#: ../../common_information/report.rst:2 +msgid "Report" +msgstr "" + +#: ../../common_information/report.rst:4 +msgid "Report points" +msgstr "" + +#: ../../common_information/report.rst:7 +msgid "Completeness" +msgstr "" + +#: ../../common_information/report.rst:7 ../../common_information/report.rst:27 +msgid "Text Quality" +msgstr "" + +#: ../../common_information/report.rst:7 ../../common_information/report.rst:34 +msgid "Formatting Quality" +msgstr "" + +#: ../../common_information/report.rst:7 +msgid "Total" +msgstr "" + +#: ../../common_information/report.rst:9 +msgid "5" +msgstr "" + +#: ../../common_information/report.rst:9 +msgid "2.5" +msgstr "" + +#: ../../common_information/report.rst:9 +msgid "10" +msgstr "" + +#: ../../common_information/report.rst:12 +msgid "Requirements for Criteria" +msgstr "" + +#: ../../common_information/report.rst:14 +msgid "Presence and Completeness" +msgstr "" + +#: ../../common_information/report.rst:16 +msgid "Introduction (can be a short paragraph)" +msgstr "" + +#: ../../common_information/report.rst:17 +msgid "Problem Statement (descriptive)" +msgstr "" + +#: ../../common_information/report.rst:18 +msgid "Algorithm Description" +msgstr "" + +#: ../../common_information/report.rst:19 +msgid "Description of the Parallel Algorithm Scheme" +msgstr "" + +#: ../../common_information/report.rst:20 +msgid "" +"Description of the MPI, OpenMP, TBB, std::threads, all versions " +"(depending on the semester) – part of the software implementation " +"description" +msgstr "" + +#: ../../common_information/report.rst:21 +msgid "" +"Experimental Results (execution time and algorithm quality assessment), " +"description of correctness verification" +msgstr "" + +#: ../../common_information/report.rst:22 +msgid "Conclusions from the Results" +msgstr "" + +#: ../../common_information/report.rst:23 +msgid "Conclusion" +msgstr "" + +#: ../../common_information/report.rst:24 +msgid "References" +msgstr "" + +#: ../../common_information/report.rst:25 +msgid "Appendix (include code, ensuring readability)" +msgstr "" + +#: ../../common_information/report.rst:29 +msgid "Meaningfulness" +msgstr "" + +#: ../../common_information/report.rst:30 +msgid "Coherence" +msgstr "" + +#: ../../common_information/report.rst:31 +msgid "Clarity" +msgstr "" + +#: ../../common_information/report.rst:32 +msgid "Quality of language (only the most obvious mistakes are considered)" +msgstr "" + +#: ../../common_information/report.rst:36 +msgid "Requirements for Headings" +msgstr "" + +#: ../../common_information/report.rst:37 +msgid "Requirements for Text Alignment" +msgstr "" + +#: ../../common_information/report.rst:38 +msgid "Requirements for Paragraph Indentation" +msgstr "" + +#: ../../common_information/report.rst:39 +msgid "Requirements for the Formatting of Figures, Graphs, and Tables" +msgstr "" + +#: ../../common_information/report.rst:40 +msgid "" +"The “Teacher” field must include the full name, position, and title of " +"the lecturer" +msgstr "" + +#: ../../common_information/report.rst:42 +msgid "Comments" +msgstr "" + +#: ../../common_information/report.rst:44 +msgid "Failure to meet the requirements will result in a deduction of points." +msgstr "" + +#: ../../common_information/report.rst:45 +msgid "" +"The request will include points and comments regarding any requirement " +"violations (if applicable)." +msgstr "" + +#: ../../common_information/report.rst:46 +msgid "" +"The report will be checked only once, and the grade will be assigned " +"based on the submitted version according to the requirements." +msgstr "" + +#: ../../common_information/report.rst:47 +msgid "" +"The report is reviewed online; the entire review process takes place in " +"the request." +msgstr "" + +#: ../../common_information/report.rst:48 +msgid "" +"If a student falls into the **blue zone** for the task, the report points" +" will also be nullified at the end of the semester. The report will be " +"finally accepted and merged into the master branch only after both the " +"**online** parts of the corresponding lab work are fully completed." +msgstr "" + diff --git a/docs/locale/ru/LC_MESSAGES/common_information/threading_tasks.po b/docs/locale/ru/LC_MESSAGES/common_information/threading_tasks.po new file mode 100644 index 000000000..a560fd63d --- /dev/null +++ b/docs/locale/ru/LC_MESSAGES/common_information/threading_tasks.po @@ -0,0 +1,299 @@ +# SOME DESCRIPTIVE TITLE. +# Copyright (C) 2025, Learning Process +# This file is distributed under the same license as the Parallel +# Programming Course package. +# FIRST AUTHOR , 2025. +# +#, fuzzy +msgid "" +msgstr "" +"Project-Id-Version: Parallel Programming Course \n" +"Report-Msgid-Bugs-To: \n" +"POT-Creation-Date: 2025-02-05 13:29+0100\n" +"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" +"Last-Translator: FULL NAME \n" +"Language: ru\n" +"Language-Team: ru \n" +"Plural-Forms: nplurals=3; plural=(n%10==1 && n%100!=11 ? 0 : n%10>=2 && " +"n%10<=4 && (n%100<10 || n%100>=20) ? 1 : 2);\n" +"MIME-Version: 1.0\n" +"Content-Type: text/plain; charset=utf-8\n" +"Content-Transfer-Encoding: 8bit\n" +"Generated-By: Babel 2.17.0\n" + +#: ../../common_information/threading_tasks.rst:2 +msgid "Thread parallelism tasks" +msgstr "" + +#: ../../common_information/threading_tasks.rst:5 +msgid "Variant Number" +msgstr "" + +#: ../../common_information/threading_tasks.rst:5 +msgid "Tasks" +msgstr "" + +#: ../../common_information/threading_tasks.rst:7 +msgid "1" +msgstr "" + +#: ../../common_information/threading_tasks.rst:7 +msgid "" +"Dense matrix multiplication. Elements of type double. Block scheme, " +"Cannon's algorithm." +msgstr "" + +#: ../../common_information/threading_tasks.rst:9 +msgid "2" +msgstr "" + +#: ../../common_information/threading_tasks.rst:9 +msgid "" +"Dense matrix multiplication. Elements of type double. Block scheme, Fox's" +" algorithm." +msgstr "" + +#: ../../common_information/threading_tasks.rst:11 +msgid "3" +msgstr "" + +#: ../../common_information/threading_tasks.rst:11 +msgid "" +"Dense matrix multiplication. Elements of type double. Strassen's " +"algorithm." +msgstr "" + +#: ../../common_information/threading_tasks.rst:13 +msgid "4" +msgstr "" + +#: ../../common_information/threading_tasks.rst:13 +msgid "" +"Sparse matrix multiplication. Elements of type double. Matrix storage " +"format – row format (Compressed Row Storage)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:15 +msgid "5" +msgstr "" + +#: ../../common_information/threading_tasks.rst:15 +msgid "" +"Sparse matrix multiplication. Elements of type double. Matrix storage " +"format – column format (Compressed Column Storage)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:17 +msgid "6" +msgstr "" + +#: ../../common_information/threading_tasks.rst:17 +msgid "" +"Sparse matrix multiplication. Complex type elements. Matrix storage " +"format – row format (Compressed Row Storage)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:19 +msgid "7" +msgstr "" + +#: ../../common_information/threading_tasks.rst:19 +msgid "" +"Sparse matrix multiplication. Complex type elements. Matrix storage " +"format – column format (Compressed Column Storage)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:21 +msgid "8" +msgstr "" + +#: ../../common_information/threading_tasks.rst:21 +msgid "Solving systems of linear equations using the conjugate gradient method." +msgstr "" + +#: ../../common_information/threading_tasks.rst:23 +msgid "9" +msgstr "" + +#: ../../common_information/threading_tasks.rst:23 +msgid "" +"Computing multidimensional integrals using a multistep scheme (rectangle " +"method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:25 +msgid "10" +msgstr "" + +#: ../../common_information/threading_tasks.rst:25 +msgid "" +"Computing multidimensional integrals using a multistep scheme " +"(trapezoidal method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:27 +msgid "11" +msgstr "" + +#: ../../common_information/threading_tasks.rst:27 +msgid "" +"Computing multidimensional integrals using a multistep scheme (Simpson's " +"method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:29 +msgid "12" +msgstr "" + +#: ../../common_information/threading_tasks.rst:29 +msgid "Computing multidimensional integrals using the Monte Carlo method." +msgstr "" + +#: ../../common_information/threading_tasks.rst:31 +msgid "13" +msgstr "" + +#: ../../common_information/threading_tasks.rst:31 +msgid "Quick sort with simple merging." +msgstr "" + +#: ../../common_information/threading_tasks.rst:33 +msgid "14" +msgstr "" + +#: ../../common_information/threading_tasks.rst:33 +msgid "Quick sort with odd-even merging (Batcher's method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:35 +msgid "15" +msgstr "" + +#: ../../common_information/threading_tasks.rst:35 +msgid "Shell sort with simple merging." +msgstr "" + +#: ../../common_information/threading_tasks.rst:37 +msgid "16" +msgstr "" + +#: ../../common_information/threading_tasks.rst:37 +msgid "Shell sort with odd-even merging (Batcher's method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:39 +msgid "17" +msgstr "" + +#: ../../common_information/threading_tasks.rst:39 +msgid "Radix sort for integers with simple merging." +msgstr "" + +#: ../../common_information/threading_tasks.rst:41 +msgid "18" +msgstr "" + +#: ../../common_information/threading_tasks.rst:41 +msgid "Radix sort for integers with odd-even merging (Batcher's method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:43 +msgid "19" +msgstr "" + +#: ../../common_information/threading_tasks.rst:43 +msgid "Radix sort for floating-point numbers (type double) with simple merging." +msgstr "" + +#: ../../common_information/threading_tasks.rst:45 +msgid "20" +msgstr "" + +#: ../../common_information/threading_tasks.rst:45 +msgid "" +"Radix sort for floating-point numbers (type double) with odd-even merging" +" (Batcher's method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:47 +msgid "21" +msgstr "" + +#: ../../common_information/threading_tasks.rst:47 +msgid "Shortest path search from one vertex (Dijkstra's algorithm)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:49 +msgid "22" +msgstr "" + +#: ../../common_information/threading_tasks.rst:49 +msgid "Convex hull construction – Graham's scan." +msgstr "" + +#: ../../common_information/threading_tasks.rst:51 +msgid "23" +msgstr "" + +#: ../../common_information/threading_tasks.rst:51 +msgid "Convex hull construction – Jarvis's march." +msgstr "" + +#: ../../common_information/threading_tasks.rst:53 +msgid "24" +msgstr "" + +#: ../../common_information/threading_tasks.rst:53 +msgid "Linear image filtering (horizontal partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/threading_tasks.rst:55 +msgid "25" +msgstr "" + +#: ../../common_information/threading_tasks.rst:55 +msgid "Linear image filtering (vertical partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/threading_tasks.rst:57 +msgid "26" +msgstr "" + +#: ../../common_information/threading_tasks.rst:57 +msgid "Linear image filtering (block partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/threading_tasks.rst:59 +msgid "27" +msgstr "" + +#: ../../common_information/threading_tasks.rst:59 +msgid "Edge detection in an image using the Sobel operator." +msgstr "" + +#: ../../common_information/threading_tasks.rst:61 +msgid "28" +msgstr "" + +#: ../../common_information/threading_tasks.rst:61 +msgid "Contrast enhancement of grayscale image using linear histogram stretching." +msgstr "" + +#: ../../common_information/threading_tasks.rst:63 +msgid "29" +msgstr "" + +#: ../../common_information/threading_tasks.rst:63 +msgid "" +"Labeling components on a binary image (black areas correspond to objects," +" white to background)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:65 +msgid "30" +msgstr "" + +#: ../../common_information/threading_tasks.rst:65 +msgid "Convex hull construction for components of a binary image." +msgstr "" + diff --git a/docs/locale/ru/LC_MESSAGES/index.po b/docs/locale/ru/LC_MESSAGES/index.po index 32e341130..579ed43e9 100644 --- a/docs/locale/ru/LC_MESSAGES/index.po +++ b/docs/locale/ru/LC_MESSAGES/index.po @@ -9,7 +9,7 @@ msgid "" msgstr "" "Project-Id-Version: Parallel Programming Course \n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-01-20 23:19+0100\n" +"POT-Creation-Date: 2025-02-05 13:28+0100\n" "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" "Last-Translator: FULL NAME \n" "Language: ru\n" @@ -19,12 +19,16 @@ msgstr "" "MIME-Version: 1.0\n" "Content-Type: text/plain; charset=utf-8\n" "Content-Transfer-Encoding: 8bit\n" -"Generated-By: Babel 2.16.0\n" +"Generated-By: Babel 2.17.0\n" #: ../../index.rst:6 msgid "User Guide:" msgstr "Инструкция по выполнению работы" +#: ../../index.rst:16 +msgid "Course Details:" +msgstr "" + #: ../../index.rst:2 msgid "Parallel Programming Course documentation" msgstr "Документация по курсу «Параллельное программирование»" @@ -34,5 +38,10 @@ msgid "" "Below is the table of contents for the Parallel Programming Course " "documentation. Follow the links to learn more about each topic." msgstr "" -"Ниже приведено оглавление документации по курсу «Параллельное программирование». " -"Вы можете перейти по ссылкам, чтобы узнать больше о каждой теме." +"Ниже приведено оглавление документации по курсу «Параллельное " +"программирование». Вы можете перейти по ссылкам, чтобы узнать больше о " +"каждой теме." + +#~ msgid "Common Information:" +#~ msgstr "" +