From 56cfcd28a8f75575791b0d363e5ffed33303eb47 Mon Sep 17 00:00:00 2001 From: Alexander Nesterov Date: Mon, 3 Feb 2025 16:12:40 +0100 Subject: [PATCH 01/27] add introduction.md --- docs/common_information/md/introduction.md | 32 ++++++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 docs/common_information/md/introduction.md diff --git a/docs/common_information/md/introduction.md b/docs/common_information/md/introduction.md new file mode 100644 index 000000000..d70437aec --- /dev/null +++ b/docs/common_information/md/introduction.md @@ -0,0 +1,32 @@ +# Introduction + +### Practice: +* We work online + * Use GitHub repository sysytem + * Use Pull Requests + * Merge into the master branch + * Test verification +* Task distribution is random for each person. +* An example for each technology can be found in the directory: `tasks//example`. +* In each repository, the README.md contains a link to the build instructions (**read it in full!!!**). +* Additionally, each repository includes an example of a properly formatted PULL REQUEST. +* All tasks are mandatory. +* All resources for using the repository will be provided here: + * [GIT-1](https://proglib.io/p/git-for-half-an-hour) + * [GIT-2](https://medium.com/nuances-of-programming/%D0%B7%D0%BD%D0%B0%D0%BA%D0%BE%D0%BC%D1%81%D1%82%D0%B2%D0%BE-%D1%81-git-%D0%B8-github-%D1%80%D1%83%D0%BA%D0%BE%D0%B2%D0%BE%D0%B4%D1%81%D1%82%D0%B2%D0%BE-%D0%B4%D0%BB%D1%8F-%D0%BD%D0%B0%D1%87%D0%B8%D0%BD%D0%B0%D1%8E%D1%89%D0%B8%D1%85-54ea2567d76c) + * [GIT-3](https://tproger.ru/translations/git-quick-start/) + * [GIT CONFILCTS](https://githowto.com/ru/resolving_conflicts) + * [GTEST-1](https://habr.com/ru/post/119090/) + * [GTEST-2](https://github.com/google/googletest/blob/master/googletest/docs/primer.md) + * [GITHUB ACTIONS](https://docs.github.com/ru/actions) + * [MPI](https://parallel.ru/vvv/mpi.html#p1) + * [LaTeX-1](https://www.mccme.ru/free-books/llang/newllang.pdf) + * [LaTeX-2](http://www.docs.is.ed.ac.uk/skills/documents/3722/3722-2014.pdf) + * [OpenMP](https://parallel.ru/tech/tech_dev/openmp.html) + * [TBB-1](http://www.unn.ru/pages/e-library/aids/2007/12.pdf) + * [TBB-2](https://software.intel.com/content/www/ru/ru/develop/articles/tbb_async_io.html) + * [std::thread-1](https://eax.me/cpp-multithreading/) + * [std::thread-2](http://www.quizful.net/post/multithreading-cpp11) + * [std::thread-3](http://ikt.muctr.ru/images/info/2Lecture_3.pdf) + +\* *All instructions, repositories, and tables may be updated during the learning process for better usability. Be prepared for changes and check them periodically!!!* \ No newline at end of file From d2ebc1449b01483e9f5d7054dfa0ec94c70cbc68 Mon Sep 17 00:00:00 2001 From: Alexander Nesterov Date: Mon, 3 Feb 2025 17:00:54 +0100 Subject: [PATCH 02/27] add points.md --- docs/common_information/md/points.md | 77 ++++++++++++++++++++++++++++ 1 file changed, 77 insertions(+) create mode 100644 docs/common_information/md/points.md diff --git a/docs/common_information/md/points.md b/docs/common_information/md/points.md new file mode 100644 index 000000000..454cc13e4 --- /dev/null +++ b/docs/common_information/md/points.md @@ -0,0 +1,77 @@ +# Points +* For "processes" 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 "threading" 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 + + | Presence and 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 will be 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 date is counted from the last working commit. +* Comments: + * It is forbidden to write the report if all tasks are not completed. From 8938b1b2f407659d4e1da681d16f9451a9c3e6da Mon Sep 17 00:00:00 2001 From: Alexander Nesterov Date: Mon, 3 Feb 2025 19:08:48 +0100 Subject: [PATCH 03/27] add processes_tasks.md --- docs/common_information/md/processes_tasks.md | 163 ++++++++++++++++++ 1 file changed, 163 insertions(+) create mode 100644 docs/common_information/md/processes_tasks.md diff --git a/docs/common_information/md/processes_tasks.md b/docs/common_information/md/processes_tasks.md new file mode 100644 index 000000000..a076ccf0f --- /dev/null +++ b/docs/common_information/md/processes_tasks.md @@ -0,0 +1,163 @@ +# Processes 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 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 (CRS). | +| 5 | Sparse matrix multiplication. Elements of 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: + + | Varinats for task 2 | Varinats 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 | From 795f3bd624c023e842aa43827e72070af69ed7c1 Mon Sep 17 00:00:00 2001 From: Alexander Nesterov Date: Mon, 3 Feb 2025 19:12:12 +0100 Subject: [PATCH 04/27] add threading_tasks.md --- docs/common_information/md/processes_tasks.md | 56 +++++++++---------- docs/common_information/md/threading_tasks.md | 34 +++++++++++ 2 files changed, 62 insertions(+), 28 deletions(-) create mode 100644 docs/common_information/md/threading_tasks.md diff --git a/docs/common_information/md/processes_tasks.md b/docs/common_information/md/processes_tasks.md index a076ccf0f..6d2e4901d 100644 --- a/docs/common_information/md/processes_tasks.md +++ b/docs/common_information/md/processes_tasks.md @@ -2,35 +2,35 @@ ## 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 | +| 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 | +| 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 diff --git a/docs/common_information/md/threading_tasks.md b/docs/common_information/md/threading_tasks.md new file mode 100644 index 000000000..3defc2a0c --- /dev/null +++ b/docs/common_information/md/threading_tasks.md @@ -0,0 +1,34 @@ +# Threading 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 (CRS). | +| 5 | Sparse matrix multiplication. Elements of type double. Matrix storage format – column format (CCS). | +| 6 | Sparse matrix multiplication. Complex type elements. Matrix storage format – row format (CRS). | +| 7 | Sparse matrix multiplication. Complex type elements. Matrix storage format – column format (CCS). | +| 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. | From 3c6ed7855eb631545eac62397d4a1e881911874d Mon Sep 17 00:00:00 2001 From: Alexander Nesterov Date: Mon, 3 Feb 2025 23:56:09 +0100 Subject: [PATCH 05/27] add report.md --- docs/common_information/md/introduction.md | 3 ++ docs/common_information/md/report.md | 38 ++++++++++++++++++++++ 2 files changed, 41 insertions(+) create mode 100644 docs/common_information/md/report.md diff --git a/docs/common_information/md/introduction.md b/docs/common_information/md/introduction.md index d70437aec..072989303 100644 --- a/docs/common_information/md/introduction.md +++ b/docs/common_information/md/introduction.md @@ -11,6 +11,9 @@ * In each repository, the README.md contains a link to the build instructions (**read it in full!!!**). * Additionally, each repository includes an example of a properly formatted PULL REQUEST. * All tasks are mandatory. +* A task that has been merged into the master branch continues to be reviewed. +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 score for those tasks at the end of the semester. * All resources for using the repository will be provided here: * [GIT-1](https://proglib.io/p/git-for-half-an-hour) * [GIT-2](https://medium.com/nuances-of-programming/%D0%B7%D0%BD%D0%B0%D0%BA%D0%BE%D0%BC%D1%81%D1%82%D0%B2%D0%BE-%D1%81-git-%D0%B8-github-%D1%80%D1%83%D0%BA%D0%BE%D0%B2%D0%BE%D0%B4%D1%81%D1%82%D0%B2%D0%BE-%D0%B4%D0%BB%D1%8F-%D0%BD%D0%B0%D1%87%D0%B8%D0%BD%D0%B0%D1%8E%D1%89%D0%B8%D1%85-54ea2567d76c) diff --git a/docs/common_information/md/report.md b/docs/common_information/md/report.md new file mode 100644 index 000000000..ccfbe0602 --- /dev/null +++ b/docs/common_information/md/report.md @@ -0,0 +1,38 @@ +# Report + +* Report's points + + | Presence and 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 (substantive) + * 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 remotely; the entire review process takes place in the request. The report is NOT submitted in person. + * 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 **in-person and remote** parts of the corresponding lab work are fully completed. From 22e7951455b4912ecf0fa651f5cf0f44ab0fb7b4 Mon Sep 17 00:00:00 2001 From: Alexander Nesterov Date: Tue, 4 Feb 2025 00:06:22 +0100 Subject: [PATCH 06/27] add rst version --- docs/common_information/introduction.rst | 47 ++ docs/common_information/md/introduction.md | 35 - docs/common_information/md/points.md | 77 -- docs/common_information/md/processes_tasks.md | 163 ---- docs/common_information/md/report.md | 38 - docs/common_information/md/threading_tasks.md | 34 - docs/common_information/points.rst | 123 +++ docs/common_information/processes_tasks.rst | 431 +++++++++++ docs/common_information/report.rst | 62 ++ docs/common_information/threading_tasks.rst | 89 +++ docs/index.rst | 10 + .../common_information/introduction.po | 168 ++++ .../LC_MESSAGES/common_information/points.po | 289 +++++++ .../common_information/processes_tasks.po | 715 +++++++++++++++++ .../LC_MESSAGES/common_information/report.po | 180 +++++ .../common_information/threading_tasks.po | 298 ++++++++ docs/locale/en/LC_MESSAGES/index.po | 8 +- .../common_information/introduction.po | 169 +++++ .../LC_MESSAGES/common_information/points.po | 290 +++++++ .../common_information/processes_tasks.po | 716 ++++++++++++++++++ .../LC_MESSAGES/common_information/report.po | 181 +++++ .../common_information/threading_tasks.po | 299 ++++++++ docs/locale/ru/LC_MESSAGES/index.po | 14 +- 23 files changed, 4083 insertions(+), 353 deletions(-) create mode 100644 docs/common_information/introduction.rst delete mode 100644 docs/common_information/md/introduction.md delete mode 100644 docs/common_information/md/points.md delete mode 100644 docs/common_information/md/processes_tasks.md delete mode 100644 docs/common_information/md/report.md delete mode 100644 docs/common_information/md/threading_tasks.md create mode 100644 docs/common_information/points.rst create mode 100644 docs/common_information/processes_tasks.rst create mode 100644 docs/common_information/report.rst create mode 100644 docs/common_information/threading_tasks.rst create mode 100644 docs/locale/en/LC_MESSAGES/common_information/introduction.po create mode 100644 docs/locale/en/LC_MESSAGES/common_information/points.po create mode 100644 docs/locale/en/LC_MESSAGES/common_information/processes_tasks.po create mode 100644 docs/locale/en/LC_MESSAGES/common_information/report.po create mode 100644 docs/locale/en/LC_MESSAGES/common_information/threading_tasks.po create mode 100644 docs/locale/ru/LC_MESSAGES/common_information/introduction.po create mode 100644 docs/locale/ru/LC_MESSAGES/common_information/points.po create mode 100644 docs/locale/ru/LC_MESSAGES/common_information/processes_tasks.po create mode 100644 docs/locale/ru/LC_MESSAGES/common_information/report.po create mode 100644 docs/locale/ru/LC_MESSAGES/common_information/threading_tasks.po diff --git a/docs/common_information/introduction.rst b/docs/common_information/introduction.rst new file mode 100644 index 000000000..5587d9bd1 --- /dev/null +++ b/docs/common_information/introduction.rst @@ -0,0 +1,47 @@ +Introduction +============ + +Practice: +~~~~~~~~~ + +- We work online + + - Use GitHub repository sysytem + - Use Pull Requests + - Merge into the master branch + - Test verification + +- Task distribution is random for each person. +- An example for each technology can be found in the directory: + ``tasks//example``. +- In each repository, the README.md contains a link to the build + instructions (**read it in full!!!**). +- Additionally, each repository includes an example of a properly + formatted PULL REQUEST. +- All tasks are mandatory. +- A task that has been merged into the master branch continues to be + reviewed. 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 score for those tasks at the end of the semester. +- All resources for using the repository will be provided here: + + - `GIT-1 `__ + - `GIT-2 `__ + - `GIT-3 `__ + - `GIT CONFILCTS `__ + - `GTEST-1 `__ + - `GTEST-2 `__ + - `GITHUB ACTIONS `__ + - `MPI `__ + - `LaTeX-1 `__ + - `LaTeX-2 `__ + - `OpenMP `__ + - `TBB-1 `__ + - `TBB-2 `__ + - `std::thread-1 `__ + - `std::thread-2 `__ + - `std::thread-3 `__ + +\* *All instructions, repositories, and tables may be updated during the +learning process for better usability. Be prepared for changes and check +them periodically!!!* diff --git a/docs/common_information/md/introduction.md b/docs/common_information/md/introduction.md deleted file mode 100644 index 072989303..000000000 --- a/docs/common_information/md/introduction.md +++ /dev/null @@ -1,35 +0,0 @@ -# Introduction - -### Practice: -* We work online - * Use GitHub repository sysytem - * Use Pull Requests - * Merge into the master branch - * Test verification -* Task distribution is random for each person. -* An example for each technology can be found in the directory: `tasks//example`. -* In each repository, the README.md contains a link to the build instructions (**read it in full!!!**). -* Additionally, each repository includes an example of a properly formatted PULL REQUEST. -* All tasks are mandatory. -* A task that has been merged into the master branch continues to be reviewed. -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 score for those tasks at the end of the semester. -* All resources for using the repository will be provided here: - * [GIT-1](https://proglib.io/p/git-for-half-an-hour) - * [GIT-2](https://medium.com/nuances-of-programming/%D0%B7%D0%BD%D0%B0%D0%BA%D0%BE%D0%BC%D1%81%D1%82%D0%B2%D0%BE-%D1%81-git-%D0%B8-github-%D1%80%D1%83%D0%BA%D0%BE%D0%B2%D0%BE%D0%B4%D1%81%D1%82%D0%B2%D0%BE-%D0%B4%D0%BB%D1%8F-%D0%BD%D0%B0%D1%87%D0%B8%D0%BD%D0%B0%D1%8E%D1%89%D0%B8%D1%85-54ea2567d76c) - * [GIT-3](https://tproger.ru/translations/git-quick-start/) - * [GIT CONFILCTS](https://githowto.com/ru/resolving_conflicts) - * [GTEST-1](https://habr.com/ru/post/119090/) - * [GTEST-2](https://github.com/google/googletest/blob/master/googletest/docs/primer.md) - * [GITHUB ACTIONS](https://docs.github.com/ru/actions) - * [MPI](https://parallel.ru/vvv/mpi.html#p1) - * [LaTeX-1](https://www.mccme.ru/free-books/llang/newllang.pdf) - * [LaTeX-2](http://www.docs.is.ed.ac.uk/skills/documents/3722/3722-2014.pdf) - * [OpenMP](https://parallel.ru/tech/tech_dev/openmp.html) - * [TBB-1](http://www.unn.ru/pages/e-library/aids/2007/12.pdf) - * [TBB-2](https://software.intel.com/content/www/ru/ru/develop/articles/tbb_async_io.html) - * [std::thread-1](https://eax.me/cpp-multithreading/) - * [std::thread-2](http://www.quizful.net/post/multithreading-cpp11) - * [std::thread-3](http://ikt.muctr.ru/images/info/2Lecture_3.pdf) - -\* *All instructions, repositories, and tables may be updated during the learning process for better usability. Be prepared for changes and check them periodically!!!* \ No newline at end of file diff --git a/docs/common_information/md/points.md b/docs/common_information/md/points.md deleted file mode 100644 index 454cc13e4..000000000 --- a/docs/common_information/md/points.md +++ /dev/null @@ -1,77 +0,0 @@ -# Points -* For "processes" 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 "threading" 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 - - | Presence and 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 will be 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 date is counted from the last working commit. -* Comments: - * It is forbidden to write the report if all tasks are not completed. diff --git a/docs/common_information/md/processes_tasks.md b/docs/common_information/md/processes_tasks.md deleted file mode 100644 index 6d2e4901d..000000000 --- a/docs/common_information/md/processes_tasks.md +++ /dev/null @@ -1,163 +0,0 @@ -# Processes 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 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 (CRS). | -| 5 | Sparse matrix multiplication. Elements of 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: - - | Varinats for task 2 | Varinats 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/md/report.md b/docs/common_information/md/report.md deleted file mode 100644 index ccfbe0602..000000000 --- a/docs/common_information/md/report.md +++ /dev/null @@ -1,38 +0,0 @@ -# Report - -* Report's points - - | Presence and 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 (substantive) - * 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 remotely; the entire review process takes place in the request. The report is NOT submitted in person. - * 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 **in-person and remote** parts of the corresponding lab work are fully completed. diff --git a/docs/common_information/md/threading_tasks.md b/docs/common_information/md/threading_tasks.md deleted file mode 100644 index 3defc2a0c..000000000 --- a/docs/common_information/md/threading_tasks.md +++ /dev/null @@ -1,34 +0,0 @@ -# Threading 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 (CRS). | -| 5 | Sparse matrix multiplication. Elements of type double. Matrix storage format – column format (CCS). | -| 6 | Sparse matrix multiplication. Complex type elements. Matrix storage format – row format (CRS). | -| 7 | Sparse matrix multiplication. Complex type elements. Matrix storage format – column format (CCS). | -| 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/common_information/points.rst b/docs/common_information/points.rst new file mode 100644 index 000000000..60e0386a0 --- /dev/null +++ b/docs/common_information/points.rst @@ -0,0 +1,123 @@ +Points +====== + +- For “processes” 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 “threading” 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 + + +---------------------------+-------------+--------------------+------+ + | Presence and Completeness | Text | Formatting Quality | T | + | | Quality | | otal | + +===========================+=============+====================+======+ + | 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 will be 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 date is counted from the last working commit. + +- 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..eae66848c --- /dev/null +++ b/docs/common_information/processes_tasks.rst @@ -0,0 +1,431 @@ +Processes tasks +=============== + +First task +---------- + ++----------+-----------------------------------------------------------+ +| Variant | Task | +| Number | | ++==========+===========================================================+ +| 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 | Task | +| Number | | ++==========+===========================================================+ +| 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 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 | +| | (CRS). | ++---------------------------------------------------+------------------+ +| 5 | Sparse matrix | +| | multiplication. | +| | Elements of 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: + + =================== =================== + Varinats for task 2 Varinats 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..eab4a48ae --- /dev/null +++ b/docs/common_information/report.rst @@ -0,0 +1,62 @@ +Report +====== + +- Report’s points + + +---------------------------+-------------+--------------------+------+ + | Presence and Completeness | Text | Formatting Quality | T | + | | Quality | | otal | + +===========================+=============+====================+======+ + | 5 | 2.5 | 2.5 | 10 | + +---------------------------+-------------+--------------------+------+ + +- Requirements for Criteria + + - Presence and Completeness + + - Introduction (can be a short paragraph) + - Problem Statement (substantive) + - 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 remotely; the entire review process takes + place in the request. The report is NOT submitted in person. + - 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 **in-person and remote** 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..e79d4f4ac --- /dev/null +++ b/docs/common_information/threading_tasks.rst @@ -0,0 +1,89 @@ +Threading tasks +=============== + ++--------+-------------------------------------------------------------+ +| V | Tasks | +| ariant | | +| Number | | ++========+=============================================================+ +| 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 (CRS). | ++--------+-------------------------------------------------------------+ +| 5 | Sparse matrix multiplication. Elements of type double. | +| | Matrix storage format – column format (CCS). | ++--------+-------------------------------------------------------------+ +| 6 | Sparse matrix multiplication. Complex type elements. Matrix | +| | storage format – row format (CRS). | ++--------+-------------------------------------------------------------+ +| 7 | Sparse matrix multiplication. Complex type elements. Matrix | +| | storage format – column format (CCS). | ++--------+-------------------------------------------------------------+ +| 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..368885ad5 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: Common Information: + + common_information/introduction.rst + common_information/points.rst + common_information/processes_tasks.rst + common_information/report.rst + common_information/threading_tasks.rst 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..b3b1dcbd0 --- /dev/null +++ b/docs/locale/en/LC_MESSAGES/common_information/introduction.po @@ -0,0 +1,168 @@ +# 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-04 00:05+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 sysytem" +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 person." +msgstr "" + +#: ../../common_information/introduction.rst:15 +msgid "" +"An example for each technology can be found in the directory: " +"``tasks//example``." +msgstr "" + +#: ../../common_information/introduction.rst:17 +msgid "" +"In each repository, the README.md contains a link to the build " +"instructions (**read it in full!!!**)." +msgstr "" + +#: ../../common_information/introduction.rst:19 +msgid "" +"Additionally, each repository includes an example of a properly formatted" +" PULL REQUEST." +msgstr "" + +#: ../../common_information/introduction.rst:21 +msgid "All tasks are mandatory." +msgstr "" + +#: ../../common_information/introduction.rst:22 +msgid "" +"A task that has been merged into the master branch continues to be " +"reviewed. 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 score for those tasks at the end of the semester." +msgstr "" + +#: ../../common_information/introduction.rst:26 +msgid "All resources for using the repository will be provided here:" +msgstr "" + +#: ../../common_information/introduction.rst:28 +msgid "`GIT-1 `__" +msgstr "" + +#: ../../common_information/introduction.rst:29 +#, python-format +msgid "" +"`GIT-2 `__" +msgstr "" + +#: ../../common_information/introduction.rst:30 +msgid "`GIT-3 `__" +msgstr "" + +#: ../../common_information/introduction.rst:31 +msgid "`GIT CONFILCTS `__" +msgstr "" + +#: ../../common_information/introduction.rst:32 +msgid "`GTEST-1 `__" +msgstr "" + +#: ../../common_information/introduction.rst:33 +msgid "" +"`GTEST-2 " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:34 +msgid "`GITHUB ACTIONS `__" +msgstr "" + +#: ../../common_information/introduction.rst:35 +msgid "`MPI `__" +msgstr "" + +#: ../../common_information/introduction.rst:36 +msgid "`LaTeX-1 `__" +msgstr "" + +#: ../../common_information/introduction.rst:37 +msgid "" +"`LaTeX-2 " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:38 +msgid "`OpenMP `__" +msgstr "" + +#: ../../common_information/introduction.rst:39 +msgid "`TBB-1 `__" +msgstr "" + +#: ../../common_information/introduction.rst:40 +msgid "" +"`TBB-2 " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:41 +msgid "`std::thread-1 `__" +msgstr "" + +#: ../../common_information/introduction.rst:42 +msgid "`std::thread-2 `__" +msgstr "" + +#: ../../common_information/introduction.rst:43 +msgid "`std::thread-3 `__" +msgstr "" + +#: ../../common_information/introduction.rst:45 +msgid "" +"\\* *All instructions, repositories, and tables may be updated during the" +" learning process for better usability. Be prepared for changes and check" +" 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..601aa57f0 --- /dev/null +++ b/docs/locale/en/LC_MESSAGES/common_information/points.po @@ -0,0 +1,289 @@ +# 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-04 00:05+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 “processes” 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:83 +#: ../../common_information/points.rst:93 +#: ../../common_information/points.rst:105 +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:83 +msgid "10" +msgstr "" + +#: ../../common_information/points.rst:30 +msgid "**Total : 60 points**" +msgstr "" + +#: ../../common_information/points.rst:32 +msgid "For “threading” semester" +msgstr "" + +#: ../../common_information/points.rst:34 +msgid "Sequential version" +msgstr "" + +#: ../../common_information/points.rst:39 +#: ../../common_information/points.rst:96 +#: ../../common_information/points.rst:109 +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:95 +#: ../../common_information/points.rst:108 +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 "Presence and Completeness" +msgstr "" + +#: ../../common_information/points.rst:80 +msgid "Text Quality" +msgstr "" + +#: ../../common_information/points.rst:80 +msgid "Formatting Quality" +msgstr "" + +#: ../../common_information/points.rst:80 +msgid "T otal" +msgstr "" + +#: ../../common_information/points.rst:83 +msgid "2.5" +msgstr "" + +#: ../../common_information/points.rst:86 +msgid "Conversion of points into exam assessment or pass/fail" +msgstr "" + +#: ../../common_information/points.rst:88 +msgid "For 5-point grading system" +msgstr "" + +#: ../../common_information/points.rst:91 +#: ../../common_information/points.rst:102 +msgid "Points range" +msgstr "" + +#: ../../common_information/points.rst:91 +#: ../../common_information/points.rst:102 +msgid "Exam Assessment" +msgstr "" + +#: ../../common_information/points.rst:91 +#: ../../common_information/points.rst:102 +msgid "Student Pass" +msgstr "" + +#: ../../common_information/points.rst:93 +msgid "[87, 100]" +msgstr "" + +#: ../../common_information/points.rst:93 +#: ../../common_information/points.rst:94 +#: ../../common_information/points.rst:95 +#: ../../common_information/points.rst:104 +#: ../../common_information/points.rst:105 +#: ../../common_information/points.rst:106 +#: ../../common_information/points.rst:107 +#: ../../common_information/points.rst:108 +msgid "Passed" +msgstr "" + +#: ../../common_information/points.rst:94 +msgid "[70, 87)" +msgstr "" + +#: ../../common_information/points.rst:94 +#: ../../common_information/points.rst:107 +msgid "4" +msgstr "" + +#: ../../common_information/points.rst:95 +#: ../../common_information/points.rst:108 +msgid "[50, 70)" +msgstr "" + +#: ../../common_information/points.rst:96 +#: ../../common_information/points.rst:109 +msgid "< 50" +msgstr "" + +#: ../../common_information/points.rst:96 +#: ../../common_information/points.rst:109 +msgid "Not Passed" +msgstr "" + +#: ../../common_information/points.rst:99 +msgid "For 7-point grading system **(our current system)**" +msgstr "" + +#: ../../common_information/points.rst:104 +msgid "[99, 100]" +msgstr "" + +#: ../../common_information/points.rst:104 +msgid "5.5" +msgstr "" + +#: ../../common_information/points.rst:105 +msgid "[92, 99)" +msgstr "" + +#: ../../common_information/points.rst:106 +msgid "[82, 92)" +msgstr "" + +#: ../../common_information/points.rst:106 +msgid "4.5" +msgstr "" + +#: ../../common_information/points.rst:107 +msgid "[70, 82)" +msgstr "" + +#: ../../common_information/points.rst:112 +msgid "Penalties:" +msgstr "" + +#: ../../common_information/points.rst:114 +msgid "A deadline will be set for each version." +msgstr "" + +#: ../../common_information/points.rst:115 +msgid "" +"1 point will be deducted from the version’s score for each day of delay " +"in submission." +msgstr "" + +#: ../../common_information/points.rst:117 +msgid "" +"The task is considered submitted when it is merged into the master/main " +"branch." +msgstr "" + +#: ../../common_information/points.rst:119 +msgid "The submission date is counted from the last working commit." +msgstr "" + +#: ../../common_information/points.rst:121 +msgid "Comments:" +msgstr "" + +#: ../../common_information/points.rst:123 +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..cbfe8c779 --- /dev/null +++ b/docs/locale/en/LC_MESSAGES/common_information/processes_tasks.po @@ -0,0 +1,715 @@ +# 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-04 00:05+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 tasks" +msgstr "" + +#: ../../common_information/processes_tasks.rst:5 +msgid "First task" +msgstr "" + +#: ../../common_information/processes_tasks.rst:8 +#: ../../common_information/processes_tasks.rst:75 +#: ../../common_information/processes_tasks.rst:131 +msgid "Variant Number" +msgstr "" + +#: ../../common_information/processes_tasks.rst:8 +#: ../../common_information/processes_tasks.rst:75 +#: ../../common_information/processes_tasks.rst:131 +msgid "Task" +msgstr "" + +#: ../../common_information/processes_tasks.rst:11 +#: ../../common_information/processes_tasks.rst:78 +#: ../../common_information/processes_tasks.rst:133 +msgid "1" +msgstr "" + +#: ../../common_information/processes_tasks.rst:11 +msgid "Sum of vector elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:13 +#: ../../common_information/processes_tasks.rst:80 +#: ../../common_information/processes_tasks.rst:140 +msgid "2" +msgstr "" + +#: ../../common_information/processes_tasks.rst:13 +msgid "Calculating the average value of vector elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:15 +#: ../../common_information/processes_tasks.rst:82 +#: ../../common_information/processes_tasks.rst:147 +msgid "3" +msgstr "" + +#: ../../common_information/processes_tasks.rst:15 +msgid "Maximum value of vector elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:17 +#: ../../common_information/processes_tasks.rst:84 +#: ../../common_information/processes_tasks.rst:154 +msgid "4" +msgstr "" + +#: ../../common_information/processes_tasks.rst:17 +msgid "Minimum value of vector elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:19 +#: ../../common_information/processes_tasks.rst:86 +#: ../../common_information/processes_tasks.rst:162 +msgid "5" +msgstr "" + +#: ../../common_information/processes_tasks.rst:19 +msgid "" +"Finding the number of sign alternations between adjacent elements of the " +"vector" +msgstr "" + +#: ../../common_information/processes_tasks.rst:22 +#: ../../common_information/processes_tasks.rst:88 +#: ../../common_information/processes_tasks.rst:170 +#: ../../common_information/processes_tasks.rst:410 +msgid "6" +msgstr "" + +#: ../../common_information/processes_tasks.rst:22 +msgid "" +"Finding the number of order violations between adjacent elements of the " +"vector" +msgstr "" + +#: ../../common_information/processes_tasks.rst:25 +#: ../../common_information/processes_tasks.rst:90 +#: ../../common_information/processes_tasks.rst:176 +msgid "7" +msgstr "" + +#: ../../common_information/processes_tasks.rst:25 +msgid "Finding the most similar adjacent elements of the vector" +msgstr "" + +#: ../../common_information/processes_tasks.rst:27 +#: ../../common_information/processes_tasks.rst:92 +#: ../../common_information/processes_tasks.rst:184 +msgid "8" +msgstr "" + +#: ../../common_information/processes_tasks.rst:27 +msgid "Finding the most different adjacent elements of the vector" +msgstr "" + +#: ../../common_information/processes_tasks.rst:30 +#: ../../common_information/processes_tasks.rst:94 +#: ../../common_information/processes_tasks.rst:192 +msgid "9" +msgstr "" + +#: ../../common_information/processes_tasks.rst:30 +msgid "Scalar product of vectors" +msgstr "" + +#: ../../common_information/processes_tasks.rst:32 +#: ../../common_information/processes_tasks.rst:96 +#: ../../common_information/processes_tasks.rst:200 +msgid "10" +msgstr "" + +#: ../../common_information/processes_tasks.rst:32 +msgid "Sum of matrix elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:34 +#: ../../common_information/processes_tasks.rst:98 +#: ../../common_information/processes_tasks.rst:206 +msgid "11" +msgstr "" + +#: ../../common_information/processes_tasks.rst:34 +msgid "Sum of values by rows in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:36 +#: ../../common_information/processes_tasks.rst:100 +#: ../../common_information/processes_tasks.rst:216 +msgid "12" +msgstr "" + +#: ../../common_information/processes_tasks.rst:36 +msgid "Sum of values by columns in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:38 +#: ../../common_information/processes_tasks.rst:102 +#: ../../common_information/processes_tasks.rst:226 +msgid "13" +msgstr "" + +#: ../../common_information/processes_tasks.rst:38 +msgid "Maximum value of matrix elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:40 +#: ../../common_information/processes_tasks.rst:105 +#: ../../common_information/processes_tasks.rst:236 +msgid "14" +msgstr "" + +#: ../../common_information/processes_tasks.rst:40 +msgid "Minimum value of matrix elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:42 +#: ../../common_information/processes_tasks.rst:108 +#: ../../common_information/processes_tasks.rst:239 +msgid "15" +msgstr "" + +#: ../../common_information/processes_tasks.rst:42 +msgid "Finding maximum values by rows in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:44 +#: ../../common_information/processes_tasks.rst:110 +#: ../../common_information/processes_tasks.rst:244 +msgid "16" +msgstr "" + +#: ../../common_information/processes_tasks.rst:44 +msgid "Finding maximum values by columns in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:46 +#: ../../common_information/processes_tasks.rst:112 +#: ../../common_information/processes_tasks.rst:247 +msgid "17" +msgstr "" + +#: ../../common_information/processes_tasks.rst:46 +msgid "Finding minimum values by rows in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:48 +#: ../../common_information/processes_tasks.rst:114 +#: ../../common_information/processes_tasks.rst:252 +msgid "18" +msgstr "" + +#: ../../common_information/processes_tasks.rst:48 +msgid "Finding minimum values by columns in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:50 +#: ../../common_information/processes_tasks.rst:116 +#: ../../common_information/processes_tasks.rst:256 +msgid "19" +msgstr "" + +#: ../../common_information/processes_tasks.rst:50 +msgid "Integration – rectangle method" +msgstr "" + +#: ../../common_information/processes_tasks.rst:52 +#: ../../common_information/processes_tasks.rst:118 +#: ../../common_information/processes_tasks.rst:262 +msgid "20" +msgstr "" + +#: ../../common_information/processes_tasks.rst:52 +msgid "Integration – trapezoidal method" +msgstr "" + +#: ../../common_information/processes_tasks.rst:54 +#: ../../common_information/processes_tasks.rst:120 +#: ../../common_information/processes_tasks.rst:268 +#: ../../common_information/processes_tasks.rst:420 +msgid "21" +msgstr "" + +#: ../../common_information/processes_tasks.rst:54 +msgid "Integration – Monte Carlo method" +msgstr "" + +#: ../../common_information/processes_tasks.rst:56 +#: ../../common_information/processes_tasks.rst:122 +#: ../../common_information/processes_tasks.rst:276 +msgid "22" +msgstr "" + +#: ../../common_information/processes_tasks.rst:56 +msgid "Counting the number of alphabetical characters in a string" +msgstr "" + +#: ../../common_information/processes_tasks.rst:59 +#: ../../common_information/processes_tasks.rst:124 +#: ../../common_information/processes_tasks.rst:283 +msgid "23" +msgstr "" + +#: ../../common_information/processes_tasks.rst:59 +msgid "Counting the frequency of a character in a string" +msgstr "" + +#: ../../common_information/processes_tasks.rst:61 +#: ../../common_information/processes_tasks.rst:290 +msgid "24" +msgstr "" + +#: ../../common_information/processes_tasks.rst:61 +msgid "Counting the number of words in a string" +msgstr "" + +#: ../../common_information/processes_tasks.rst:63 +#: ../../common_information/processes_tasks.rst:294 +msgid "25" +msgstr "" + +#: ../../common_information/processes_tasks.rst:63 +msgid "Counting the number of sentences in a string" +msgstr "" + +#: ../../common_information/processes_tasks.rst:65 +#: ../../common_information/processes_tasks.rst:298 +msgid "26" +msgstr "" + +#: ../../common_information/processes_tasks.rst:65 +msgid "Checking lexicographical order of two strings" +msgstr "" + +#: ../../common_information/processes_tasks.rst:67 +#: ../../common_information/processes_tasks.rst:305 +msgid "27" +msgstr "" + +#: ../../common_information/processes_tasks.rst:67 +msgid "Counting the number of differing characters between two strings" +msgstr "" + +#: ../../common_information/processes_tasks.rst:72 +msgid "Second task" +msgstr "" + +#: ../../common_information/processes_tasks.rst:78 +msgid "Broadcast (one to all transfer)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:80 +msgid "Reduce (all to one transfer)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:82 +msgid "Allreduce (all to one and broadcast)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:84 +msgid "Scatter (one to all transfer)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:86 +msgid "Gather (all to one transfer)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:88 +msgid "Line" +msgstr "" + +#: ../../common_information/processes_tasks.rst:90 +msgid "Ring" +msgstr "" + +#: ../../common_information/processes_tasks.rst:92 +msgid "Star" +msgstr "" + +#: ../../common_information/processes_tasks.rst:94 +msgid "Torus Grid" +msgstr "" + +#: ../../common_information/processes_tasks.rst:96 +msgid "Hypercube" +msgstr "" + +#: ../../common_information/processes_tasks.rst:98 +msgid "Horizontal strip scheme - matrix-vector multiplication" +msgstr "" + +#: ../../common_information/processes_tasks.rst:100 +msgid "Vertical strip scheme - matrix-vector multiplication" +msgstr "" + +#: ../../common_information/processes_tasks.rst:102 +msgid "" +"Horizontal strip scheme – partitioning only matrix A - matrix-matrix " +"multiplication" +msgstr "" + +#: ../../common_information/processes_tasks.rst:105 +msgid "" +"Horizontal strip scheme A, vertical strip scheme B - matrix-matrix " +"multiplication" +msgstr "" + +#: ../../common_information/processes_tasks.rst:108 +msgid "Gaussian method – horizontal strip scheme" +msgstr "" + +#: ../../common_information/processes_tasks.rst:110 +msgid "Gaussian method – vertical strip scheme" +msgstr "" + +#: ../../common_information/processes_tasks.rst:112 +msgid "Gauss-Jordan method" +msgstr "" + +#: ../../common_information/processes_tasks.rst:114 +msgid "Iterative methods (Jacobi)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:116 +msgid "Iterative methods (Gauss-Seidel)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:118 +msgid "Iterative methods (Simple)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:120 +msgid "Bubble sort (odd-even transposition algorithm)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:122 +msgid "Image smoothing" +msgstr "" + +#: ../../common_information/processes_tasks.rst:124 +msgid "Contrast enhancement" +msgstr "" + +#: ../../common_information/processes_tasks.rst:128 +msgid "Third task" +msgstr "" + +#: ../../common_information/processes_tasks.rst:133 +msgid "" +"Dense matrix multiplication. Elements of type double. Block scheme, " +"Cannon’s algorithm." +msgstr "" + +#: ../../common_information/processes_tasks.rst:140 +msgid "" +"Dense matrix multiplication. Elements of type double. Block scheme, Fox’s" +" algorithm." +msgstr "" + +#: ../../common_information/processes_tasks.rst:147 +msgid "" +"Dense matrix multiplication. Elements of type double. Strassen’s " +"algorithm." +msgstr "" + +#: ../../common_information/processes_tasks.rst:154 +msgid "" +"Sparse matrix multiplication. Elements of type double. Matrix storage " +"format – row format (CRS)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:162 +msgid "" +"Sparse matrix multiplication. Elements of type double. Matrix storage " +"format – column format (CCS)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:170 +msgid "Solving systems of linear equations using the conjugate gradient method." +msgstr "" + +#: ../../common_information/processes_tasks.rst:176 +msgid "" +"Computing multidimensional integrals using a multistep scheme (rectangle " +"method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:184 +msgid "" +"Computing multidimensional integrals using a multistep scheme " +"(trapezoidal method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:192 +msgid "" +"Computing multidimensional integrals using a multistep scheme (Simpson’s " +"method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:200 +msgid "Computing multidimensional integrals using the Monte Carlo method." +msgstr "" + +#: ../../common_information/processes_tasks.rst:206 +msgid "" +"Global search algorithm (Strongin’s) for one-dimensional optimization " +"problems. Parallelization by characteristics." +msgstr "" + +#: ../../common_information/processes_tasks.rst:216 +msgid "" +"Multistep scheme for solving two-dimensional global optimization " +"problems. Parallelization by dividing the search area." +msgstr "" + +#: ../../common_information/processes_tasks.rst:226 +msgid "" +"Multistep scheme for solving two-dimensional global optimization " +"problems. Parallelization by characteristics." +msgstr "" + +#: ../../common_information/processes_tasks.rst:236 +msgid "Quick sort with simple merging." +msgstr "" + +#: ../../common_information/processes_tasks.rst:239 +msgid "Quick sort with odd-even merging (Batcher’s method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:244 +msgid "Shell sort with simple merging." +msgstr "" + +#: ../../common_information/processes_tasks.rst:247 +msgid "Shell sort with odd-even merging (Batcher’s method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:252 +msgid "Radix sort for integers with simple merging." +msgstr "" + +#: ../../common_information/processes_tasks.rst:256 +msgid "Radix sort for integers with odd-even merging (Batcher’s method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:262 +msgid "Radix sort for floating-point numbers (type double) with simple merging." +msgstr "" + +#: ../../common_information/processes_tasks.rst:268 +msgid "" +"Radix sort for floating-point numbers (type double) with odd-even merging" +" (Batcher’s method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:276 +msgid "" +"Shortest path search from one vertex (Dijkstra’s algorithm). With CRS " +"graphs." +msgstr "" + +#: ../../common_information/processes_tasks.rst:283 +msgid "" +"Shortest path search from one vertex (Bellman-Ford algorithm). With CRS " +"graphs." +msgstr "" + +#: ../../common_information/processes_tasks.rst:290 +msgid "Convex hull construction – Graham’s scan." +msgstr "" + +#: ../../common_information/processes_tasks.rst:294 +msgid "Convex hull construction – Jarvis’s march." +msgstr "" + +#: ../../common_information/processes_tasks.rst:298 +msgid "Linear image filtering (horizontal partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/processes_tasks.rst:305 +msgid "Linear image filtering (vertical partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/processes_tasks.rst:312 +msgid "28" +msgstr "" + +#: ../../common_information/processes_tasks.rst:312 +msgid "Linear image filtering (block partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/processes_tasks.rst:318 +msgid "29" +msgstr "" + +#: ../../common_information/processes_tasks.rst:318 +msgid "Edge detection in an image using the Sobel operator." +msgstr "" + +#: ../../common_information/processes_tasks.rst:323 +msgid "30" +msgstr "" + +#: ../../common_information/processes_tasks.rst:323 +msgid "Contrast enhancement of grayscale image using linear histogram stretching." +msgstr "" + +#: ../../common_information/processes_tasks.rst:330 +msgid "31" +msgstr "" + +#: ../../common_information/processes_tasks.rst:330 +msgid "" +"Labeling components on a binary image (black areas correspond to objects," +" white to background)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:338 +msgid "32" +msgstr "" + +#: ../../common_information/processes_tasks.rst:338 +msgid "Convex hull construction for components of a binary image." +msgstr "" + +#: ../../common_information/processes_tasks.rst:345 +msgid "Comments for tasks 2 and 3:" +msgstr "" + +#: ../../common_information/processes_tasks.rst:347 +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:355 +#: ../../common_information/processes_tasks.rst:369 +#: ../../common_information/processes_tasks.rst:382 +#: ../../common_information/processes_tasks.rst:395 +#: ../../common_information/processes_tasks.rst:405 +#: ../../common_information/processes_tasks.rst:415 +#: ../../common_information/processes_tasks.rst:425 +msgid "Comments relevant for:" +msgstr "" + +#: ../../common_information/processes_tasks.rst:358 +#: ../../common_information/processes_tasks.rst:372 +#: ../../common_information/processes_tasks.rst:385 +#: ../../common_information/processes_tasks.rst:398 +#: ../../common_information/processes_tasks.rst:408 +#: ../../common_information/processes_tasks.rst:418 +#: ../../common_information/processes_tasks.rst:428 +msgid "Varinats for task 2" +msgstr "" + +#: ../../common_information/processes_tasks.rst:358 +#: ../../common_information/processes_tasks.rst:372 +#: ../../common_information/processes_tasks.rst:385 +#: ../../common_information/processes_tasks.rst:398 +#: ../../common_information/processes_tasks.rst:408 +#: ../../common_information/processes_tasks.rst:418 +#: ../../common_information/processes_tasks.rst:428 +msgid "Varinats for task 3" +msgstr "" + +#: ../../common_information/processes_tasks.rst:360 +#: ../../common_information/processes_tasks.rst:387 +msgid "1 - 5" +msgstr "" + +#: ../../common_information/processes_tasks.rst:360 +#: ../../common_information/processes_tasks.rst:374 +#: ../../common_information/processes_tasks.rst:430 +msgid "x" +msgstr "" + +#: ../../common_information/processes_tasks.rst:363 +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:374 +msgid "6 - 10" +msgstr "" + +#: ../../common_information/processes_tasks.rst:377 +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:387 +msgid "11 - 14" +msgstr "" + +#: ../../common_information/processes_tasks.rst:390 +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:400 +msgid "26 - 27" +msgstr "" + +#: ../../common_information/processes_tasks.rst:400 +msgid "24 - 32" +msgstr "" + +#: ../../common_information/processes_tasks.rst:403 +msgid "SOLUTION OF A SYSTEM OF LINEAR ALGEBRAIC EQUATIONS" +msgstr "" + +#: ../../common_information/processes_tasks.rst:410 +msgid "15 - 20" +msgstr "" + +#: ../../common_information/processes_tasks.rst:413 +msgid "SORT ALGORITHMS" +msgstr "" + +#: ../../common_information/processes_tasks.rst:420 +msgid "14 - 21" +msgstr "" + +#: ../../common_information/processes_tasks.rst:423 +msgid "GRAPH PROCESSING ALGORITHMS" +msgstr "" + +#: ../../common_information/processes_tasks.rst:430 +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..520678442 --- /dev/null +++ b/docs/locale/en/LC_MESSAGES/common_information/report.po @@ -0,0 +1,180 @@ +# 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-04 00:05+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’s points" +msgstr "" + +#: ../../common_information/report.rst:7 ../../common_information/report.rst:15 +msgid "Presence and Completeness" +msgstr "" + +#: ../../common_information/report.rst:7 ../../common_information/report.rst:31 +msgid "Text Quality" +msgstr "" + +#: ../../common_information/report.rst:7 ../../common_information/report.rst:39 +msgid "Formatting Quality" +msgstr "" + +#: ../../common_information/report.rst:7 +msgid "T otal" +msgstr "" + +#: ../../common_information/report.rst:10 +msgid "5" +msgstr "" + +#: ../../common_information/report.rst:10 +msgid "2.5" +msgstr "" + +#: ../../common_information/report.rst:10 +msgid "10" +msgstr "" + +#: ../../common_information/report.rst:13 +msgid "Requirements for Criteria" +msgstr "" + +#: ../../common_information/report.rst:17 +msgid "Introduction (can be a short paragraph)" +msgstr "" + +#: ../../common_information/report.rst:18 +msgid "Problem Statement (substantive)" +msgstr "" + +#: ../../common_information/report.rst:19 +msgid "Algorithm Description" +msgstr "" + +#: ../../common_information/report.rst:20 +msgid "Description of the Parallel Algorithm Scheme" +msgstr "" + +#: ../../common_information/report.rst:21 +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:24 +msgid "" +"Experimental Results (execution time and algorithm quality assessment), " +"description of correctness verification" +msgstr "" + +#: ../../common_information/report.rst:26 +msgid "Conclusions from the Results" +msgstr "" + +#: ../../common_information/report.rst:27 +msgid "Conclusion" +msgstr "" + +#: ../../common_information/report.rst:28 +msgid "References" +msgstr "" + +#: ../../common_information/report.rst:29 +msgid "Appendix (include code, ensuring readability)" +msgstr "" + +#: ../../common_information/report.rst:33 +msgid "Meaningfulness" +msgstr "" + +#: ../../common_information/report.rst:34 +msgid "Coherence" +msgstr "" + +#: ../../common_information/report.rst:35 +msgid "Clarity" +msgstr "" + +#: ../../common_information/report.rst:36 +msgid "Quality of language (only the most obvious mistakes are considered)" +msgstr "" + +#: ../../common_information/report.rst:41 +msgid "Requirements for Headings" +msgstr "" + +#: ../../common_information/report.rst:42 +msgid "Requirements for Text Alignment" +msgstr "" + +#: ../../common_information/report.rst:43 +msgid "Requirements for Paragraph Indentation" +msgstr "" + +#: ../../common_information/report.rst:44 +msgid "Requirements for the Formatting of Figures, Graphs, and Tables" +msgstr "" + +#: ../../common_information/report.rst:45 +msgid "" +"The “Teacher” field must include the full name, position, and title of " +"the lecturer" +msgstr "" + +#: ../../common_information/report.rst:48 +msgid "Comments" +msgstr "" + +#: ../../common_information/report.rst:50 +msgid "Failure to meet the requirements will result in a deduction of points." +msgstr "" + +#: ../../common_information/report.rst:52 +msgid "" +"The request will include points and comments regarding any requirement " +"violations (if applicable)." +msgstr "" + +#: ../../common_information/report.rst:54 +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:56 +msgid "" +"The report is reviewed remotely; the entire review process takes place in" +" the request. The report is NOT submitted in person." +msgstr "" + +#: ../../common_information/report.rst:58 +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 " +"**in-person and remote** 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..95ed3f4cf --- /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-04 00:05+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 "Threading tasks" +msgstr "" + +#: ../../common_information/threading_tasks.rst:5 +msgid "V ariant Number" +msgstr "" + +#: ../../common_information/threading_tasks.rst:5 +msgid "Tasks" +msgstr "" + +#: ../../common_information/threading_tasks.rst:9 +msgid "1" +msgstr "" + +#: ../../common_information/threading_tasks.rst:9 +msgid "" +"Dense matrix multiplication. Elements of type double. Block scheme, " +"Cannon’s algorithm." +msgstr "" + +#: ../../common_information/threading_tasks.rst:12 +msgid "2" +msgstr "" + +#: ../../common_information/threading_tasks.rst:12 +msgid "" +"Dense matrix multiplication. Elements of type double. Block scheme, Fox’s" +" algorithm." +msgstr "" + +#: ../../common_information/threading_tasks.rst:15 +msgid "3" +msgstr "" + +#: ../../common_information/threading_tasks.rst:15 +msgid "" +"Dense matrix multiplication. Elements of type double. Strassen’s " +"algorithm." +msgstr "" + +#: ../../common_information/threading_tasks.rst:18 +msgid "4" +msgstr "" + +#: ../../common_information/threading_tasks.rst:18 +msgid "" +"Sparse matrix multiplication. Elements of type double. Matrix storage " +"format – row format (CRS)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:21 +msgid "5" +msgstr "" + +#: ../../common_information/threading_tasks.rst:21 +msgid "" +"Sparse matrix multiplication. Elements of type double. Matrix storage " +"format – column format (CCS)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:24 +msgid "6" +msgstr "" + +#: ../../common_information/threading_tasks.rst:24 +msgid "" +"Sparse matrix multiplication. Complex type elements. Matrix storage " +"format – row format (CRS)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:27 +msgid "7" +msgstr "" + +#: ../../common_information/threading_tasks.rst:27 +msgid "" +"Sparse matrix multiplication. Complex type elements. Matrix storage " +"format – column format (CCS)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:30 +msgid "8" +msgstr "" + +#: ../../common_information/threading_tasks.rst:30 +msgid "Solving systems of linear equations using the conjugate gradient method." +msgstr "" + +#: ../../common_information/threading_tasks.rst:33 +msgid "9" +msgstr "" + +#: ../../common_information/threading_tasks.rst:33 +msgid "" +"Computing multidimensional integrals using a multistep scheme (rectangle " +"method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:36 +msgid "10" +msgstr "" + +#: ../../common_information/threading_tasks.rst:36 +msgid "" +"Computing multidimensional integrals using a multistep scheme " +"(trapezoidal method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:39 +msgid "11" +msgstr "" + +#: ../../common_information/threading_tasks.rst:39 +msgid "" +"Computing multidimensional integrals using a multistep scheme (Simpson’s " +"method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:42 +msgid "12" +msgstr "" + +#: ../../common_information/threading_tasks.rst:42 +msgid "Computing multidimensional integrals using the Monte Carlo method." +msgstr "" + +#: ../../common_information/threading_tasks.rst:45 +msgid "13" +msgstr "" + +#: ../../common_information/threading_tasks.rst:45 +msgid "Quick sort with simple merging." +msgstr "" + +#: ../../common_information/threading_tasks.rst:47 +msgid "14" +msgstr "" + +#: ../../common_information/threading_tasks.rst:47 +msgid "Quick sort with odd-even merging (Batcher’s method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:49 +msgid "15" +msgstr "" + +#: ../../common_information/threading_tasks.rst:49 +msgid "Shell sort with simple merging." +msgstr "" + +#: ../../common_information/threading_tasks.rst:51 +msgid "16" +msgstr "" + +#: ../../common_information/threading_tasks.rst:51 +msgid "Shell sort with odd-even merging (Batcher’s method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:53 +msgid "17" +msgstr "" + +#: ../../common_information/threading_tasks.rst:53 +msgid "Radix sort for integers with simple merging." +msgstr "" + +#: ../../common_information/threading_tasks.rst:55 +msgid "18" +msgstr "" + +#: ../../common_information/threading_tasks.rst:55 +msgid "Radix sort for integers with odd-even merging (Batcher’s method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:58 +msgid "19" +msgstr "" + +#: ../../common_information/threading_tasks.rst:58 +msgid "Radix sort for floating-point numbers (type double) with simple merging." +msgstr "" + +#: ../../common_information/threading_tasks.rst:61 +msgid "20" +msgstr "" + +#: ../../common_information/threading_tasks.rst:61 +msgid "" +"Radix sort for floating-point numbers (type double) with odd-even merging" +" (Batcher’s method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:64 +msgid "21" +msgstr "" + +#: ../../common_information/threading_tasks.rst:64 +msgid "Shortest path search from one vertex (Dijkstra’s algorithm)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:67 +msgid "22" +msgstr "" + +#: ../../common_information/threading_tasks.rst:67 +msgid "Convex hull construction – Graham’s scan." +msgstr "" + +#: ../../common_information/threading_tasks.rst:69 +msgid "23" +msgstr "" + +#: ../../common_information/threading_tasks.rst:69 +msgid "Convex hull construction – Jarvis’s march." +msgstr "" + +#: ../../common_information/threading_tasks.rst:71 +msgid "24" +msgstr "" + +#: ../../common_information/threading_tasks.rst:71 +msgid "Linear image filtering (horizontal partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/threading_tasks.rst:74 +msgid "25" +msgstr "" + +#: ../../common_information/threading_tasks.rst:74 +msgid "Linear image filtering (vertical partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/threading_tasks.rst:77 +msgid "26" +msgstr "" + +#: ../../common_information/threading_tasks.rst:77 +msgid "Linear image filtering (block partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/threading_tasks.rst:80 +msgid "27" +msgstr "" + +#: ../../common_information/threading_tasks.rst:80 +msgid "Edge detection in an image using the Sobel operator." +msgstr "" + +#: ../../common_information/threading_tasks.rst:82 +msgid "28" +msgstr "" + +#: ../../common_information/threading_tasks.rst:82 +msgid "Contrast enhancement of grayscale image using linear histogram stretching." +msgstr "" + +#: ../../common_information/threading_tasks.rst:85 +msgid "29" +msgstr "" + +#: ../../common_information/threading_tasks.rst:85 +msgid "" +"Labeling components on a binary image (black areas correspond to objects," +" white to background)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:88 +msgid "30" +msgstr "" + +#: ../../common_information/threading_tasks.rst:88 +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..325e9fc20 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-04 00:05+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 "Common Information:" +msgstr "" + #: ../../index.rst:2 msgid "Parallel Programming Course documentation" 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..47f1ce542 --- /dev/null +++ b/docs/locale/ru/LC_MESSAGES/common_information/introduction.po @@ -0,0 +1,169 @@ +# 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-04 00:05+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 sysytem" +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 person." +msgstr "" + +#: ../../common_information/introduction.rst:15 +msgid "" +"An example for each technology can be found in the directory: " +"``tasks//example``." +msgstr "" + +#: ../../common_information/introduction.rst:17 +msgid "" +"In each repository, the README.md contains a link to the build " +"instructions (**read it in full!!!**)." +msgstr "" + +#: ../../common_information/introduction.rst:19 +msgid "" +"Additionally, each repository includes an example of a properly formatted" +" PULL REQUEST." +msgstr "" + +#: ../../common_information/introduction.rst:21 +msgid "All tasks are mandatory." +msgstr "" + +#: ../../common_information/introduction.rst:22 +msgid "" +"A task that has been merged into the master branch continues to be " +"reviewed. 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 score for those tasks at the end of the semester." +msgstr "" + +#: ../../common_information/introduction.rst:26 +msgid "All resources for using the repository will be provided here:" +msgstr "" + +#: ../../common_information/introduction.rst:28 +msgid "`GIT-1 `__" +msgstr "" + +#: ../../common_information/introduction.rst:29 +#, python-format +msgid "" +"`GIT-2 `__" +msgstr "" + +#: ../../common_information/introduction.rst:30 +msgid "`GIT-3 `__" +msgstr "" + +#: ../../common_information/introduction.rst:31 +msgid "`GIT CONFILCTS `__" +msgstr "" + +#: ../../common_information/introduction.rst:32 +msgid "`GTEST-1 `__" +msgstr "" + +#: ../../common_information/introduction.rst:33 +msgid "" +"`GTEST-2 " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:34 +msgid "`GITHUB ACTIONS `__" +msgstr "" + +#: ../../common_information/introduction.rst:35 +msgid "`MPI `__" +msgstr "" + +#: ../../common_information/introduction.rst:36 +msgid "`LaTeX-1 `__" +msgstr "" + +#: ../../common_information/introduction.rst:37 +msgid "" +"`LaTeX-2 " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:38 +msgid "`OpenMP `__" +msgstr "" + +#: ../../common_information/introduction.rst:39 +msgid "`TBB-1 `__" +msgstr "" + +#: ../../common_information/introduction.rst:40 +msgid "" +"`TBB-2 " +"`__" +msgstr "" + +#: ../../common_information/introduction.rst:41 +msgid "`std::thread-1 `__" +msgstr "" + +#: ../../common_information/introduction.rst:42 +msgid "`std::thread-2 `__" +msgstr "" + +#: ../../common_information/introduction.rst:43 +msgid "`std::thread-3 `__" +msgstr "" + +#: ../../common_information/introduction.rst:45 +msgid "" +"\\* *All instructions, repositories, and tables may be updated during the" +" learning process for better usability. Be prepared for changes and check" +" 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..a88b6a6a5 --- /dev/null +++ b/docs/locale/ru/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-04 00:05+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 “processes” 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:83 +#: ../../common_information/points.rst:93 +#: ../../common_information/points.rst:105 +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:83 +msgid "10" +msgstr "" + +#: ../../common_information/points.rst:30 +msgid "**Total : 60 points**" +msgstr "" + +#: ../../common_information/points.rst:32 +msgid "For “threading” semester" +msgstr "" + +#: ../../common_information/points.rst:34 +msgid "Sequential version" +msgstr "" + +#: ../../common_information/points.rst:39 +#: ../../common_information/points.rst:96 +#: ../../common_information/points.rst:109 +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:95 +#: ../../common_information/points.rst:108 +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 "Presence and Completeness" +msgstr "" + +#: ../../common_information/points.rst:80 +msgid "Text Quality" +msgstr "" + +#: ../../common_information/points.rst:80 +msgid "Formatting Quality" +msgstr "" + +#: ../../common_information/points.rst:80 +msgid "T otal" +msgstr "" + +#: ../../common_information/points.rst:83 +msgid "2.5" +msgstr "" + +#: ../../common_information/points.rst:86 +msgid "Conversion of points into exam assessment or pass/fail" +msgstr "" + +#: ../../common_information/points.rst:88 +msgid "For 5-point grading system" +msgstr "" + +#: ../../common_information/points.rst:91 +#: ../../common_information/points.rst:102 +msgid "Points range" +msgstr "" + +#: ../../common_information/points.rst:91 +#: ../../common_information/points.rst:102 +msgid "Exam Assessment" +msgstr "" + +#: ../../common_information/points.rst:91 +#: ../../common_information/points.rst:102 +msgid "Student Pass" +msgstr "" + +#: ../../common_information/points.rst:93 +msgid "[87, 100]" +msgstr "" + +#: ../../common_information/points.rst:93 +#: ../../common_information/points.rst:94 +#: ../../common_information/points.rst:95 +#: ../../common_information/points.rst:104 +#: ../../common_information/points.rst:105 +#: ../../common_information/points.rst:106 +#: ../../common_information/points.rst:107 +#: ../../common_information/points.rst:108 +msgid "Passed" +msgstr "" + +#: ../../common_information/points.rst:94 +msgid "[70, 87)" +msgstr "" + +#: ../../common_information/points.rst:94 +#: ../../common_information/points.rst:107 +msgid "4" +msgstr "" + +#: ../../common_information/points.rst:95 +#: ../../common_information/points.rst:108 +msgid "[50, 70)" +msgstr "" + +#: ../../common_information/points.rst:96 +#: ../../common_information/points.rst:109 +msgid "< 50" +msgstr "" + +#: ../../common_information/points.rst:96 +#: ../../common_information/points.rst:109 +msgid "Not Passed" +msgstr "" + +#: ../../common_information/points.rst:99 +msgid "For 7-point grading system **(our current system)**" +msgstr "" + +#: ../../common_information/points.rst:104 +msgid "[99, 100]" +msgstr "" + +#: ../../common_information/points.rst:104 +msgid "5.5" +msgstr "" + +#: ../../common_information/points.rst:105 +msgid "[92, 99)" +msgstr "" + +#: ../../common_information/points.rst:106 +msgid "[82, 92)" +msgstr "" + +#: ../../common_information/points.rst:106 +msgid "4.5" +msgstr "" + +#: ../../common_information/points.rst:107 +msgid "[70, 82)" +msgstr "" + +#: ../../common_information/points.rst:112 +msgid "Penalties:" +msgstr "" + +#: ../../common_information/points.rst:114 +msgid "A deadline will be set for each version." +msgstr "" + +#: ../../common_information/points.rst:115 +msgid "" +"1 point will be deducted from the version’s score for each day of delay " +"in submission." +msgstr "" + +#: ../../common_information/points.rst:117 +msgid "" +"The task is considered submitted when it is merged into the master/main " +"branch." +msgstr "" + +#: ../../common_information/points.rst:119 +msgid "The submission date is counted from the last working commit." +msgstr "" + +#: ../../common_information/points.rst:121 +msgid "Comments:" +msgstr "" + +#: ../../common_information/points.rst:123 +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..f38742234 --- /dev/null +++ b/docs/locale/ru/LC_MESSAGES/common_information/processes_tasks.po @@ -0,0 +1,716 @@ +# 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-04 00:05+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 tasks" +msgstr "" + +#: ../../common_information/processes_tasks.rst:5 +msgid "First task" +msgstr "" + +#: ../../common_information/processes_tasks.rst:8 +#: ../../common_information/processes_tasks.rst:75 +#: ../../common_information/processes_tasks.rst:131 +msgid "Variant Number" +msgstr "" + +#: ../../common_information/processes_tasks.rst:8 +#: ../../common_information/processes_tasks.rst:75 +#: ../../common_information/processes_tasks.rst:131 +msgid "Task" +msgstr "" + +#: ../../common_information/processes_tasks.rst:11 +#: ../../common_information/processes_tasks.rst:78 +#: ../../common_information/processes_tasks.rst:133 +msgid "1" +msgstr "" + +#: ../../common_information/processes_tasks.rst:11 +msgid "Sum of vector elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:13 +#: ../../common_information/processes_tasks.rst:80 +#: ../../common_information/processes_tasks.rst:140 +msgid "2" +msgstr "" + +#: ../../common_information/processes_tasks.rst:13 +msgid "Calculating the average value of vector elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:15 +#: ../../common_information/processes_tasks.rst:82 +#: ../../common_information/processes_tasks.rst:147 +msgid "3" +msgstr "" + +#: ../../common_information/processes_tasks.rst:15 +msgid "Maximum value of vector elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:17 +#: ../../common_information/processes_tasks.rst:84 +#: ../../common_information/processes_tasks.rst:154 +msgid "4" +msgstr "" + +#: ../../common_information/processes_tasks.rst:17 +msgid "Minimum value of vector elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:19 +#: ../../common_information/processes_tasks.rst:86 +#: ../../common_information/processes_tasks.rst:162 +msgid "5" +msgstr "" + +#: ../../common_information/processes_tasks.rst:19 +msgid "" +"Finding the number of sign alternations between adjacent elements of the " +"vector" +msgstr "" + +#: ../../common_information/processes_tasks.rst:22 +#: ../../common_information/processes_tasks.rst:88 +#: ../../common_information/processes_tasks.rst:170 +#: ../../common_information/processes_tasks.rst:410 +msgid "6" +msgstr "" + +#: ../../common_information/processes_tasks.rst:22 +msgid "" +"Finding the number of order violations between adjacent elements of the " +"vector" +msgstr "" + +#: ../../common_information/processes_tasks.rst:25 +#: ../../common_information/processes_tasks.rst:90 +#: ../../common_information/processes_tasks.rst:176 +msgid "7" +msgstr "" + +#: ../../common_information/processes_tasks.rst:25 +msgid "Finding the most similar adjacent elements of the vector" +msgstr "" + +#: ../../common_information/processes_tasks.rst:27 +#: ../../common_information/processes_tasks.rst:92 +#: ../../common_information/processes_tasks.rst:184 +msgid "8" +msgstr "" + +#: ../../common_information/processes_tasks.rst:27 +msgid "Finding the most different adjacent elements of the vector" +msgstr "" + +#: ../../common_information/processes_tasks.rst:30 +#: ../../common_information/processes_tasks.rst:94 +#: ../../common_information/processes_tasks.rst:192 +msgid "9" +msgstr "" + +#: ../../common_information/processes_tasks.rst:30 +msgid "Scalar product of vectors" +msgstr "" + +#: ../../common_information/processes_tasks.rst:32 +#: ../../common_information/processes_tasks.rst:96 +#: ../../common_information/processes_tasks.rst:200 +msgid "10" +msgstr "" + +#: ../../common_information/processes_tasks.rst:32 +msgid "Sum of matrix elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:34 +#: ../../common_information/processes_tasks.rst:98 +#: ../../common_information/processes_tasks.rst:206 +msgid "11" +msgstr "" + +#: ../../common_information/processes_tasks.rst:34 +msgid "Sum of values by rows in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:36 +#: ../../common_information/processes_tasks.rst:100 +#: ../../common_information/processes_tasks.rst:216 +msgid "12" +msgstr "" + +#: ../../common_information/processes_tasks.rst:36 +msgid "Sum of values by columns in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:38 +#: ../../common_information/processes_tasks.rst:102 +#: ../../common_information/processes_tasks.rst:226 +msgid "13" +msgstr "" + +#: ../../common_information/processes_tasks.rst:38 +msgid "Maximum value of matrix elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:40 +#: ../../common_information/processes_tasks.rst:105 +#: ../../common_information/processes_tasks.rst:236 +msgid "14" +msgstr "" + +#: ../../common_information/processes_tasks.rst:40 +msgid "Minimum value of matrix elements" +msgstr "" + +#: ../../common_information/processes_tasks.rst:42 +#: ../../common_information/processes_tasks.rst:108 +#: ../../common_information/processes_tasks.rst:239 +msgid "15" +msgstr "" + +#: ../../common_information/processes_tasks.rst:42 +msgid "Finding maximum values by rows in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:44 +#: ../../common_information/processes_tasks.rst:110 +#: ../../common_information/processes_tasks.rst:244 +msgid "16" +msgstr "" + +#: ../../common_information/processes_tasks.rst:44 +msgid "Finding maximum values by columns in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:46 +#: ../../common_information/processes_tasks.rst:112 +#: ../../common_information/processes_tasks.rst:247 +msgid "17" +msgstr "" + +#: ../../common_information/processes_tasks.rst:46 +msgid "Finding minimum values by rows in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:48 +#: ../../common_information/processes_tasks.rst:114 +#: ../../common_information/processes_tasks.rst:252 +msgid "18" +msgstr "" + +#: ../../common_information/processes_tasks.rst:48 +msgid "Finding minimum values by columns in the matrix" +msgstr "" + +#: ../../common_information/processes_tasks.rst:50 +#: ../../common_information/processes_tasks.rst:116 +#: ../../common_information/processes_tasks.rst:256 +msgid "19" +msgstr "" + +#: ../../common_information/processes_tasks.rst:50 +msgid "Integration – rectangle method" +msgstr "" + +#: ../../common_information/processes_tasks.rst:52 +#: ../../common_information/processes_tasks.rst:118 +#: ../../common_information/processes_tasks.rst:262 +msgid "20" +msgstr "" + +#: ../../common_information/processes_tasks.rst:52 +msgid "Integration – trapezoidal method" +msgstr "" + +#: ../../common_information/processes_tasks.rst:54 +#: ../../common_information/processes_tasks.rst:120 +#: ../../common_information/processes_tasks.rst:268 +#: ../../common_information/processes_tasks.rst:420 +msgid "21" +msgstr "" + +#: ../../common_information/processes_tasks.rst:54 +msgid "Integration – Monte Carlo method" +msgstr "" + +#: ../../common_information/processes_tasks.rst:56 +#: ../../common_information/processes_tasks.rst:122 +#: ../../common_information/processes_tasks.rst:276 +msgid "22" +msgstr "" + +#: ../../common_information/processes_tasks.rst:56 +msgid "Counting the number of alphabetical characters in a string" +msgstr "" + +#: ../../common_information/processes_tasks.rst:59 +#: ../../common_information/processes_tasks.rst:124 +#: ../../common_information/processes_tasks.rst:283 +msgid "23" +msgstr "" + +#: ../../common_information/processes_tasks.rst:59 +msgid "Counting the frequency of a character in a string" +msgstr "" + +#: ../../common_information/processes_tasks.rst:61 +#: ../../common_information/processes_tasks.rst:290 +msgid "24" +msgstr "" + +#: ../../common_information/processes_tasks.rst:61 +msgid "Counting the number of words in a string" +msgstr "" + +#: ../../common_information/processes_tasks.rst:63 +#: ../../common_information/processes_tasks.rst:294 +msgid "25" +msgstr "" + +#: ../../common_information/processes_tasks.rst:63 +msgid "Counting the number of sentences in a string" +msgstr "" + +#: ../../common_information/processes_tasks.rst:65 +#: ../../common_information/processes_tasks.rst:298 +msgid "26" +msgstr "" + +#: ../../common_information/processes_tasks.rst:65 +msgid "Checking lexicographical order of two strings" +msgstr "" + +#: ../../common_information/processes_tasks.rst:67 +#: ../../common_information/processes_tasks.rst:305 +msgid "27" +msgstr "" + +#: ../../common_information/processes_tasks.rst:67 +msgid "Counting the number of differing characters between two strings" +msgstr "" + +#: ../../common_information/processes_tasks.rst:72 +msgid "Second task" +msgstr "" + +#: ../../common_information/processes_tasks.rst:78 +msgid "Broadcast (one to all transfer)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:80 +msgid "Reduce (all to one transfer)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:82 +msgid "Allreduce (all to one and broadcast)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:84 +msgid "Scatter (one to all transfer)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:86 +msgid "Gather (all to one transfer)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:88 +msgid "Line" +msgstr "" + +#: ../../common_information/processes_tasks.rst:90 +msgid "Ring" +msgstr "" + +#: ../../common_information/processes_tasks.rst:92 +msgid "Star" +msgstr "" + +#: ../../common_information/processes_tasks.rst:94 +msgid "Torus Grid" +msgstr "" + +#: ../../common_information/processes_tasks.rst:96 +msgid "Hypercube" +msgstr "" + +#: ../../common_information/processes_tasks.rst:98 +msgid "Horizontal strip scheme - matrix-vector multiplication" +msgstr "" + +#: ../../common_information/processes_tasks.rst:100 +msgid "Vertical strip scheme - matrix-vector multiplication" +msgstr "" + +#: ../../common_information/processes_tasks.rst:102 +msgid "" +"Horizontal strip scheme – partitioning only matrix A - matrix-matrix " +"multiplication" +msgstr "" + +#: ../../common_information/processes_tasks.rst:105 +msgid "" +"Horizontal strip scheme A, vertical strip scheme B - matrix-matrix " +"multiplication" +msgstr "" + +#: ../../common_information/processes_tasks.rst:108 +msgid "Gaussian method – horizontal strip scheme" +msgstr "" + +#: ../../common_information/processes_tasks.rst:110 +msgid "Gaussian method – vertical strip scheme" +msgstr "" + +#: ../../common_information/processes_tasks.rst:112 +msgid "Gauss-Jordan method" +msgstr "" + +#: ../../common_information/processes_tasks.rst:114 +msgid "Iterative methods (Jacobi)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:116 +msgid "Iterative methods (Gauss-Seidel)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:118 +msgid "Iterative methods (Simple)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:120 +msgid "Bubble sort (odd-even transposition algorithm)" +msgstr "" + +#: ../../common_information/processes_tasks.rst:122 +msgid "Image smoothing" +msgstr "" + +#: ../../common_information/processes_tasks.rst:124 +msgid "Contrast enhancement" +msgstr "" + +#: ../../common_information/processes_tasks.rst:128 +msgid "Third task" +msgstr "" + +#: ../../common_information/processes_tasks.rst:133 +msgid "" +"Dense matrix multiplication. Elements of type double. Block scheme, " +"Cannon’s algorithm." +msgstr "" + +#: ../../common_information/processes_tasks.rst:140 +msgid "" +"Dense matrix multiplication. Elements of type double. Block scheme, Fox’s" +" algorithm." +msgstr "" + +#: ../../common_information/processes_tasks.rst:147 +msgid "" +"Dense matrix multiplication. Elements of type double. Strassen’s " +"algorithm." +msgstr "" + +#: ../../common_information/processes_tasks.rst:154 +msgid "" +"Sparse matrix multiplication. Elements of type double. Matrix storage " +"format – row format (CRS)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:162 +msgid "" +"Sparse matrix multiplication. Elements of type double. Matrix storage " +"format – column format (CCS)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:170 +msgid "Solving systems of linear equations using the conjugate gradient method." +msgstr "" + +#: ../../common_information/processes_tasks.rst:176 +msgid "" +"Computing multidimensional integrals using a multistep scheme (rectangle " +"method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:184 +msgid "" +"Computing multidimensional integrals using a multistep scheme " +"(trapezoidal method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:192 +msgid "" +"Computing multidimensional integrals using a multistep scheme (Simpson’s " +"method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:200 +msgid "Computing multidimensional integrals using the Monte Carlo method." +msgstr "" + +#: ../../common_information/processes_tasks.rst:206 +msgid "" +"Global search algorithm (Strongin’s) for one-dimensional optimization " +"problems. Parallelization by characteristics." +msgstr "" + +#: ../../common_information/processes_tasks.rst:216 +msgid "" +"Multistep scheme for solving two-dimensional global optimization " +"problems. Parallelization by dividing the search area." +msgstr "" + +#: ../../common_information/processes_tasks.rst:226 +msgid "" +"Multistep scheme for solving two-dimensional global optimization " +"problems. Parallelization by characteristics." +msgstr "" + +#: ../../common_information/processes_tasks.rst:236 +msgid "Quick sort with simple merging." +msgstr "" + +#: ../../common_information/processes_tasks.rst:239 +msgid "Quick sort with odd-even merging (Batcher’s method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:244 +msgid "Shell sort with simple merging." +msgstr "" + +#: ../../common_information/processes_tasks.rst:247 +msgid "Shell sort with odd-even merging (Batcher’s method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:252 +msgid "Radix sort for integers with simple merging." +msgstr "" + +#: ../../common_information/processes_tasks.rst:256 +msgid "Radix sort for integers with odd-even merging (Batcher’s method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:262 +msgid "Radix sort for floating-point numbers (type double) with simple merging." +msgstr "" + +#: ../../common_information/processes_tasks.rst:268 +msgid "" +"Radix sort for floating-point numbers (type double) with odd-even merging" +" (Batcher’s method)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:276 +msgid "" +"Shortest path search from one vertex (Dijkstra’s algorithm). With CRS " +"graphs." +msgstr "" + +#: ../../common_information/processes_tasks.rst:283 +msgid "" +"Shortest path search from one vertex (Bellman-Ford algorithm). With CRS " +"graphs." +msgstr "" + +#: ../../common_information/processes_tasks.rst:290 +msgid "Convex hull construction – Graham’s scan." +msgstr "" + +#: ../../common_information/processes_tasks.rst:294 +msgid "Convex hull construction – Jarvis’s march." +msgstr "" + +#: ../../common_information/processes_tasks.rst:298 +msgid "Linear image filtering (horizontal partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/processes_tasks.rst:305 +msgid "Linear image filtering (vertical partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/processes_tasks.rst:312 +msgid "28" +msgstr "" + +#: ../../common_information/processes_tasks.rst:312 +msgid "Linear image filtering (block partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/processes_tasks.rst:318 +msgid "29" +msgstr "" + +#: ../../common_information/processes_tasks.rst:318 +msgid "Edge detection in an image using the Sobel operator." +msgstr "" + +#: ../../common_information/processes_tasks.rst:323 +msgid "30" +msgstr "" + +#: ../../common_information/processes_tasks.rst:323 +msgid "Contrast enhancement of grayscale image using linear histogram stretching." +msgstr "" + +#: ../../common_information/processes_tasks.rst:330 +msgid "31" +msgstr "" + +#: ../../common_information/processes_tasks.rst:330 +msgid "" +"Labeling components on a binary image (black areas correspond to objects," +" white to background)." +msgstr "" + +#: ../../common_information/processes_tasks.rst:338 +msgid "32" +msgstr "" + +#: ../../common_information/processes_tasks.rst:338 +msgid "Convex hull construction for components of a binary image." +msgstr "" + +#: ../../common_information/processes_tasks.rst:345 +msgid "Comments for tasks 2 and 3:" +msgstr "" + +#: ../../common_information/processes_tasks.rst:347 +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:355 +#: ../../common_information/processes_tasks.rst:369 +#: ../../common_information/processes_tasks.rst:382 +#: ../../common_information/processes_tasks.rst:395 +#: ../../common_information/processes_tasks.rst:405 +#: ../../common_information/processes_tasks.rst:415 +#: ../../common_information/processes_tasks.rst:425 +msgid "Comments relevant for:" +msgstr "" + +#: ../../common_information/processes_tasks.rst:358 +#: ../../common_information/processes_tasks.rst:372 +#: ../../common_information/processes_tasks.rst:385 +#: ../../common_information/processes_tasks.rst:398 +#: ../../common_information/processes_tasks.rst:408 +#: ../../common_information/processes_tasks.rst:418 +#: ../../common_information/processes_tasks.rst:428 +msgid "Varinats for task 2" +msgstr "" + +#: ../../common_information/processes_tasks.rst:358 +#: ../../common_information/processes_tasks.rst:372 +#: ../../common_information/processes_tasks.rst:385 +#: ../../common_information/processes_tasks.rst:398 +#: ../../common_information/processes_tasks.rst:408 +#: ../../common_information/processes_tasks.rst:418 +#: ../../common_information/processes_tasks.rst:428 +msgid "Varinats for task 3" +msgstr "" + +#: ../../common_information/processes_tasks.rst:360 +#: ../../common_information/processes_tasks.rst:387 +msgid "1 - 5" +msgstr "" + +#: ../../common_information/processes_tasks.rst:360 +#: ../../common_information/processes_tasks.rst:374 +#: ../../common_information/processes_tasks.rst:430 +msgid "x" +msgstr "" + +#: ../../common_information/processes_tasks.rst:363 +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:374 +msgid "6 - 10" +msgstr "" + +#: ../../common_information/processes_tasks.rst:377 +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:387 +msgid "11 - 14" +msgstr "" + +#: ../../common_information/processes_tasks.rst:390 +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:400 +msgid "26 - 27" +msgstr "" + +#: ../../common_information/processes_tasks.rst:400 +msgid "24 - 32" +msgstr "" + +#: ../../common_information/processes_tasks.rst:403 +msgid "SOLUTION OF A SYSTEM OF LINEAR ALGEBRAIC EQUATIONS" +msgstr "" + +#: ../../common_information/processes_tasks.rst:410 +msgid "15 - 20" +msgstr "" + +#: ../../common_information/processes_tasks.rst:413 +msgid "SORT ALGORITHMS" +msgstr "" + +#: ../../common_information/processes_tasks.rst:420 +msgid "14 - 21" +msgstr "" + +#: ../../common_information/processes_tasks.rst:423 +msgid "GRAPH PROCESSING ALGORITHMS" +msgstr "" + +#: ../../common_information/processes_tasks.rst:430 +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..a77c8255d --- /dev/null +++ b/docs/locale/ru/LC_MESSAGES/common_information/report.po @@ -0,0 +1,181 @@ +# 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-04 00:05+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’s points" +msgstr "" + +#: ../../common_information/report.rst:7 ../../common_information/report.rst:15 +msgid "Presence and Completeness" +msgstr "" + +#: ../../common_information/report.rst:7 ../../common_information/report.rst:31 +msgid "Text Quality" +msgstr "" + +#: ../../common_information/report.rst:7 ../../common_information/report.rst:39 +msgid "Formatting Quality" +msgstr "" + +#: ../../common_information/report.rst:7 +msgid "T otal" +msgstr "" + +#: ../../common_information/report.rst:10 +msgid "5" +msgstr "" + +#: ../../common_information/report.rst:10 +msgid "2.5" +msgstr "" + +#: ../../common_information/report.rst:10 +msgid "10" +msgstr "" + +#: ../../common_information/report.rst:13 +msgid "Requirements for Criteria" +msgstr "" + +#: ../../common_information/report.rst:17 +msgid "Introduction (can be a short paragraph)" +msgstr "" + +#: ../../common_information/report.rst:18 +msgid "Problem Statement (substantive)" +msgstr "" + +#: ../../common_information/report.rst:19 +msgid "Algorithm Description" +msgstr "" + +#: ../../common_information/report.rst:20 +msgid "Description of the Parallel Algorithm Scheme" +msgstr "" + +#: ../../common_information/report.rst:21 +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:24 +msgid "" +"Experimental Results (execution time and algorithm quality assessment), " +"description of correctness verification" +msgstr "" + +#: ../../common_information/report.rst:26 +msgid "Conclusions from the Results" +msgstr "" + +#: ../../common_information/report.rst:27 +msgid "Conclusion" +msgstr "" + +#: ../../common_information/report.rst:28 +msgid "References" +msgstr "" + +#: ../../common_information/report.rst:29 +msgid "Appendix (include code, ensuring readability)" +msgstr "" + +#: ../../common_information/report.rst:33 +msgid "Meaningfulness" +msgstr "" + +#: ../../common_information/report.rst:34 +msgid "Coherence" +msgstr "" + +#: ../../common_information/report.rst:35 +msgid "Clarity" +msgstr "" + +#: ../../common_information/report.rst:36 +msgid "Quality of language (only the most obvious mistakes are considered)" +msgstr "" + +#: ../../common_information/report.rst:41 +msgid "Requirements for Headings" +msgstr "" + +#: ../../common_information/report.rst:42 +msgid "Requirements for Text Alignment" +msgstr "" + +#: ../../common_information/report.rst:43 +msgid "Requirements for Paragraph Indentation" +msgstr "" + +#: ../../common_information/report.rst:44 +msgid "Requirements for the Formatting of Figures, Graphs, and Tables" +msgstr "" + +#: ../../common_information/report.rst:45 +msgid "" +"The “Teacher” field must include the full name, position, and title of " +"the lecturer" +msgstr "" + +#: ../../common_information/report.rst:48 +msgid "Comments" +msgstr "" + +#: ../../common_information/report.rst:50 +msgid "Failure to meet the requirements will result in a deduction of points." +msgstr "" + +#: ../../common_information/report.rst:52 +msgid "" +"The request will include points and comments regarding any requirement " +"violations (if applicable)." +msgstr "" + +#: ../../common_information/report.rst:54 +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:56 +msgid "" +"The report is reviewed remotely; the entire review process takes place in" +" the request. The report is NOT submitted in person." +msgstr "" + +#: ../../common_information/report.rst:58 +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 " +"**in-person and remote** 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..e6b453906 --- /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-04 00:05+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 "Threading tasks" +msgstr "" + +#: ../../common_information/threading_tasks.rst:5 +msgid "V ariant Number" +msgstr "" + +#: ../../common_information/threading_tasks.rst:5 +msgid "Tasks" +msgstr "" + +#: ../../common_information/threading_tasks.rst:9 +msgid "1" +msgstr "" + +#: ../../common_information/threading_tasks.rst:9 +msgid "" +"Dense matrix multiplication. Elements of type double. Block scheme, " +"Cannon’s algorithm." +msgstr "" + +#: ../../common_information/threading_tasks.rst:12 +msgid "2" +msgstr "" + +#: ../../common_information/threading_tasks.rst:12 +msgid "" +"Dense matrix multiplication. Elements of type double. Block scheme, Fox’s" +" algorithm." +msgstr "" + +#: ../../common_information/threading_tasks.rst:15 +msgid "3" +msgstr "" + +#: ../../common_information/threading_tasks.rst:15 +msgid "" +"Dense matrix multiplication. Elements of type double. Strassen’s " +"algorithm." +msgstr "" + +#: ../../common_information/threading_tasks.rst:18 +msgid "4" +msgstr "" + +#: ../../common_information/threading_tasks.rst:18 +msgid "" +"Sparse matrix multiplication. Elements of type double. Matrix storage " +"format – row format (CRS)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:21 +msgid "5" +msgstr "" + +#: ../../common_information/threading_tasks.rst:21 +msgid "" +"Sparse matrix multiplication. Elements of type double. Matrix storage " +"format – column format (CCS)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:24 +msgid "6" +msgstr "" + +#: ../../common_information/threading_tasks.rst:24 +msgid "" +"Sparse matrix multiplication. Complex type elements. Matrix storage " +"format – row format (CRS)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:27 +msgid "7" +msgstr "" + +#: ../../common_information/threading_tasks.rst:27 +msgid "" +"Sparse matrix multiplication. Complex type elements. Matrix storage " +"format – column format (CCS)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:30 +msgid "8" +msgstr "" + +#: ../../common_information/threading_tasks.rst:30 +msgid "Solving systems of linear equations using the conjugate gradient method." +msgstr "" + +#: ../../common_information/threading_tasks.rst:33 +msgid "9" +msgstr "" + +#: ../../common_information/threading_tasks.rst:33 +msgid "" +"Computing multidimensional integrals using a multistep scheme (rectangle " +"method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:36 +msgid "10" +msgstr "" + +#: ../../common_information/threading_tasks.rst:36 +msgid "" +"Computing multidimensional integrals using a multistep scheme " +"(trapezoidal method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:39 +msgid "11" +msgstr "" + +#: ../../common_information/threading_tasks.rst:39 +msgid "" +"Computing multidimensional integrals using a multistep scheme (Simpson’s " +"method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:42 +msgid "12" +msgstr "" + +#: ../../common_information/threading_tasks.rst:42 +msgid "Computing multidimensional integrals using the Monte Carlo method." +msgstr "" + +#: ../../common_information/threading_tasks.rst:45 +msgid "13" +msgstr "" + +#: ../../common_information/threading_tasks.rst:45 +msgid "Quick sort with simple merging." +msgstr "" + +#: ../../common_information/threading_tasks.rst:47 +msgid "14" +msgstr "" + +#: ../../common_information/threading_tasks.rst:47 +msgid "Quick sort with odd-even merging (Batcher’s method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:49 +msgid "15" +msgstr "" + +#: ../../common_information/threading_tasks.rst:49 +msgid "Shell sort with simple merging." +msgstr "" + +#: ../../common_information/threading_tasks.rst:51 +msgid "16" +msgstr "" + +#: ../../common_information/threading_tasks.rst:51 +msgid "Shell sort with odd-even merging (Batcher’s method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:53 +msgid "17" +msgstr "" + +#: ../../common_information/threading_tasks.rst:53 +msgid "Radix sort for integers with simple merging." +msgstr "" + +#: ../../common_information/threading_tasks.rst:55 +msgid "18" +msgstr "" + +#: ../../common_information/threading_tasks.rst:55 +msgid "Radix sort for integers with odd-even merging (Batcher’s method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:58 +msgid "19" +msgstr "" + +#: ../../common_information/threading_tasks.rst:58 +msgid "Radix sort for floating-point numbers (type double) with simple merging." +msgstr "" + +#: ../../common_information/threading_tasks.rst:61 +msgid "20" +msgstr "" + +#: ../../common_information/threading_tasks.rst:61 +msgid "" +"Radix sort for floating-point numbers (type double) with odd-even merging" +" (Batcher’s method)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:64 +msgid "21" +msgstr "" + +#: ../../common_information/threading_tasks.rst:64 +msgid "Shortest path search from one vertex (Dijkstra’s algorithm)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:67 +msgid "22" +msgstr "" + +#: ../../common_information/threading_tasks.rst:67 +msgid "Convex hull construction – Graham’s scan." +msgstr "" + +#: ../../common_information/threading_tasks.rst:69 +msgid "23" +msgstr "" + +#: ../../common_information/threading_tasks.rst:69 +msgid "Convex hull construction – Jarvis’s march." +msgstr "" + +#: ../../common_information/threading_tasks.rst:71 +msgid "24" +msgstr "" + +#: ../../common_information/threading_tasks.rst:71 +msgid "Linear image filtering (horizontal partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/threading_tasks.rst:74 +msgid "25" +msgstr "" + +#: ../../common_information/threading_tasks.rst:74 +msgid "Linear image filtering (vertical partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/threading_tasks.rst:77 +msgid "26" +msgstr "" + +#: ../../common_information/threading_tasks.rst:77 +msgid "Linear image filtering (block partition). Gaussian kernel 3x3." +msgstr "" + +#: ../../common_information/threading_tasks.rst:80 +msgid "27" +msgstr "" + +#: ../../common_information/threading_tasks.rst:80 +msgid "Edge detection in an image using the Sobel operator." +msgstr "" + +#: ../../common_information/threading_tasks.rst:82 +msgid "28" +msgstr "" + +#: ../../common_information/threading_tasks.rst:82 +msgid "Contrast enhancement of grayscale image using linear histogram stretching." +msgstr "" + +#: ../../common_information/threading_tasks.rst:85 +msgid "29" +msgstr "" + +#: ../../common_information/threading_tasks.rst:85 +msgid "" +"Labeling components on a binary image (black areas correspond to objects," +" white to background)." +msgstr "" + +#: ../../common_information/threading_tasks.rst:88 +msgid "30" +msgstr "" + +#: ../../common_information/threading_tasks.rst:88 +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..770dc8584 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-04 00:05+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 "Common Information:" +msgstr "" + #: ../../index.rst:2 msgid "Parallel Programming Course documentation" msgstr "Документация по курсу «Параллельное программирование»" @@ -34,5 +38,7 @@ msgid "" "Below is the table of contents for the Parallel Programming Course " "documentation. Follow the links to learn more about each topic." msgstr "" -"Ниже приведено оглавление документации по курсу «Параллельное программирование». " -"Вы можете перейти по ссылкам, чтобы узнать больше о каждой теме." +"Ниже приведено оглавление документации по курсу «Параллельное " +"программирование». Вы можете перейти по ссылкам, чтобы узнать больше о " +"каждой теме." + From 70b8b6fdadaece32da3f037db9baf5260ea5adc5 Mon Sep 17 00:00:00 2001 From: Nesterov Alexander Date: Tue, 4 Feb 2025 12:04:57 +0100 Subject: [PATCH 07/27] Update docs/common_information/points.rst Co-authored-by: Arseniy Obolenskiy --- docs/common_information/points.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/common_information/points.rst b/docs/common_information/points.rst index 60e0386a0..3f2e6944e 100644 --- a/docs/common_information/points.rst +++ b/docs/common_information/points.rst @@ -112,7 +112,7 @@ Points - Penalties: - A deadline will be set for each version. - - 1 point will be deducted from the version’s score for each day of + - 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. From e2722389e31cec54a6b074f59d71ec73e8738211 Mon Sep 17 00:00:00 2001 From: Nesterov Alexander Date: Tue, 4 Feb 2025 12:05:19 +0100 Subject: [PATCH 08/27] Update docs/common_information/processes_tasks.rst Co-authored-by: Arseniy Obolenskiy --- docs/common_information/processes_tasks.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/common_information/processes_tasks.rst b/docs/common_information/processes_tasks.rst index eae66848c..94066f627 100644 --- a/docs/common_information/processes_tasks.rst +++ b/docs/common_information/processes_tasks.rst @@ -293,7 +293,7 @@ Third task +---------------------------------------------------+------------------+ | 25 | Convex hull | | | construction – | -| | Jarvis’s march. | +| | Jarvis march. | +---------------------------------------------------+------------------+ | 26 | Linear image | | | filtering | From 56a6c30a24416e0f8fb2cbd34e1203beb60e25ba Mon Sep 17 00:00:00 2001 From: Nesterov Alexander Date: Tue, 4 Feb 2025 12:05:30 +0100 Subject: [PATCH 09/27] Update docs/common_information/processes_tasks.rst Co-authored-by: Arseniy Obolenskiy --- docs/common_information/processes_tasks.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/common_information/processes_tasks.rst b/docs/common_information/processes_tasks.rst index 94066f627..67f6dafed 100644 --- a/docs/common_information/processes_tasks.rst +++ b/docs/common_information/processes_tasks.rst @@ -355,7 +355,7 @@ Comments for tasks 2 and 3: Comments relevant for: =================== =================== - Varinats for task 2 Varinats for task 3 + Variants for task 2 Variants for task 3 =================== =================== 1 - 5 x =================== =================== From 35d7ce691214a6ef7e9d5a7d0a59637180f67b69 Mon Sep 17 00:00:00 2001 From: Nesterov Alexander Date: Tue, 4 Feb 2025 12:05:45 +0100 Subject: [PATCH 10/27] Update docs/common_information/report.rst Co-authored-by: Arseniy Obolenskiy --- docs/common_information/report.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/common_information/report.rst b/docs/common_information/report.rst index eab4a48ae..b9f16dba6 100644 --- a/docs/common_information/report.rst +++ b/docs/common_information/report.rst @@ -1,7 +1,7 @@ Report ====== -- Report’s points +- Report points +---------------------------+-------------+--------------------+------+ | Presence and Completeness | Text | Formatting Quality | T | From 4e06ba096c28038d01b0e4fb24f3ce258a65fbbe Mon Sep 17 00:00:00 2001 From: Nesterov Alexander Date: Tue, 4 Feb 2025 12:06:20 +0100 Subject: [PATCH 11/27] Update docs/common_information/threading_tasks.rst Co-authored-by: Arseniy Obolenskiy --- docs/common_information/threading_tasks.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/common_information/threading_tasks.rst b/docs/common_information/threading_tasks.rst index e79d4f4ac..c88a30a37 100644 --- a/docs/common_information/threading_tasks.rst +++ b/docs/common_information/threading_tasks.rst @@ -66,7 +66,7 @@ Threading tasks +--------+-------------------------------------------------------------+ | 22 | Convex hull construction – Graham’s scan. | +--------+-------------------------------------------------------------+ -| 23 | Convex hull construction – Jarvis’s march. | +| 23 | Convex hull construction – Jarvis march. | +--------+-------------------------------------------------------------+ | 24 | Linear image filtering (horizontal partition). Gaussian | | | kernel 3x3. | From f3c67f0bb10405c67b09f2b921e369428cd74408 Mon Sep 17 00:00:00 2001 From: Nesterov Alexander Date: Tue, 4 Feb 2025 12:06:30 +0100 Subject: [PATCH 12/27] Update docs/common_information/introduction.rst Co-authored-by: Arseniy Obolenskiy --- docs/common_information/introduction.rst | 31 ++++++++++++------------ 1 file changed, 15 insertions(+), 16 deletions(-) diff --git a/docs/common_information/introduction.rst b/docs/common_information/introduction.rst index 5587d9bd1..a58774c3b 100644 --- a/docs/common_information/introduction.rst +++ b/docs/common_information/introduction.rst @@ -25,22 +25,21 @@ Practice: a zero score for those tasks at the end of the semester. - All resources for using the repository will be provided here: - - `GIT-1 `__ - - `GIT-2 `__ - - `GIT-3 `__ - - `GIT CONFILCTS `__ - - `GTEST-1 `__ - - `GTEST-2 `__ - - `GITHUB ACTIONS `__ - - `MPI `__ - - `LaTeX-1 `__ - - `LaTeX-2 `__ - - `OpenMP `__ - - `TBB-1 `__ - - `TBB-2 `__ - - `std::thread-1 `__ - - `std::thread-2 `__ - - `std::thread-3 `__ + - `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 and check From 3024b89c36dc89210f1cd9df96e83545fc1eee37 Mon Sep 17 00:00:00 2001 From: Nesterov Alexander Date: Tue, 4 Feb 2025 12:06:36 +0100 Subject: [PATCH 13/27] Update docs/common_information/introduction.rst Co-authored-by: Arseniy Obolenskiy --- docs/common_information/introduction.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/common_information/introduction.rst b/docs/common_information/introduction.rst index a58774c3b..0ed5f7265 100644 --- a/docs/common_information/introduction.rst +++ b/docs/common_information/introduction.rst @@ -42,5 +42,5 @@ Practice: - `Introduction to Parallel Computing `__ \* *All instructions, repositories, and tables may be updated during the -learning process for better usability. Be prepared for changes and check +learning process for better usability. Be prepared for changes, check and update them periodically!!!* From b4bf75a6ad1186341b19539cc7369e4e31e91ef5 Mon Sep 17 00:00:00 2001 From: Nesterov Alexander Date: Tue, 4 Feb 2025 12:06:44 +0100 Subject: [PATCH 14/27] Update docs/common_information/introduction.rst Co-authored-by: Arseniy Obolenskiy --- docs/common_information/introduction.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/common_information/introduction.rst b/docs/common_information/introduction.rst index 0ed5f7265..dc9650c5e 100644 --- a/docs/common_information/introduction.rst +++ b/docs/common_information/introduction.rst @@ -22,7 +22,7 @@ Practice: - A task that has been merged into the master branch continues to be reviewed. 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 score for those tasks at the end of the semester. + 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 `__ From 21e89edc857ad789250bb5bf206a1e6c01b0d1cf Mon Sep 17 00:00:00 2001 From: Nesterov Alexander Date: Tue, 4 Feb 2025 12:06:51 +0100 Subject: [PATCH 15/27] Update docs/common_information/introduction.rst Co-authored-by: Arseniy Obolenskiy --- docs/common_information/introduction.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/common_information/introduction.rst b/docs/common_information/introduction.rst index dc9650c5e..da2b54c3b 100644 --- a/docs/common_information/introduction.rst +++ b/docs/common_information/introduction.rst @@ -18,7 +18,7 @@ Practice: instructions (**read it in full!!!**). - Additionally, each repository includes an example of a properly formatted PULL REQUEST. -- All tasks are mandatory. +- Submission of all tasks is mandatory to pass the course. - A task that has been merged into the master branch continues to be reviewed. 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 From b055d19f017fb80143cde11e954849db3d465e7b Mon Sep 17 00:00:00 2001 From: Nesterov Alexander Date: Tue, 4 Feb 2025 12:06:57 +0100 Subject: [PATCH 16/27] Update docs/common_information/introduction.rst Co-authored-by: Arseniy Obolenskiy --- docs/common_information/introduction.rst | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/docs/common_information/introduction.rst b/docs/common_information/introduction.rst index da2b54c3b..7b235ac9f 100644 --- a/docs/common_information/introduction.rst +++ b/docs/common_information/introduction.rst @@ -14,8 +14,8 @@ Practice: - Task distribution is random for each person. - An example for each technology can be found in the directory: ``tasks//example``. -- In each repository, the README.md contains a link to the build - instructions (**read it in full!!!**). +- 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. From 54a2d950dc3f4d2de08266b72a9615cab6c244b5 Mon Sep 17 00:00:00 2001 From: Nesterov Alexander Date: Tue, 4 Feb 2025 12:07:11 +0100 Subject: [PATCH 17/27] Update docs/common_information/threading_tasks.rst Co-authored-by: Arseniy Obolenskiy --- docs/common_information/threading_tasks.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/common_information/threading_tasks.rst b/docs/common_information/threading_tasks.rst index c88a30a37..1c2f114ec 100644 --- a/docs/common_information/threading_tasks.rst +++ b/docs/common_information/threading_tasks.rst @@ -13,7 +13,7 @@ Threading tasks | | scheme, Fox’s algorithm. | +--------+-------------------------------------------------------------+ | 3 | Dense matrix multiplication. Elements of type double. | -| | Strassen’s algorithm. | +| | Strassen algorithm. | +--------+-------------------------------------------------------------+ | 4 | Sparse matrix multiplication. Elements of type double. | | | Matrix storage format – row format (CRS). | From c7d1081709fa60b16794eb3626bad20345a802a6 Mon Sep 17 00:00:00 2001 From: Nesterov Alexander Date: Tue, 4 Feb 2025 12:07:23 +0100 Subject: [PATCH 18/27] Update docs/common_information/report.rst Co-authored-by: Arseniy Obolenskiy --- docs/common_information/report.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/common_information/report.rst b/docs/common_information/report.rst index b9f16dba6..268b90410 100644 --- a/docs/common_information/report.rst +++ b/docs/common_information/report.rst @@ -53,7 +53,7 @@ Report 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 remotely; the entire review process takes + - The report is reviewed online; the entire review process takes place in the request. The report is NOT submitted in person. - 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 From f38797c2a0cba9be5ec556a3275faa00c8528024 Mon Sep 17 00:00:00 2001 From: Nesterov Alexander Date: Tue, 4 Feb 2025 12:07:34 +0100 Subject: [PATCH 19/27] Update docs/common_information/introduction.rst Co-authored-by: Arseniy Obolenskiy --- docs/common_information/introduction.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/common_information/introduction.rst b/docs/common_information/introduction.rst index 7b235ac9f..cdc7aeca1 100644 --- a/docs/common_information/introduction.rst +++ b/docs/common_information/introduction.rst @@ -12,7 +12,7 @@ Practice: - Test verification - Task distribution is random for each person. -- An example for each technology can be found in the directory: +- 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!!!**). From fbf6b85e9966e9d05891ecb4e66b680f625d338d Mon Sep 17 00:00:00 2001 From: Nesterov Alexander Date: Tue, 4 Feb 2025 12:07:46 +0100 Subject: [PATCH 20/27] Update docs/common_information/introduction.rst Co-authored-by: Arseniy Obolenskiy --- docs/common_information/introduction.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/common_information/introduction.rst b/docs/common_information/introduction.rst index cdc7aeca1..2c0ef2c2d 100644 --- a/docs/common_information/introduction.rst +++ b/docs/common_information/introduction.rst @@ -20,7 +20,7 @@ Practice: 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 - reviewed. If a task fails in the master, it is disabled, and a record + 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: From eda6a549cd0ef7016a80b8bb5d8112f6544e1359 Mon Sep 17 00:00:00 2001 From: Nesterov Alexander Date: Tue, 4 Feb 2025 12:08:00 +0100 Subject: [PATCH 21/27] Update docs/common_information/introduction.rst Co-authored-by: Arseniy Obolenskiy --- docs/common_information/introduction.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/common_information/introduction.rst b/docs/common_information/introduction.rst index 2c0ef2c2d..7c9a23e2a 100644 --- a/docs/common_information/introduction.rst +++ b/docs/common_information/introduction.rst @@ -11,7 +11,7 @@ Practice: - Merge into the master branch - Test verification -- Task distribution is random for each person. +- 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 From c42b4ae4df687233801e5d84588159643f26dd0e Mon Sep 17 00:00:00 2001 From: Nesterov Alexander Date: Tue, 4 Feb 2025 12:08:12 +0100 Subject: [PATCH 22/27] Update docs/common_information/introduction.rst Co-authored-by: Arseniy Obolenskiy --- docs/common_information/introduction.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/common_information/introduction.rst b/docs/common_information/introduction.rst index 7c9a23e2a..8b73483c1 100644 --- a/docs/common_information/introduction.rst +++ b/docs/common_information/introduction.rst @@ -6,7 +6,7 @@ Practice: - We work online - - Use GitHub repository sysytem + - Use GitHub repository - Use Pull Requests - Merge into the master branch - Test verification From addd41c62edd303de8d88560847b3091a3497dc8 Mon Sep 17 00:00:00 2001 From: Nesterov Alexander Date: Tue, 4 Feb 2025 12:08:25 +0100 Subject: [PATCH 23/27] Update docs/common_information/report.rst Co-authored-by: Arseniy Obolenskiy --- docs/common_information/report.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/common_information/report.rst b/docs/common_information/report.rst index 268b90410..ea5e12f30 100644 --- a/docs/common_information/report.rst +++ b/docs/common_information/report.rst @@ -54,7 +54,7 @@ Report - 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. The report is NOT submitted in person. + 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 From 426fef249bfc48e9123318c96488843635dbff8d Mon Sep 17 00:00:00 2001 From: Nesterov Alexander Date: Tue, 4 Feb 2025 12:08:39 +0100 Subject: [PATCH 24/27] Update docs/common_information/points.rst Co-authored-by: Arseniy Obolenskiy --- docs/common_information/points.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/common_information/points.rst b/docs/common_information/points.rst index 3f2e6944e..2fab4f9b5 100644 --- a/docs/common_information/points.rst +++ b/docs/common_information/points.rst @@ -116,7 +116,7 @@ Points delay in submission. - The task is considered submitted when it is merged into the master/main branch. - - The submission date is counted from the last working commit. + - The submission time is defined as the timestamp of the last commit that successfully passes the CI pipeline. - Comments: From 37a873d907c630ce9b3241f3c3afe13416095fe4 Mon Sep 17 00:00:00 2001 From: Nesterov Alexander Date: Tue, 4 Feb 2025 12:08:58 +0100 Subject: [PATCH 25/27] Update docs/common_information/points.rst Co-authored-by: Arseniy Obolenskiy --- docs/common_information/points.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/common_information/points.rst b/docs/common_information/points.rst index 2fab4f9b5..c92358998 100644 --- a/docs/common_information/points.rst +++ b/docs/common_information/points.rst @@ -77,7 +77,7 @@ Points - Report +---------------------------+-------------+--------------------+------+ - | Presence and Completeness | Text | Formatting Quality | T | + | Completeness | Text | Formatting Quality | T | | | Quality | | otal | +===========================+=============+====================+======+ | 5 | 2.5 | 2.5 | 10 | From c67562e8628b601aa37203eeec56d940f209b014 Mon Sep 17 00:00:00 2001 From: Alexander Nesterov Date: Tue, 4 Feb 2025 22:07:50 +0100 Subject: [PATCH 26/27] add new rst version --- docs/common_information/introduction.rst | 23 +- docs/common_information/points.rst | 21 +- docs/common_information/processes_tasks.rst | 508 +++++++------------- docs/common_information/report.rst | 45 +- docs/common_information/threading_tasks.rst | 153 +++--- docs/index.rst | 12 +- 6 files changed, 282 insertions(+), 480 deletions(-) diff --git a/docs/common_information/introduction.rst b/docs/common_information/introduction.rst index 8b73483c1..564176156 100644 --- a/docs/common_information/introduction.rst +++ b/docs/common_information/introduction.rst @@ -1,8 +1,8 @@ Introduction ============ -Practice: -~~~~~~~~~ +Practice +~~~~~~~~ - We work online @@ -12,17 +12,12 @@ Practice: - 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. +- 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. +- 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 `__ @@ -41,6 +36,4 @@ Practice: - `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!!!* +\* *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 index c92358998..b819fa8a9 100644 --- a/docs/common_information/points.rst +++ b/docs/common_information/points.rst @@ -1,7 +1,7 @@ Points ====== -- For “processes” semester +- For “process parallelism” semester - 1st MPI task @@ -29,7 +29,7 @@ Points - **Total : 60 points** -- For “threading” semester +- For “thread parallelism” semester - Sequential version @@ -76,12 +76,11 @@ Points - Report - +---------------------------+-------------+--------------------+------+ - | Completeness | Text | Formatting Quality | T | - | | Quality | | otal | - +===========================+=============+====================+======+ - | 5 | 2.5 | 2.5 | 10 | - +---------------------------+-------------+--------------------+------+ + +--------------+--------------+--------------------+-------+ + | Completeness | Text Quality | Formatting Quality | Total | + +=============================+====================+=======+ + | 5 | 2.5 | 2.5 | 10 | + +--------------+--------------+--------------------+-------+ - Conversion of points into exam assessment or pass/fail @@ -112,10 +111,8 @@ Points - 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. + - 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: diff --git a/docs/common_information/processes_tasks.rst b/docs/common_information/processes_tasks.rst index 67f6dafed..f3e20965a 100644 --- a/docs/common_information/processes_tasks.rst +++ b/docs/common_information/processes_tasks.rst @@ -1,345 +1,193 @@ -Processes tasks -=============== +Processes parallelism tasks +=========================== First task ---------- -+----------+-----------------------------------------------------------+ -| Variant | Task | -| Number | | -+==========+===========================================================+ -| 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 | -+----------+-----------------------------------------------------------+ ++----------------+---------------------------------------------------------------------------------+ +| 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 | Task | -| Number | | -+==========+===========================================================+ -| 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 | -+----------+-----------------------------------------------------------+ ++----------------+-------------------------------------------------------------------------------------+ +| 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 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 | -| | (CRS). | -+---------------------------------------------------+------------------+ -| 5 | Sparse matrix | -| | multiplication. | -| | Elements of 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 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. | -+---------------------------------------------------+------------------+ ++----------------+----------------------------------------------------------------------------------------------------------+ +| 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: ~~~~~~~~~~~~~~~~~~~~~~~~~~~ diff --git a/docs/common_information/report.rst b/docs/common_information/report.rst index ea5e12f30..3230db325 100644 --- a/docs/common_information/report.rst +++ b/docs/common_information/report.rst @@ -3,26 +3,22 @@ Report - Report points - +---------------------------+-------------+--------------------+------+ - | Presence and Completeness | Text | Formatting Quality | T | - | | Quality | | otal | - +===========================+=============+====================+======+ - | 5 | 2.5 | 2.5 | 10 | - +---------------------------+-------------+--------------------+------+ + +--------------+--------------+--------------------+-------+ + | 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 (substantive) + - 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 + - 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 @@ -33,8 +29,7 @@ Report - Meaningfulness - Coherence - Clarity - - Quality of language (only the most obvious mistakes are - considered) + - Quality of language (only the most obvious mistakes are considered) - Formatting Quality @@ -42,21 +37,13 @@ Report - 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 + - 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 **in-person and remote** parts of the corresponding - lab work are fully completed. + - 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 index 1c2f114ec..03a85c67a 100644 --- a/docs/common_information/threading_tasks.rst +++ b/docs/common_information/threading_tasks.rst @@ -1,89 +1,66 @@ -Threading tasks -=============== +Thread parallelism tasks +======================== -+--------+-------------------------------------------------------------+ -| V | Tasks | -| ariant | | -| Number | | -+========+=============================================================+ -| 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 algorithm. | -+--------+-------------------------------------------------------------+ -| 4 | Sparse matrix multiplication. Elements of type double. | -| | Matrix storage format – row format (CRS). | -+--------+-------------------------------------------------------------+ -| 5 | Sparse matrix multiplication. Elements of type double. | -| | Matrix storage format – column format (CCS). | -+--------+-------------------------------------------------------------+ -| 6 | Sparse matrix multiplication. Complex type elements. Matrix | -| | storage format – row format (CRS). | -+--------+-------------------------------------------------------------+ -| 7 | Sparse matrix multiplication. Complex type elements. Matrix | -| | storage format – column format (CCS). | -+--------+-------------------------------------------------------------+ -| 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 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. | -+--------+-------------------------------------------------------------+ ++----------------+---------------------------------------------------------------------------------------------------------------------------------------------------+ +| 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 368885ad5..2d4e0d90c 100644 --- a/docs/index.rst +++ b/docs/index.rst @@ -15,10 +15,10 @@ Below is the table of contents for the Parallel Programming Course documentation .. toctree:: :maxdepth: 2 - :caption: Common Information: + :caption: Course Details: - common_information/introduction.rst - common_information/points.rst - common_information/processes_tasks.rst - common_information/report.rst - common_information/threading_tasks.rst + common_information/introduction + common_information/points + common_information/processes_tasks + common_information/report + common_information/threading_tasks From 2f49b9c580c1cf64a12c0eaa578d1d43864f4112 Mon Sep 17 00:00:00 2001 From: Alexander Nesterov Date: Wed, 5 Feb 2025 13:30:24 +0100 Subject: [PATCH 27/27] update new version --- .../common_information/introduction.po | 128 ++--- .../LC_MESSAGES/common_information/points.po | 109 ++-- .../common_information/processes_tasks.po | 474 +++++++++--------- .../LC_MESSAGES/common_information/report.po | 85 ++-- .../common_information/threading_tasks.po | 156 +++--- docs/locale/en/LC_MESSAGES/index.po | 7 +- .../common_information/introduction.po | 128 ++--- .../LC_MESSAGES/common_information/points.po | 109 ++-- .../common_information/processes_tasks.po | 474 +++++++++--------- .../LC_MESSAGES/common_information/report.po | 85 ++-- .../common_information/threading_tasks.po | 156 +++--- docs/locale/ru/LC_MESSAGES/index.po | 7 +- 12 files changed, 986 insertions(+), 932 deletions(-) diff --git a/docs/locale/en/LC_MESSAGES/common_information/introduction.po b/docs/locale/en/LC_MESSAGES/common_information/introduction.po index b3b1dcbd0..04cc6f15f 100644 --- a/docs/locale/en/LC_MESSAGES/common_information/introduction.po +++ b/docs/locale/en/LC_MESSAGES/common_information/introduction.po @@ -9,7 +9,7 @@ msgid "" msgstr "" "Project-Id-Version: Parallel Programming Course \n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-02-04 00:05+0100\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" @@ -25,7 +25,7 @@ msgid "Introduction" msgstr "" #: ../../common_information/introduction.rst:5 -msgid "Practice:" +msgid "Practice" msgstr "" #: ../../common_information/introduction.rst:7 @@ -33,7 +33,7 @@ msgid "We work online" msgstr "" #: ../../common_information/introduction.rst:9 -msgid "Use GitHub repository sysytem" +msgid "Use GitHub repository" msgstr "" #: ../../common_information/introduction.rst:10 @@ -49,120 +49,134 @@ msgid "Test verification" msgstr "" #: ../../common_information/introduction.rst:14 -msgid "Task distribution is random for each person." +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 directory: " -"``tasks//example``." +"An example for each technology can be found in the corresponding " +"directory: ``tasks//example``." msgstr "" -#: ../../common_information/introduction.rst:17 +#: ../../common_information/introduction.rst:16 msgid "" -"In each repository, the README.md contains a link to the build " -"instructions (**read it in full!!!**)." +"In each repository, the README.md contains a link to the course " +"documentation (**read it fully!!!**)." msgstr "" -#: ../../common_information/introduction.rst:19 +#: ../../common_information/introduction.rst:17 msgid "" "Additionally, each repository includes an example of a properly formatted" " PULL REQUEST." msgstr "" -#: ../../common_information/introduction.rst:21 -msgid "All tasks are mandatory." +#: ../../common_information/introduction.rst:18 +msgid "Submission of all tasks is mandatory to pass the course." msgstr "" -#: ../../common_information/introduction.rst:22 +#: ../../common_information/introduction.rst:19 msgid "" "A task that has been merged into the master branch continues to be " -"reviewed. 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 score for those tasks at the end of the semester." +"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:26 +#: ../../common_information/introduction.rst:21 msgid "All resources for using the repository will be provided here:" msgstr "" -#: ../../common_information/introduction.rst:28 -msgid "`GIT-1 `__" +#: ../../common_information/introduction.rst:23 +msgid "" +"`Git for half an hour: A Beginner’s Guide `__" msgstr "" -#: ../../common_information/introduction.rst:29 +#: ../../common_information/introduction.rst:24 #, python-format msgid "" -"`GIT-2 `__" msgstr "" -#: ../../common_information/introduction.rst:30 -msgid "`GIT-3 `__" +#: ../../common_information/introduction.rst:25 +msgid "" +"`Git: A Quick Start Guide to Using Core Operations with Explanations " +"`__" msgstr "" -#: ../../common_information/introduction.rst:31 -msgid "`GIT CONFILCTS `__" +#: ../../common_information/introduction.rst:26 +msgid "" +"`Conflicts resolving in Git " +"`__" msgstr "" -#: ../../common_information/introduction.rst:32 -msgid "`GTEST-1 `__" +#: ../../common_information/introduction.rst:27 +msgid "`Google testing framework (gtest) `__" msgstr "" -#: ../../common_information/introduction.rst:33 +#: ../../common_information/introduction.rst:28 msgid "" -"`GTEST-2 " -"`__" -msgstr "" - -#: ../../common_information/introduction.rst:34 -msgid "`GITHUB ACTIONS `__" +"`GoogleTest Primer " +"`__" msgstr "" -#: ../../common_information/introduction.rst:35 -msgid "`MPI `__" +#: ../../common_information/introduction.rst:29 +msgid "`GitHub Actions documentation `__" msgstr "" -#: ../../common_information/introduction.rst:36 -msgid "`LaTeX-1 `__" +#: ../../common_information/introduction.rst:30 +msgid "" +"`Parallel Programming Technologies. Message Passing Interface (MPI) " +"`__" msgstr "" -#: ../../common_information/introduction.rst:37 +#: ../../common_information/introduction.rst:31 msgid "" -"`LaTeX-2 " -"`__" +"`Typing and Layout in the System LaTeX `__" msgstr "" -#: ../../common_information/introduction.rst:38 -msgid "`OpenMP `__" +#: ../../common_information/introduction.rst:32 +msgid "" +"`LaTeX for the beginners " +"`__" msgstr "" -#: ../../common_information/introduction.rst:39 -msgid "`TBB-1 `__" +#: ../../common_information/introduction.rst:33 +msgid "`What is OpenMP? `__" msgstr "" -#: ../../common_information/introduction.rst:40 +#: ../../common_information/introduction.rst:34 msgid "" -"`TBB-2 " -"`__" +"`TBB-1 " +"`__" msgstr "" -#: ../../common_information/introduction.rst:41 -msgid "`std::thread-1 `__" +#: ../../common_information/introduction.rst:35 +msgid "" +"`Writing Multithreaded Applications in C++ `__" msgstr "" -#: ../../common_information/introduction.rst:42 -msgid "`std::thread-2 `__" +#: ../../common_information/introduction.rst:36 +msgid "" +"`Multithreading: New Features of the C++11 Standard " +"`__" msgstr "" -#: ../../common_information/introduction.rst:43 -msgid "`std::thread-3 `__" +#: ../../common_information/introduction.rst:37 +msgid "" +"`Introduction to Parallel Computing " +"`__" msgstr "" -#: ../../common_information/introduction.rst:45 +#: ../../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 and check" -" them periodically!!!*" +" 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 index 601aa57f0..fdd130c96 100644 --- a/docs/locale/en/LC_MESSAGES/common_information/points.po +++ b/docs/locale/en/LC_MESSAGES/common_information/points.po @@ -9,7 +9,7 @@ msgid "" msgstr "" "Project-Id-Version: Parallel Programming Course \n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-02-04 00:05+0100\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" @@ -25,7 +25,7 @@ msgid "Points" msgstr "" #: ../../common_information/points.rst:4 -msgid "For “processes” semester" +msgid "For “process parallelism” semester" msgstr "" #: ../../common_information/points.rst:6 @@ -48,9 +48,8 @@ msgstr "" #: ../../common_information/points.rst:11 #: ../../common_information/points.rst:19 -#: ../../common_information/points.rst:83 -#: ../../common_information/points.rst:93 -#: ../../common_information/points.rst:105 +#: ../../common_information/points.rst:92 +#: ../../common_information/points.rst:104 msgid "5" msgstr "" @@ -81,7 +80,7 @@ msgstr "" #: ../../common_information/points.rst:27 #: ../../common_information/points.rst:72 -#: ../../common_information/points.rst:83 +#: ../../common_information/points.rst:82 msgid "10" msgstr "" @@ -90,7 +89,7 @@ msgid "**Total : 60 points**" msgstr "" #: ../../common_information/points.rst:32 -msgid "For “threading” semester" +msgid "For “thread parallelism” semester" msgstr "" #: ../../common_information/points.rst:34 @@ -98,8 +97,8 @@ msgid "Sequential version" msgstr "" #: ../../common_information/points.rst:39 -#: ../../common_information/points.rst:96 -#: ../../common_information/points.rst:109 +#: ../../common_information/points.rst:95 +#: ../../common_information/points.rst:108 msgid "2" msgstr "" @@ -115,8 +114,8 @@ msgstr "" #: ../../common_information/points.rst:47 #: ../../common_information/points.rst:55 -#: ../../common_information/points.rst:95 -#: ../../common_information/points.rst:108 +#: ../../common_information/points.rst:94 +#: ../../common_information/points.rst:107 msgid "3" msgstr "" @@ -146,144 +145,146 @@ msgid "Report" msgstr "" #: ../../common_information/points.rst:80 -msgid "Presence and Completeness" +msgid "Completeness | Text Quality" msgstr "" #: ../../common_information/points.rst:80 -msgid "Text Quality" +msgid "Formatting Quality" msgstr "" #: ../../common_information/points.rst:80 -msgid "Formatting Quality" +msgid "Total" msgstr "" -#: ../../common_information/points.rst:80 -msgid "T otal" +#: ../../common_information/points.rst:82 +msgid "5 | 2.5" msgstr "" -#: ../../common_information/points.rst:83 +#: ../../common_information/points.rst:82 msgid "2.5" msgstr "" -#: ../../common_information/points.rst:86 +#: ../../common_information/points.rst:85 msgid "Conversion of points into exam assessment or pass/fail" msgstr "" -#: ../../common_information/points.rst:88 +#: ../../common_information/points.rst:87 msgid "For 5-point grading system" msgstr "" -#: ../../common_information/points.rst:91 -#: ../../common_information/points.rst:102 +#: ../../common_information/points.rst:90 +#: ../../common_information/points.rst:101 msgid "Points range" msgstr "" -#: ../../common_information/points.rst:91 -#: ../../common_information/points.rst:102 +#: ../../common_information/points.rst:90 +#: ../../common_information/points.rst:101 msgid "Exam Assessment" msgstr "" -#: ../../common_information/points.rst:91 -#: ../../common_information/points.rst:102 +#: ../../common_information/points.rst:90 +#: ../../common_information/points.rst:101 msgid "Student Pass" msgstr "" -#: ../../common_information/points.rst:93 +#: ../../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:95 +#: ../../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 -#: ../../common_information/points.rst:108 msgid "Passed" msgstr "" -#: ../../common_information/points.rst:94 +#: ../../common_information/points.rst:93 msgid "[70, 87)" msgstr "" -#: ../../common_information/points.rst:94 -#: ../../common_information/points.rst:107 +#: ../../common_information/points.rst:93 +#: ../../common_information/points.rst:106 msgid "4" msgstr "" -#: ../../common_information/points.rst:95 -#: ../../common_information/points.rst:108 +#: ../../common_information/points.rst:94 +#: ../../common_information/points.rst:107 msgid "[50, 70)" msgstr "" -#: ../../common_information/points.rst:96 -#: ../../common_information/points.rst:109 +#: ../../common_information/points.rst:95 +#: ../../common_information/points.rst:108 msgid "< 50" msgstr "" -#: ../../common_information/points.rst:96 -#: ../../common_information/points.rst:109 +#: ../../common_information/points.rst:95 +#: ../../common_information/points.rst:108 msgid "Not Passed" msgstr "" -#: ../../common_information/points.rst:99 +#: ../../common_information/points.rst:98 msgid "For 7-point grading system **(our current system)**" msgstr "" -#: ../../common_information/points.rst:104 +#: ../../common_information/points.rst:103 msgid "[99, 100]" msgstr "" -#: ../../common_information/points.rst:104 +#: ../../common_information/points.rst:103 msgid "5.5" msgstr "" -#: ../../common_information/points.rst:105 +#: ../../common_information/points.rst:104 msgid "[92, 99)" msgstr "" -#: ../../common_information/points.rst:106 +#: ../../common_information/points.rst:105 msgid "[82, 92)" msgstr "" -#: ../../common_information/points.rst:106 +#: ../../common_information/points.rst:105 msgid "4.5" msgstr "" -#: ../../common_information/points.rst:107 +#: ../../common_information/points.rst:106 msgid "[70, 82)" msgstr "" -#: ../../common_information/points.rst:112 +#: ../../common_information/points.rst:111 msgid "Penalties:" msgstr "" -#: ../../common_information/points.rst:114 +#: ../../common_information/points.rst:113 msgid "A deadline will be set for each version." msgstr "" -#: ../../common_information/points.rst:115 +#: ../../common_information/points.rst:114 msgid "" -"1 point will be deducted from the version’s score for each day of delay " -"in submission." +"1 point is deducted from the version’s score for each day of delay in " +"submission." msgstr "" -#: ../../common_information/points.rst:117 +#: ../../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:119 -msgid "The submission date is counted from the last working commit." +#: ../../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:121 +#: ../../common_information/points.rst:118 msgid "Comments:" msgstr "" -#: ../../common_information/points.rst:123 +#: ../../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 index cbfe8c779..2771f0cc6 100644 --- a/docs/locale/en/LC_MESSAGES/common_information/processes_tasks.po +++ b/docs/locale/en/LC_MESSAGES/common_information/processes_tasks.po @@ -9,7 +9,7 @@ msgid "" msgstr "" "Project-Id-Version: Parallel Programming Course \n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-02-04 00:05+0100\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" @@ -21,7 +21,7 @@ msgstr "" "Generated-By: Babel 2.17.0\n" #: ../../common_information/processes_tasks.rst:2 -msgid "Processes tasks" +msgid "Processes parallelism tasks" msgstr "" #: ../../common_information/processes_tasks.rst:5 @@ -29,576 +29,576 @@ msgid "First task" msgstr "" #: ../../common_information/processes_tasks.rst:8 -#: ../../common_information/processes_tasks.rst:75 -#: ../../common_information/processes_tasks.rst:131 +#: ../../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:75 -#: ../../common_information/processes_tasks.rst:131 +#: ../../common_information/processes_tasks.rst:69 +#: ../../common_information/processes_tasks.rst:122 msgid "Task" msgstr "" -#: ../../common_information/processes_tasks.rst:11 -#: ../../common_information/processes_tasks.rst:78 -#: ../../common_information/processes_tasks.rst:133 +#: ../../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:11 +#: ../../common_information/processes_tasks.rst:10 msgid "Sum of vector elements" msgstr "" -#: ../../common_information/processes_tasks.rst:13 -#: ../../common_information/processes_tasks.rst:80 -#: ../../common_information/processes_tasks.rst:140 +#: ../../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:13 +#: ../../common_information/processes_tasks.rst:12 msgid "Calculating the average value of vector elements" msgstr "" -#: ../../common_information/processes_tasks.rst:15 -#: ../../common_information/processes_tasks.rst:82 -#: ../../common_information/processes_tasks.rst:147 +#: ../../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:15 +#: ../../common_information/processes_tasks.rst:14 msgid "Maximum value of vector elements" msgstr "" -#: ../../common_information/processes_tasks.rst:17 -#: ../../common_information/processes_tasks.rst:84 -#: ../../common_information/processes_tasks.rst:154 +#: ../../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:17 +#: ../../common_information/processes_tasks.rst:16 msgid "Minimum value of vector elements" msgstr "" -#: ../../common_information/processes_tasks.rst:19 -#: ../../common_information/processes_tasks.rst:86 -#: ../../common_information/processes_tasks.rst:162 +#: ../../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:19 +#: ../../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:22 -#: ../../common_information/processes_tasks.rst:88 -#: ../../common_information/processes_tasks.rst:170 -#: ../../common_information/processes_tasks.rst:410 +#: ../../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:22 +#: ../../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:25 -#: ../../common_information/processes_tasks.rst:90 -#: ../../common_information/processes_tasks.rst:176 +#: ../../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:25 +#: ../../common_information/processes_tasks.rst:22 msgid "Finding the most similar adjacent elements of the vector" msgstr "" -#: ../../common_information/processes_tasks.rst:27 -#: ../../common_information/processes_tasks.rst:92 -#: ../../common_information/processes_tasks.rst:184 +#: ../../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:27 +#: ../../common_information/processes_tasks.rst:24 msgid "Finding the most different adjacent elements of the vector" msgstr "" -#: ../../common_information/processes_tasks.rst:30 -#: ../../common_information/processes_tasks.rst:94 -#: ../../common_information/processes_tasks.rst:192 +#: ../../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:30 +#: ../../common_information/processes_tasks.rst:26 msgid "Scalar product of vectors" msgstr "" -#: ../../common_information/processes_tasks.rst:32 -#: ../../common_information/processes_tasks.rst:96 -#: ../../common_information/processes_tasks.rst:200 +#: ../../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:32 +#: ../../common_information/processes_tasks.rst:28 msgid "Sum of matrix elements" msgstr "" -#: ../../common_information/processes_tasks.rst:34 -#: ../../common_information/processes_tasks.rst:98 -#: ../../common_information/processes_tasks.rst:206 +#: ../../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:34 +#: ../../common_information/processes_tasks.rst:30 msgid "Sum of values by rows in the matrix" msgstr "" -#: ../../common_information/processes_tasks.rst:36 -#: ../../common_information/processes_tasks.rst:100 -#: ../../common_information/processes_tasks.rst:216 +#: ../../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:36 +#: ../../common_information/processes_tasks.rst:32 msgid "Sum of values by columns in the matrix" msgstr "" -#: ../../common_information/processes_tasks.rst:38 -#: ../../common_information/processes_tasks.rst:102 -#: ../../common_information/processes_tasks.rst:226 +#: ../../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:38 +#: ../../common_information/processes_tasks.rst:34 msgid "Maximum value of matrix elements" msgstr "" -#: ../../common_information/processes_tasks.rst:40 -#: ../../common_information/processes_tasks.rst:105 -#: ../../common_information/processes_tasks.rst:236 +#: ../../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:40 +#: ../../common_information/processes_tasks.rst:36 msgid "Minimum value of matrix elements" msgstr "" -#: ../../common_information/processes_tasks.rst:42 -#: ../../common_information/processes_tasks.rst:108 -#: ../../common_information/processes_tasks.rst:239 +#: ../../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:42 +#: ../../common_information/processes_tasks.rst:38 msgid "Finding maximum values by rows in the matrix" msgstr "" -#: ../../common_information/processes_tasks.rst:44 -#: ../../common_information/processes_tasks.rst:110 -#: ../../common_information/processes_tasks.rst:244 +#: ../../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:44 +#: ../../common_information/processes_tasks.rst:40 msgid "Finding maximum values by columns in the matrix" msgstr "" -#: ../../common_information/processes_tasks.rst:46 -#: ../../common_information/processes_tasks.rst:112 -#: ../../common_information/processes_tasks.rst:247 +#: ../../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:46 +#: ../../common_information/processes_tasks.rst:42 msgid "Finding minimum values by rows in the matrix" msgstr "" -#: ../../common_information/processes_tasks.rst:48 -#: ../../common_information/processes_tasks.rst:114 -#: ../../common_information/processes_tasks.rst:252 +#: ../../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:48 +#: ../../common_information/processes_tasks.rst:44 msgid "Finding minimum values by columns in the matrix" msgstr "" -#: ../../common_information/processes_tasks.rst:50 -#: ../../common_information/processes_tasks.rst:116 -#: ../../common_information/processes_tasks.rst:256 +#: ../../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:50 +#: ../../common_information/processes_tasks.rst:46 msgid "Integration – rectangle method" msgstr "" -#: ../../common_information/processes_tasks.rst:52 -#: ../../common_information/processes_tasks.rst:118 -#: ../../common_information/processes_tasks.rst:262 +#: ../../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:52 +#: ../../common_information/processes_tasks.rst:48 msgid "Integration – trapezoidal method" msgstr "" -#: ../../common_information/processes_tasks.rst:54 -#: ../../common_information/processes_tasks.rst:120 +#: ../../common_information/processes_tasks.rst:50 +#: ../../common_information/processes_tasks.rst:111 +#: ../../common_information/processes_tasks.rst:167 #: ../../common_information/processes_tasks.rst:268 -#: ../../common_information/processes_tasks.rst:420 msgid "21" msgstr "" -#: ../../common_information/processes_tasks.rst:54 +#: ../../common_information/processes_tasks.rst:50 msgid "Integration – Monte Carlo method" msgstr "" -#: ../../common_information/processes_tasks.rst:56 -#: ../../common_information/processes_tasks.rst:122 -#: ../../common_information/processes_tasks.rst:276 +#: ../../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:56 +#: ../../common_information/processes_tasks.rst:52 msgid "Counting the number of alphabetical characters in a string" msgstr "" -#: ../../common_information/processes_tasks.rst:59 -#: ../../common_information/processes_tasks.rst:124 -#: ../../common_information/processes_tasks.rst:283 +#: ../../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:59 +#: ../../common_information/processes_tasks.rst:54 msgid "Counting the frequency of a character in a string" msgstr "" -#: ../../common_information/processes_tasks.rst:61 -#: ../../common_information/processes_tasks.rst:290 +#: ../../common_information/processes_tasks.rst:56 +#: ../../common_information/processes_tasks.rst:173 msgid "24" msgstr "" -#: ../../common_information/processes_tasks.rst:61 +#: ../../common_information/processes_tasks.rst:56 msgid "Counting the number of words in a string" msgstr "" -#: ../../common_information/processes_tasks.rst:63 -#: ../../common_information/processes_tasks.rst:294 +#: ../../common_information/processes_tasks.rst:58 +#: ../../common_information/processes_tasks.rst:175 msgid "25" msgstr "" -#: ../../common_information/processes_tasks.rst:63 +#: ../../common_information/processes_tasks.rst:58 msgid "Counting the number of sentences in a string" msgstr "" -#: ../../common_information/processes_tasks.rst:65 -#: ../../common_information/processes_tasks.rst:298 +#: ../../common_information/processes_tasks.rst:60 +#: ../../common_information/processes_tasks.rst:177 msgid "26" msgstr "" -#: ../../common_information/processes_tasks.rst:65 +#: ../../common_information/processes_tasks.rst:60 msgid "Checking lexicographical order of two strings" msgstr "" -#: ../../common_information/processes_tasks.rst:67 -#: ../../common_information/processes_tasks.rst:305 +#: ../../common_information/processes_tasks.rst:62 +#: ../../common_information/processes_tasks.rst:179 msgid "27" msgstr "" -#: ../../common_information/processes_tasks.rst:67 +#: ../../common_information/processes_tasks.rst:62 msgid "Counting the number of differing characters between two strings" msgstr "" -#: ../../common_information/processes_tasks.rst:72 +#: ../../common_information/processes_tasks.rst:66 msgid "Second task" msgstr "" -#: ../../common_information/processes_tasks.rst:78 +#: ../../common_information/processes_tasks.rst:71 msgid "Broadcast (one to all transfer)" msgstr "" -#: ../../common_information/processes_tasks.rst:80 +#: ../../common_information/processes_tasks.rst:73 msgid "Reduce (all to one transfer)" msgstr "" -#: ../../common_information/processes_tasks.rst:82 +#: ../../common_information/processes_tasks.rst:75 msgid "Allreduce (all to one and broadcast)" msgstr "" -#: ../../common_information/processes_tasks.rst:84 +#: ../../common_information/processes_tasks.rst:77 msgid "Scatter (one to all transfer)" msgstr "" -#: ../../common_information/processes_tasks.rst:86 +#: ../../common_information/processes_tasks.rst:79 msgid "Gather (all to one transfer)" msgstr "" -#: ../../common_information/processes_tasks.rst:88 +#: ../../common_information/processes_tasks.rst:81 msgid "Line" msgstr "" -#: ../../common_information/processes_tasks.rst:90 +#: ../../common_information/processes_tasks.rst:83 msgid "Ring" msgstr "" -#: ../../common_information/processes_tasks.rst:92 +#: ../../common_information/processes_tasks.rst:85 msgid "Star" msgstr "" -#: ../../common_information/processes_tasks.rst:94 +#: ../../common_information/processes_tasks.rst:87 msgid "Torus Grid" msgstr "" -#: ../../common_information/processes_tasks.rst:96 +#: ../../common_information/processes_tasks.rst:89 msgid "Hypercube" msgstr "" -#: ../../common_information/processes_tasks.rst:98 +#: ../../common_information/processes_tasks.rst:91 msgid "Horizontal strip scheme - matrix-vector multiplication" msgstr "" -#: ../../common_information/processes_tasks.rst:100 +#: ../../common_information/processes_tasks.rst:93 msgid "Vertical strip scheme - matrix-vector multiplication" msgstr "" -#: ../../common_information/processes_tasks.rst:102 +#: ../../common_information/processes_tasks.rst:95 msgid "" "Horizontal strip scheme – partitioning only matrix A - matrix-matrix " "multiplication" msgstr "" -#: ../../common_information/processes_tasks.rst:105 +#: ../../common_information/processes_tasks.rst:97 msgid "" "Horizontal strip scheme A, vertical strip scheme B - matrix-matrix " "multiplication" msgstr "" -#: ../../common_information/processes_tasks.rst:108 +#: ../../common_information/processes_tasks.rst:99 msgid "Gaussian method – horizontal strip scheme" msgstr "" -#: ../../common_information/processes_tasks.rst:110 +#: ../../common_information/processes_tasks.rst:101 msgid "Gaussian method – vertical strip scheme" msgstr "" -#: ../../common_information/processes_tasks.rst:112 +#: ../../common_information/processes_tasks.rst:103 msgid "Gauss-Jordan method" msgstr "" -#: ../../common_information/processes_tasks.rst:114 +#: ../../common_information/processes_tasks.rst:105 msgid "Iterative methods (Jacobi)" msgstr "" -#: ../../common_information/processes_tasks.rst:116 +#: ../../common_information/processes_tasks.rst:107 msgid "Iterative methods (Gauss-Seidel)" msgstr "" -#: ../../common_information/processes_tasks.rst:118 +#: ../../common_information/processes_tasks.rst:109 msgid "Iterative methods (Simple)" msgstr "" -#: ../../common_information/processes_tasks.rst:120 +#: ../../common_information/processes_tasks.rst:111 msgid "Bubble sort (odd-even transposition algorithm)" msgstr "" -#: ../../common_information/processes_tasks.rst:122 +#: ../../common_information/processes_tasks.rst:113 msgid "Image smoothing" msgstr "" -#: ../../common_information/processes_tasks.rst:124 +#: ../../common_information/processes_tasks.rst:115 msgid "Contrast enhancement" msgstr "" -#: ../../common_information/processes_tasks.rst:128 +#: ../../common_information/processes_tasks.rst:119 msgid "Third task" msgstr "" -#: ../../common_information/processes_tasks.rst:133 +#: ../../common_information/processes_tasks.rst:124 msgid "" -"Dense matrix multiplication. Elements of type double. Block scheme, " -"Cannon’s algorithm." +"Dense matrix multiplication. Elements of data type double. Block scheme, " +"Cannon's algorithm." msgstr "" -#: ../../common_information/processes_tasks.rst:140 +#: ../../common_information/processes_tasks.rst:126 msgid "" -"Dense matrix multiplication. Elements of type double. Block scheme, Fox’s" -" algorithm." +"Dense matrix multiplication. Elements of data type double. Block scheme, " +"Fox's algorithm." msgstr "" -#: ../../common_information/processes_tasks.rst:147 +#: ../../common_information/processes_tasks.rst:128 msgid "" -"Dense matrix multiplication. Elements of type double. Strassen’s " +"Dense matrix multiplication. Elements of data type double. Strassen's " "algorithm." msgstr "" -#: ../../common_information/processes_tasks.rst:154 +#: ../../common_information/processes_tasks.rst:130 msgid "" -"Sparse matrix multiplication. Elements of type double. Matrix storage " -"format – row format (CRS)." +"Sparse matrix multiplication. Elements of data type double. Matrix " +"storage format – row format (CRS)." msgstr "" -#: ../../common_information/processes_tasks.rst:162 +#: ../../common_information/processes_tasks.rst:132 msgid "" -"Sparse matrix multiplication. Elements of type double. Matrix storage " -"format – column format (CCS)." +"Sparse matrix multiplication. Elements of data type double. Matrix " +"storage format – column format (CCS)." msgstr "" -#: ../../common_information/processes_tasks.rst:170 +#: ../../common_information/processes_tasks.rst:134 msgid "Solving systems of linear equations using the conjugate gradient method." msgstr "" -#: ../../common_information/processes_tasks.rst:176 +#: ../../common_information/processes_tasks.rst:136 msgid "" "Computing multidimensional integrals using a multistep scheme (rectangle " "method)." msgstr "" -#: ../../common_information/processes_tasks.rst:184 +#: ../../common_information/processes_tasks.rst:138 msgid "" "Computing multidimensional integrals using a multistep scheme " "(trapezoidal method)." msgstr "" -#: ../../common_information/processes_tasks.rst:192 +#: ../../common_information/processes_tasks.rst:140 msgid "" -"Computing multidimensional integrals using a multistep scheme (Simpson’s " +"Computing multidimensional integrals using a multistep scheme (Simpson's " "method)." msgstr "" -#: ../../common_information/processes_tasks.rst:200 +#: ../../common_information/processes_tasks.rst:142 msgid "Computing multidimensional integrals using the Monte Carlo method." msgstr "" -#: ../../common_information/processes_tasks.rst:206 +#: ../../common_information/processes_tasks.rst:144 msgid "" -"Global search algorithm (Strongin’s) for one-dimensional optimization " +"Global search algorithm (Strongin's) for one-dimensional optimization " "problems. Parallelization by characteristics." msgstr "" -#: ../../common_information/processes_tasks.rst:216 +#: ../../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:226 +#: ../../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:236 +#: ../../common_information/processes_tasks.rst:153 msgid "Quick sort with simple merging." msgstr "" -#: ../../common_information/processes_tasks.rst:239 -msgid "Quick sort with odd-even merging (Batcher’s method)." +#: ../../common_information/processes_tasks.rst:155 +msgid "Quick sort with odd-even merging (Batcher's method)." msgstr "" -#: ../../common_information/processes_tasks.rst:244 +#: ../../common_information/processes_tasks.rst:157 msgid "Shell sort with simple merging." msgstr "" -#: ../../common_information/processes_tasks.rst:247 -msgid "Shell sort with odd-even merging (Batcher’s method)." +#: ../../common_information/processes_tasks.rst:159 +msgid "Shell sort with odd-even merging (Batcher's method)." msgstr "" -#: ../../common_information/processes_tasks.rst:252 +#: ../../common_information/processes_tasks.rst:161 msgid "Radix sort for integers with simple merging." msgstr "" -#: ../../common_information/processes_tasks.rst:256 -msgid "Radix sort for integers with odd-even merging (Batcher’s method)." +#: ../../common_information/processes_tasks.rst:163 +msgid "Radix sort for integers with odd-even merging (Batcher's method)." msgstr "" -#: ../../common_information/processes_tasks.rst:262 +#: ../../common_information/processes_tasks.rst:165 msgid "Radix sort for floating-point numbers (type double) with simple merging." msgstr "" -#: ../../common_information/processes_tasks.rst:268 +#: ../../common_information/processes_tasks.rst:167 msgid "" "Radix sort for floating-point numbers (type double) with odd-even merging" -" (Batcher’s method)." +" (Batcher's method)." msgstr "" -#: ../../common_information/processes_tasks.rst:276 +#: ../../common_information/processes_tasks.rst:169 msgid "" -"Shortest path search from one vertex (Dijkstra’s algorithm). With CRS " +"Shortest path search from one vertex (Dijkstra's algorithm). With CRS " "graphs." msgstr "" -#: ../../common_information/processes_tasks.rst:283 +#: ../../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:290 -msgid "Convex hull construction – Graham’s scan." +#: ../../common_information/processes_tasks.rst:173 +msgid "Convex hull construction – Graham's scan." msgstr "" -#: ../../common_information/processes_tasks.rst:294 -msgid "Convex hull construction – Jarvis’s march." +#: ../../common_information/processes_tasks.rst:175 +msgid "Convex hull construction – Jarvis's march." msgstr "" -#: ../../common_information/processes_tasks.rst:298 +#: ../../common_information/processes_tasks.rst:177 msgid "Linear image filtering (horizontal partition). Gaussian kernel 3x3." msgstr "" -#: ../../common_information/processes_tasks.rst:305 +#: ../../common_information/processes_tasks.rst:179 msgid "Linear image filtering (vertical partition). Gaussian kernel 3x3." msgstr "" -#: ../../common_information/processes_tasks.rst:312 +#: ../../common_information/processes_tasks.rst:181 msgid "28" msgstr "" -#: ../../common_information/processes_tasks.rst:312 +#: ../../common_information/processes_tasks.rst:181 msgid "Linear image filtering (block partition). Gaussian kernel 3x3." msgstr "" -#: ../../common_information/processes_tasks.rst:318 +#: ../../common_information/processes_tasks.rst:183 msgid "29" msgstr "" -#: ../../common_information/processes_tasks.rst:318 +#: ../../common_information/processes_tasks.rst:183 msgid "Edge detection in an image using the Sobel operator." msgstr "" -#: ../../common_information/processes_tasks.rst:323 +#: ../../common_information/processes_tasks.rst:185 msgid "30" msgstr "" -#: ../../common_information/processes_tasks.rst:323 +#: ../../common_information/processes_tasks.rst:185 msgid "Contrast enhancement of grayscale image using linear histogram stretching." msgstr "" -#: ../../common_information/processes_tasks.rst:330 +#: ../../common_information/processes_tasks.rst:187 msgid "31" msgstr "" -#: ../../common_information/processes_tasks.rst:330 +#: ../../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:338 +#: ../../common_information/processes_tasks.rst:189 msgid "32" msgstr "" -#: ../../common_information/processes_tasks.rst:338 +#: ../../common_information/processes_tasks.rst:189 msgid "Convex hull construction for components of a binary image." msgstr "" -#: ../../common_information/processes_tasks.rst:345 +#: ../../common_information/processes_tasks.rst:193 msgid "Comments for tasks 2 and 3:" msgstr "" -#: ../../common_information/processes_tasks.rst:347 +#: ../../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 " @@ -609,48 +609,36 @@ msgid "" "should be carried out using the ‘tree’ of processes.”" msgstr "" -#: ../../common_information/processes_tasks.rst:355 -#: ../../common_information/processes_tasks.rst:369 -#: ../../common_information/processes_tasks.rst:382 -#: ../../common_information/processes_tasks.rst:395 -#: ../../common_information/processes_tasks.rst:405 -#: ../../common_information/processes_tasks.rst:415 -#: ../../common_information/processes_tasks.rst:425 +#: ../../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:358 -#: ../../common_information/processes_tasks.rst:372 -#: ../../common_information/processes_tasks.rst:385 -#: ../../common_information/processes_tasks.rst:398 -#: ../../common_information/processes_tasks.rst:408 -#: ../../common_information/processes_tasks.rst:418 -#: ../../common_information/processes_tasks.rst:428 -msgid "Varinats for task 2" +#: ../../common_information/processes_tasks.rst:206 +msgid "Variants for task 2" msgstr "" -#: ../../common_information/processes_tasks.rst:358 -#: ../../common_information/processes_tasks.rst:372 -#: ../../common_information/processes_tasks.rst:385 -#: ../../common_information/processes_tasks.rst:398 -#: ../../common_information/processes_tasks.rst:408 -#: ../../common_information/processes_tasks.rst:418 -#: ../../common_information/processes_tasks.rst:428 -msgid "Varinats for task 3" +#: ../../common_information/processes_tasks.rst:206 +msgid "Variants for task 3" msgstr "" -#: ../../common_information/processes_tasks.rst:360 -#: ../../common_information/processes_tasks.rst:387 +#: ../../common_information/processes_tasks.rst:208 +#: ../../common_information/processes_tasks.rst:235 msgid "1 - 5" msgstr "" -#: ../../common_information/processes_tasks.rst:360 -#: ../../common_information/processes_tasks.rst:374 -#: ../../common_information/processes_tasks.rst:430 +#: ../../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:363 +#: ../../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 " @@ -659,57 +647,75 @@ msgid "" "MPI_Cart_Create and MPI_Graph_Create)”" msgstr "" -#: ../../common_information/processes_tasks.rst:374 +#: ../../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:377 +#: ../../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:387 +#: ../../common_information/processes_tasks.rst:235 msgid "11 - 14" msgstr "" -#: ../../common_information/processes_tasks.rst:390 +#: ../../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:400 +#: ../../common_information/processes_tasks.rst:248 msgid "26 - 27" msgstr "" -#: ../../common_information/processes_tasks.rst:400 +#: ../../common_information/processes_tasks.rst:248 msgid "24 - 32" msgstr "" -#: ../../common_information/processes_tasks.rst:403 +#: ../../common_information/processes_tasks.rst:251 msgid "SOLUTION OF A SYSTEM OF LINEAR ALGEBRAIC EQUATIONS" msgstr "" -#: ../../common_information/processes_tasks.rst:410 +#: ../../common_information/processes_tasks.rst:258 msgid "15 - 20" msgstr "" -#: ../../common_information/processes_tasks.rst:413 +#: ../../common_information/processes_tasks.rst:261 msgid "SORT ALGORITHMS" msgstr "" -#: ../../common_information/processes_tasks.rst:420 +#: ../../common_information/processes_tasks.rst:268 msgid "14 - 21" msgstr "" -#: ../../common_information/processes_tasks.rst:423 +#: ../../common_information/processes_tasks.rst:271 msgid "GRAPH PROCESSING ALGORITHMS" msgstr "" -#: ../../common_information/processes_tasks.rst:430 +#: ../../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 index 520678442..6e73b83a0 100644 --- a/docs/locale/en/LC_MESSAGES/common_information/report.po +++ b/docs/locale/en/LC_MESSAGES/common_information/report.po @@ -9,7 +9,7 @@ msgid "" msgstr "" "Project-Id-Version: Parallel Programming Course \n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-02-04 00:05+0100\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" @@ -25,156 +25,159 @@ msgid "Report" msgstr "" #: ../../common_information/report.rst:4 -msgid "Report’s points" +msgid "Report points" msgstr "" -#: ../../common_information/report.rst:7 ../../common_information/report.rst:15 -msgid "Presence and Completeness" +#: ../../common_information/report.rst:7 +msgid "Completeness" msgstr "" -#: ../../common_information/report.rst:7 ../../common_information/report.rst:31 +#: ../../common_information/report.rst:7 ../../common_information/report.rst:27 msgid "Text Quality" msgstr "" -#: ../../common_information/report.rst:7 ../../common_information/report.rst:39 +#: ../../common_information/report.rst:7 ../../common_information/report.rst:34 msgid "Formatting Quality" msgstr "" #: ../../common_information/report.rst:7 -msgid "T otal" +msgid "Total" msgstr "" -#: ../../common_information/report.rst:10 +#: ../../common_information/report.rst:9 msgid "5" msgstr "" -#: ../../common_information/report.rst:10 +#: ../../common_information/report.rst:9 msgid "2.5" msgstr "" -#: ../../common_information/report.rst:10 +#: ../../common_information/report.rst:9 msgid "10" msgstr "" -#: ../../common_information/report.rst:13 +#: ../../common_information/report.rst:12 msgid "Requirements for Criteria" msgstr "" -#: ../../common_information/report.rst:17 +#: ../../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:18 -msgid "Problem Statement (substantive)" +#: ../../common_information/report.rst:17 +msgid "Problem Statement (descriptive)" msgstr "" -#: ../../common_information/report.rst:19 +#: ../../common_information/report.rst:18 msgid "Algorithm Description" msgstr "" -#: ../../common_information/report.rst:20 +#: ../../common_information/report.rst:19 msgid "Description of the Parallel Algorithm Scheme" msgstr "" -#: ../../common_information/report.rst:21 +#: ../../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:24 +#: ../../common_information/report.rst:21 msgid "" "Experimental Results (execution time and algorithm quality assessment), " "description of correctness verification" msgstr "" -#: ../../common_information/report.rst:26 +#: ../../common_information/report.rst:22 msgid "Conclusions from the Results" msgstr "" -#: ../../common_information/report.rst:27 +#: ../../common_information/report.rst:23 msgid "Conclusion" msgstr "" -#: ../../common_information/report.rst:28 +#: ../../common_information/report.rst:24 msgid "References" msgstr "" -#: ../../common_information/report.rst:29 +#: ../../common_information/report.rst:25 msgid "Appendix (include code, ensuring readability)" msgstr "" -#: ../../common_information/report.rst:33 +#: ../../common_information/report.rst:29 msgid "Meaningfulness" msgstr "" -#: ../../common_information/report.rst:34 +#: ../../common_information/report.rst:30 msgid "Coherence" msgstr "" -#: ../../common_information/report.rst:35 +#: ../../common_information/report.rst:31 msgid "Clarity" msgstr "" -#: ../../common_information/report.rst:36 +#: ../../common_information/report.rst:32 msgid "Quality of language (only the most obvious mistakes are considered)" msgstr "" -#: ../../common_information/report.rst:41 +#: ../../common_information/report.rst:36 msgid "Requirements for Headings" msgstr "" -#: ../../common_information/report.rst:42 +#: ../../common_information/report.rst:37 msgid "Requirements for Text Alignment" msgstr "" -#: ../../common_information/report.rst:43 +#: ../../common_information/report.rst:38 msgid "Requirements for Paragraph Indentation" msgstr "" -#: ../../common_information/report.rst:44 +#: ../../common_information/report.rst:39 msgid "Requirements for the Formatting of Figures, Graphs, and Tables" msgstr "" -#: ../../common_information/report.rst:45 +#: ../../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:48 +#: ../../common_information/report.rst:42 msgid "Comments" msgstr "" -#: ../../common_information/report.rst:50 +#: ../../common_information/report.rst:44 msgid "Failure to meet the requirements will result in a deduction of points." msgstr "" -#: ../../common_information/report.rst:52 +#: ../../common_information/report.rst:45 msgid "" "The request will include points and comments regarding any requirement " "violations (if applicable)." msgstr "" -#: ../../common_information/report.rst:54 +#: ../../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:56 +#: ../../common_information/report.rst:47 msgid "" -"The report is reviewed remotely; the entire review process takes place in" -" the request. The report is NOT submitted in person." +"The report is reviewed online; the entire review process takes place in " +"the request." msgstr "" -#: ../../common_information/report.rst:58 +#: ../../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 " -"**in-person and remote** parts of the corresponding lab work are fully " -"completed." +"**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 index 95ed3f4cf..8b4ecef8f 100644 --- a/docs/locale/en/LC_MESSAGES/common_information/threading_tasks.po +++ b/docs/locale/en/LC_MESSAGES/common_information/threading_tasks.po @@ -9,7 +9,7 @@ msgid "" msgstr "" "Project-Id-Version: Parallel Programming Course \n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-02-04 00:05+0100\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" @@ -21,278 +21,278 @@ msgstr "" "Generated-By: Babel 2.17.0\n" #: ../../common_information/threading_tasks.rst:2 -msgid "Threading tasks" +msgid "Thread parallelism tasks" msgstr "" #: ../../common_information/threading_tasks.rst:5 -msgid "V ariant Number" +msgid "Variant Number" msgstr "" #: ../../common_information/threading_tasks.rst:5 msgid "Tasks" msgstr "" -#: ../../common_information/threading_tasks.rst:9 +#: ../../common_information/threading_tasks.rst:7 msgid "1" msgstr "" -#: ../../common_information/threading_tasks.rst:9 +#: ../../common_information/threading_tasks.rst:7 msgid "" "Dense matrix multiplication. Elements of type double. Block scheme, " -"Cannon’s algorithm." +"Cannon's algorithm." msgstr "" -#: ../../common_information/threading_tasks.rst:12 +#: ../../common_information/threading_tasks.rst:9 msgid "2" msgstr "" -#: ../../common_information/threading_tasks.rst:12 +#: ../../common_information/threading_tasks.rst:9 msgid "" -"Dense matrix multiplication. Elements of type double. Block scheme, Fox’s" +"Dense matrix multiplication. Elements of type double. Block scheme, Fox's" " algorithm." msgstr "" -#: ../../common_information/threading_tasks.rst:15 +#: ../../common_information/threading_tasks.rst:11 msgid "3" msgstr "" -#: ../../common_information/threading_tasks.rst:15 +#: ../../common_information/threading_tasks.rst:11 msgid "" -"Dense matrix multiplication. Elements of type double. Strassen’s " +"Dense matrix multiplication. Elements of type double. Strassen's " "algorithm." msgstr "" -#: ../../common_information/threading_tasks.rst:18 +#: ../../common_information/threading_tasks.rst:13 msgid "4" msgstr "" -#: ../../common_information/threading_tasks.rst:18 +#: ../../common_information/threading_tasks.rst:13 msgid "" "Sparse matrix multiplication. Elements of type double. Matrix storage " -"format – row format (CRS)." +"format – row format (Compressed Row Storage)." msgstr "" -#: ../../common_information/threading_tasks.rst:21 +#: ../../common_information/threading_tasks.rst:15 msgid "5" msgstr "" -#: ../../common_information/threading_tasks.rst:21 +#: ../../common_information/threading_tasks.rst:15 msgid "" "Sparse matrix multiplication. Elements of type double. Matrix storage " -"format – column format (CCS)." +"format – column format (Compressed Column Storage)." msgstr "" -#: ../../common_information/threading_tasks.rst:24 +#: ../../common_information/threading_tasks.rst:17 msgid "6" msgstr "" -#: ../../common_information/threading_tasks.rst:24 +#: ../../common_information/threading_tasks.rst:17 msgid "" "Sparse matrix multiplication. Complex type elements. Matrix storage " -"format – row format (CRS)." +"format – row format (Compressed Row Storage)." msgstr "" -#: ../../common_information/threading_tasks.rst:27 +#: ../../common_information/threading_tasks.rst:19 msgid "7" msgstr "" -#: ../../common_information/threading_tasks.rst:27 +#: ../../common_information/threading_tasks.rst:19 msgid "" "Sparse matrix multiplication. Complex type elements. Matrix storage " -"format – column format (CCS)." +"format – column format (Compressed Column Storage)." msgstr "" -#: ../../common_information/threading_tasks.rst:30 +#: ../../common_information/threading_tasks.rst:21 msgid "8" msgstr "" -#: ../../common_information/threading_tasks.rst:30 +#: ../../common_information/threading_tasks.rst:21 msgid "Solving systems of linear equations using the conjugate gradient method." msgstr "" -#: ../../common_information/threading_tasks.rst:33 +#: ../../common_information/threading_tasks.rst:23 msgid "9" msgstr "" -#: ../../common_information/threading_tasks.rst:33 +#: ../../common_information/threading_tasks.rst:23 msgid "" "Computing multidimensional integrals using a multistep scheme (rectangle " "method)." msgstr "" -#: ../../common_information/threading_tasks.rst:36 +#: ../../common_information/threading_tasks.rst:25 msgid "10" msgstr "" -#: ../../common_information/threading_tasks.rst:36 +#: ../../common_information/threading_tasks.rst:25 msgid "" "Computing multidimensional integrals using a multistep scheme " "(trapezoidal method)." msgstr "" -#: ../../common_information/threading_tasks.rst:39 +#: ../../common_information/threading_tasks.rst:27 msgid "11" msgstr "" -#: ../../common_information/threading_tasks.rst:39 +#: ../../common_information/threading_tasks.rst:27 msgid "" -"Computing multidimensional integrals using a multistep scheme (Simpson’s " +"Computing multidimensional integrals using a multistep scheme (Simpson's " "method)." msgstr "" -#: ../../common_information/threading_tasks.rst:42 +#: ../../common_information/threading_tasks.rst:29 msgid "12" msgstr "" -#: ../../common_information/threading_tasks.rst:42 +#: ../../common_information/threading_tasks.rst:29 msgid "Computing multidimensional integrals using the Monte Carlo method." msgstr "" -#: ../../common_information/threading_tasks.rst:45 +#: ../../common_information/threading_tasks.rst:31 msgid "13" msgstr "" -#: ../../common_information/threading_tasks.rst:45 +#: ../../common_information/threading_tasks.rst:31 msgid "Quick sort with simple merging." msgstr "" -#: ../../common_information/threading_tasks.rst:47 +#: ../../common_information/threading_tasks.rst:33 msgid "14" msgstr "" -#: ../../common_information/threading_tasks.rst:47 -msgid "Quick sort with odd-even merging (Batcher’s method)." +#: ../../common_information/threading_tasks.rst:33 +msgid "Quick sort with odd-even merging (Batcher's method)." msgstr "" -#: ../../common_information/threading_tasks.rst:49 +#: ../../common_information/threading_tasks.rst:35 msgid "15" msgstr "" -#: ../../common_information/threading_tasks.rst:49 +#: ../../common_information/threading_tasks.rst:35 msgid "Shell sort with simple merging." msgstr "" -#: ../../common_information/threading_tasks.rst:51 +#: ../../common_information/threading_tasks.rst:37 msgid "16" msgstr "" -#: ../../common_information/threading_tasks.rst:51 -msgid "Shell sort with odd-even merging (Batcher’s method)." +#: ../../common_information/threading_tasks.rst:37 +msgid "Shell sort with odd-even merging (Batcher's method)." msgstr "" -#: ../../common_information/threading_tasks.rst:53 +#: ../../common_information/threading_tasks.rst:39 msgid "17" msgstr "" -#: ../../common_information/threading_tasks.rst:53 +#: ../../common_information/threading_tasks.rst:39 msgid "Radix sort for integers with simple merging." msgstr "" -#: ../../common_information/threading_tasks.rst:55 +#: ../../common_information/threading_tasks.rst:41 msgid "18" msgstr "" -#: ../../common_information/threading_tasks.rst:55 -msgid "Radix sort for integers with odd-even merging (Batcher’s method)." +#: ../../common_information/threading_tasks.rst:41 +msgid "Radix sort for integers with odd-even merging (Batcher's method)." msgstr "" -#: ../../common_information/threading_tasks.rst:58 +#: ../../common_information/threading_tasks.rst:43 msgid "19" msgstr "" -#: ../../common_information/threading_tasks.rst:58 +#: ../../common_information/threading_tasks.rst:43 msgid "Radix sort for floating-point numbers (type double) with simple merging." msgstr "" -#: ../../common_information/threading_tasks.rst:61 +#: ../../common_information/threading_tasks.rst:45 msgid "20" msgstr "" -#: ../../common_information/threading_tasks.rst:61 +#: ../../common_information/threading_tasks.rst:45 msgid "" "Radix sort for floating-point numbers (type double) with odd-even merging" -" (Batcher’s method)." +" (Batcher's method)." msgstr "" -#: ../../common_information/threading_tasks.rst:64 +#: ../../common_information/threading_tasks.rst:47 msgid "21" msgstr "" -#: ../../common_information/threading_tasks.rst:64 -msgid "Shortest path search from one vertex (Dijkstra’s algorithm)." +#: ../../common_information/threading_tasks.rst:47 +msgid "Shortest path search from one vertex (Dijkstra's algorithm)." msgstr "" -#: ../../common_information/threading_tasks.rst:67 +#: ../../common_information/threading_tasks.rst:49 msgid "22" msgstr "" -#: ../../common_information/threading_tasks.rst:67 -msgid "Convex hull construction – Graham’s scan." +#: ../../common_information/threading_tasks.rst:49 +msgid "Convex hull construction – Graham's scan." msgstr "" -#: ../../common_information/threading_tasks.rst:69 +#: ../../common_information/threading_tasks.rst:51 msgid "23" msgstr "" -#: ../../common_information/threading_tasks.rst:69 -msgid "Convex hull construction – Jarvis’s march." +#: ../../common_information/threading_tasks.rst:51 +msgid "Convex hull construction – Jarvis's march." msgstr "" -#: ../../common_information/threading_tasks.rst:71 +#: ../../common_information/threading_tasks.rst:53 msgid "24" msgstr "" -#: ../../common_information/threading_tasks.rst:71 +#: ../../common_information/threading_tasks.rst:53 msgid "Linear image filtering (horizontal partition). Gaussian kernel 3x3." msgstr "" -#: ../../common_information/threading_tasks.rst:74 +#: ../../common_information/threading_tasks.rst:55 msgid "25" msgstr "" -#: ../../common_information/threading_tasks.rst:74 +#: ../../common_information/threading_tasks.rst:55 msgid "Linear image filtering (vertical partition). Gaussian kernel 3x3." msgstr "" -#: ../../common_information/threading_tasks.rst:77 +#: ../../common_information/threading_tasks.rst:57 msgid "26" msgstr "" -#: ../../common_information/threading_tasks.rst:77 +#: ../../common_information/threading_tasks.rst:57 msgid "Linear image filtering (block partition). Gaussian kernel 3x3." msgstr "" -#: ../../common_information/threading_tasks.rst:80 +#: ../../common_information/threading_tasks.rst:59 msgid "27" msgstr "" -#: ../../common_information/threading_tasks.rst:80 +#: ../../common_information/threading_tasks.rst:59 msgid "Edge detection in an image using the Sobel operator." msgstr "" -#: ../../common_information/threading_tasks.rst:82 +#: ../../common_information/threading_tasks.rst:61 msgid "28" msgstr "" -#: ../../common_information/threading_tasks.rst:82 +#: ../../common_information/threading_tasks.rst:61 msgid "Contrast enhancement of grayscale image using linear histogram stretching." msgstr "" -#: ../../common_information/threading_tasks.rst:85 +#: ../../common_information/threading_tasks.rst:63 msgid "29" msgstr "" -#: ../../common_information/threading_tasks.rst:85 +#: ../../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:88 +#: ../../common_information/threading_tasks.rst:65 msgid "30" msgstr "" -#: ../../common_information/threading_tasks.rst:88 +#: ../../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 325e9fc20..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-02-04 00:05+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" @@ -25,7 +25,7 @@ msgid "User Guide:" msgstr "" #: ../../index.rst:16 -msgid "Common Information:" +msgid "Course Details:" msgstr "" #: ../../index.rst:2 @@ -38,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 index 47f1ce542..dd836d0b6 100644 --- a/docs/locale/ru/LC_MESSAGES/common_information/introduction.po +++ b/docs/locale/ru/LC_MESSAGES/common_information/introduction.po @@ -9,7 +9,7 @@ msgid "" msgstr "" "Project-Id-Version: Parallel Programming Course \n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-02-04 00:05+0100\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" @@ -26,7 +26,7 @@ msgid "Introduction" msgstr "" #: ../../common_information/introduction.rst:5 -msgid "Practice:" +msgid "Practice" msgstr "" #: ../../common_information/introduction.rst:7 @@ -34,7 +34,7 @@ msgid "We work online" msgstr "" #: ../../common_information/introduction.rst:9 -msgid "Use GitHub repository sysytem" +msgid "Use GitHub repository" msgstr "" #: ../../common_information/introduction.rst:10 @@ -50,120 +50,134 @@ msgid "Test verification" msgstr "" #: ../../common_information/introduction.rst:14 -msgid "Task distribution is random for each person." +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 directory: " -"``tasks//example``." +"An example for each technology can be found in the corresponding " +"directory: ``tasks//example``." msgstr "" -#: ../../common_information/introduction.rst:17 +#: ../../common_information/introduction.rst:16 msgid "" -"In each repository, the README.md contains a link to the build " -"instructions (**read it in full!!!**)." +"In each repository, the README.md contains a link to the course " +"documentation (**read it fully!!!**)." msgstr "" -#: ../../common_information/introduction.rst:19 +#: ../../common_information/introduction.rst:17 msgid "" "Additionally, each repository includes an example of a properly formatted" " PULL REQUEST." msgstr "" -#: ../../common_information/introduction.rst:21 -msgid "All tasks are mandatory." +#: ../../common_information/introduction.rst:18 +msgid "Submission of all tasks is mandatory to pass the course." msgstr "" -#: ../../common_information/introduction.rst:22 +#: ../../common_information/introduction.rst:19 msgid "" "A task that has been merged into the master branch continues to be " -"reviewed. 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 score for those tasks at the end of the semester." +"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:26 +#: ../../common_information/introduction.rst:21 msgid "All resources for using the repository will be provided here:" msgstr "" -#: ../../common_information/introduction.rst:28 -msgid "`GIT-1 `__" +#: ../../common_information/introduction.rst:23 +msgid "" +"`Git for half an hour: A Beginner’s Guide `__" msgstr "" -#: ../../common_information/introduction.rst:29 +#: ../../common_information/introduction.rst:24 #, python-format msgid "" -"`GIT-2 `__" msgstr "" -#: ../../common_information/introduction.rst:30 -msgid "`GIT-3 `__" +#: ../../common_information/introduction.rst:25 +msgid "" +"`Git: A Quick Start Guide to Using Core Operations with Explanations " +"`__" msgstr "" -#: ../../common_information/introduction.rst:31 -msgid "`GIT CONFILCTS `__" +#: ../../common_information/introduction.rst:26 +msgid "" +"`Conflicts resolving in Git " +"`__" msgstr "" -#: ../../common_information/introduction.rst:32 -msgid "`GTEST-1 `__" +#: ../../common_information/introduction.rst:27 +msgid "`Google testing framework (gtest) `__" msgstr "" -#: ../../common_information/introduction.rst:33 +#: ../../common_information/introduction.rst:28 msgid "" -"`GTEST-2 " -"`__" -msgstr "" - -#: ../../common_information/introduction.rst:34 -msgid "`GITHUB ACTIONS `__" +"`GoogleTest Primer " +"`__" msgstr "" -#: ../../common_information/introduction.rst:35 -msgid "`MPI `__" +#: ../../common_information/introduction.rst:29 +msgid "`GitHub Actions documentation `__" msgstr "" -#: ../../common_information/introduction.rst:36 -msgid "`LaTeX-1 `__" +#: ../../common_information/introduction.rst:30 +msgid "" +"`Parallel Programming Technologies. Message Passing Interface (MPI) " +"`__" msgstr "" -#: ../../common_information/introduction.rst:37 +#: ../../common_information/introduction.rst:31 msgid "" -"`LaTeX-2 " -"`__" +"`Typing and Layout in the System LaTeX `__" msgstr "" -#: ../../common_information/introduction.rst:38 -msgid "`OpenMP `__" +#: ../../common_information/introduction.rst:32 +msgid "" +"`LaTeX for the beginners " +"`__" msgstr "" -#: ../../common_information/introduction.rst:39 -msgid "`TBB-1 `__" +#: ../../common_information/introduction.rst:33 +msgid "`What is OpenMP? `__" msgstr "" -#: ../../common_information/introduction.rst:40 +#: ../../common_information/introduction.rst:34 msgid "" -"`TBB-2 " -"`__" +"`TBB-1 " +"`__" msgstr "" -#: ../../common_information/introduction.rst:41 -msgid "`std::thread-1 `__" +#: ../../common_information/introduction.rst:35 +msgid "" +"`Writing Multithreaded Applications in C++ `__" msgstr "" -#: ../../common_information/introduction.rst:42 -msgid "`std::thread-2 `__" +#: ../../common_information/introduction.rst:36 +msgid "" +"`Multithreading: New Features of the C++11 Standard " +"`__" msgstr "" -#: ../../common_information/introduction.rst:43 -msgid "`std::thread-3 `__" +#: ../../common_information/introduction.rst:37 +msgid "" +"`Introduction to Parallel Computing " +"`__" msgstr "" -#: ../../common_information/introduction.rst:45 +#: ../../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 and check" -" them periodically!!!*" +" 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 index a88b6a6a5..a3d6cdc37 100644 --- a/docs/locale/ru/LC_MESSAGES/common_information/points.po +++ b/docs/locale/ru/LC_MESSAGES/common_information/points.po @@ -9,7 +9,7 @@ msgid "" msgstr "" "Project-Id-Version: Parallel Programming Course \n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-02-04 00:05+0100\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" @@ -26,7 +26,7 @@ msgid "Points" msgstr "" #: ../../common_information/points.rst:4 -msgid "For “processes” semester" +msgid "For “process parallelism” semester" msgstr "" #: ../../common_information/points.rst:6 @@ -49,9 +49,8 @@ msgstr "" #: ../../common_information/points.rst:11 #: ../../common_information/points.rst:19 -#: ../../common_information/points.rst:83 -#: ../../common_information/points.rst:93 -#: ../../common_information/points.rst:105 +#: ../../common_information/points.rst:92 +#: ../../common_information/points.rst:104 msgid "5" msgstr "" @@ -82,7 +81,7 @@ msgstr "" #: ../../common_information/points.rst:27 #: ../../common_information/points.rst:72 -#: ../../common_information/points.rst:83 +#: ../../common_information/points.rst:82 msgid "10" msgstr "" @@ -91,7 +90,7 @@ msgid "**Total : 60 points**" msgstr "" #: ../../common_information/points.rst:32 -msgid "For “threading” semester" +msgid "For “thread parallelism” semester" msgstr "" #: ../../common_information/points.rst:34 @@ -99,8 +98,8 @@ msgid "Sequential version" msgstr "" #: ../../common_information/points.rst:39 -#: ../../common_information/points.rst:96 -#: ../../common_information/points.rst:109 +#: ../../common_information/points.rst:95 +#: ../../common_information/points.rst:108 msgid "2" msgstr "" @@ -116,8 +115,8 @@ msgstr "" #: ../../common_information/points.rst:47 #: ../../common_information/points.rst:55 -#: ../../common_information/points.rst:95 -#: ../../common_information/points.rst:108 +#: ../../common_information/points.rst:94 +#: ../../common_information/points.rst:107 msgid "3" msgstr "" @@ -147,144 +146,146 @@ msgid "Report" msgstr "" #: ../../common_information/points.rst:80 -msgid "Presence and Completeness" +msgid "Completeness | Text Quality" msgstr "" #: ../../common_information/points.rst:80 -msgid "Text Quality" +msgid "Formatting Quality" msgstr "" #: ../../common_information/points.rst:80 -msgid "Formatting Quality" +msgid "Total" msgstr "" -#: ../../common_information/points.rst:80 -msgid "T otal" +#: ../../common_information/points.rst:82 +msgid "5 | 2.5" msgstr "" -#: ../../common_information/points.rst:83 +#: ../../common_information/points.rst:82 msgid "2.5" msgstr "" -#: ../../common_information/points.rst:86 +#: ../../common_information/points.rst:85 msgid "Conversion of points into exam assessment or pass/fail" msgstr "" -#: ../../common_information/points.rst:88 +#: ../../common_information/points.rst:87 msgid "For 5-point grading system" msgstr "" -#: ../../common_information/points.rst:91 -#: ../../common_information/points.rst:102 +#: ../../common_information/points.rst:90 +#: ../../common_information/points.rst:101 msgid "Points range" msgstr "" -#: ../../common_information/points.rst:91 -#: ../../common_information/points.rst:102 +#: ../../common_information/points.rst:90 +#: ../../common_information/points.rst:101 msgid "Exam Assessment" msgstr "" -#: ../../common_information/points.rst:91 -#: ../../common_information/points.rst:102 +#: ../../common_information/points.rst:90 +#: ../../common_information/points.rst:101 msgid "Student Pass" msgstr "" -#: ../../common_information/points.rst:93 +#: ../../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:95 +#: ../../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 -#: ../../common_information/points.rst:108 msgid "Passed" msgstr "" -#: ../../common_information/points.rst:94 +#: ../../common_information/points.rst:93 msgid "[70, 87)" msgstr "" -#: ../../common_information/points.rst:94 -#: ../../common_information/points.rst:107 +#: ../../common_information/points.rst:93 +#: ../../common_information/points.rst:106 msgid "4" msgstr "" -#: ../../common_information/points.rst:95 -#: ../../common_information/points.rst:108 +#: ../../common_information/points.rst:94 +#: ../../common_information/points.rst:107 msgid "[50, 70)" msgstr "" -#: ../../common_information/points.rst:96 -#: ../../common_information/points.rst:109 +#: ../../common_information/points.rst:95 +#: ../../common_information/points.rst:108 msgid "< 50" msgstr "" -#: ../../common_information/points.rst:96 -#: ../../common_information/points.rst:109 +#: ../../common_information/points.rst:95 +#: ../../common_information/points.rst:108 msgid "Not Passed" msgstr "" -#: ../../common_information/points.rst:99 +#: ../../common_information/points.rst:98 msgid "For 7-point grading system **(our current system)**" msgstr "" -#: ../../common_information/points.rst:104 +#: ../../common_information/points.rst:103 msgid "[99, 100]" msgstr "" -#: ../../common_information/points.rst:104 +#: ../../common_information/points.rst:103 msgid "5.5" msgstr "" -#: ../../common_information/points.rst:105 +#: ../../common_information/points.rst:104 msgid "[92, 99)" msgstr "" -#: ../../common_information/points.rst:106 +#: ../../common_information/points.rst:105 msgid "[82, 92)" msgstr "" -#: ../../common_information/points.rst:106 +#: ../../common_information/points.rst:105 msgid "4.5" msgstr "" -#: ../../common_information/points.rst:107 +#: ../../common_information/points.rst:106 msgid "[70, 82)" msgstr "" -#: ../../common_information/points.rst:112 +#: ../../common_information/points.rst:111 msgid "Penalties:" msgstr "" -#: ../../common_information/points.rst:114 +#: ../../common_information/points.rst:113 msgid "A deadline will be set for each version." msgstr "" -#: ../../common_information/points.rst:115 +#: ../../common_information/points.rst:114 msgid "" -"1 point will be deducted from the version’s score for each day of delay " -"in submission." +"1 point is deducted from the version’s score for each day of delay in " +"submission." msgstr "" -#: ../../common_information/points.rst:117 +#: ../../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:119 -msgid "The submission date is counted from the last working commit." +#: ../../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:121 +#: ../../common_information/points.rst:118 msgid "Comments:" msgstr "" -#: ../../common_information/points.rst:123 +#: ../../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 index f38742234..94401b366 100644 --- a/docs/locale/ru/LC_MESSAGES/common_information/processes_tasks.po +++ b/docs/locale/ru/LC_MESSAGES/common_information/processes_tasks.po @@ -9,7 +9,7 @@ msgid "" msgstr "" "Project-Id-Version: Parallel Programming Course \n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-02-04 00:05+0100\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" @@ -22,7 +22,7 @@ msgstr "" "Generated-By: Babel 2.17.0\n" #: ../../common_information/processes_tasks.rst:2 -msgid "Processes tasks" +msgid "Processes parallelism tasks" msgstr "" #: ../../common_information/processes_tasks.rst:5 @@ -30,576 +30,576 @@ msgid "First task" msgstr "" #: ../../common_information/processes_tasks.rst:8 -#: ../../common_information/processes_tasks.rst:75 -#: ../../common_information/processes_tasks.rst:131 +#: ../../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:75 -#: ../../common_information/processes_tasks.rst:131 +#: ../../common_information/processes_tasks.rst:69 +#: ../../common_information/processes_tasks.rst:122 msgid "Task" msgstr "" -#: ../../common_information/processes_tasks.rst:11 -#: ../../common_information/processes_tasks.rst:78 -#: ../../common_information/processes_tasks.rst:133 +#: ../../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:11 +#: ../../common_information/processes_tasks.rst:10 msgid "Sum of vector elements" msgstr "" -#: ../../common_information/processes_tasks.rst:13 -#: ../../common_information/processes_tasks.rst:80 -#: ../../common_information/processes_tasks.rst:140 +#: ../../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:13 +#: ../../common_information/processes_tasks.rst:12 msgid "Calculating the average value of vector elements" msgstr "" -#: ../../common_information/processes_tasks.rst:15 -#: ../../common_information/processes_tasks.rst:82 -#: ../../common_information/processes_tasks.rst:147 +#: ../../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:15 +#: ../../common_information/processes_tasks.rst:14 msgid "Maximum value of vector elements" msgstr "" -#: ../../common_information/processes_tasks.rst:17 -#: ../../common_information/processes_tasks.rst:84 -#: ../../common_information/processes_tasks.rst:154 +#: ../../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:17 +#: ../../common_information/processes_tasks.rst:16 msgid "Minimum value of vector elements" msgstr "" -#: ../../common_information/processes_tasks.rst:19 -#: ../../common_information/processes_tasks.rst:86 -#: ../../common_information/processes_tasks.rst:162 +#: ../../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:19 +#: ../../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:22 -#: ../../common_information/processes_tasks.rst:88 -#: ../../common_information/processes_tasks.rst:170 -#: ../../common_information/processes_tasks.rst:410 +#: ../../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:22 +#: ../../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:25 -#: ../../common_information/processes_tasks.rst:90 -#: ../../common_information/processes_tasks.rst:176 +#: ../../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:25 +#: ../../common_information/processes_tasks.rst:22 msgid "Finding the most similar adjacent elements of the vector" msgstr "" -#: ../../common_information/processes_tasks.rst:27 -#: ../../common_information/processes_tasks.rst:92 -#: ../../common_information/processes_tasks.rst:184 +#: ../../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:27 +#: ../../common_information/processes_tasks.rst:24 msgid "Finding the most different adjacent elements of the vector" msgstr "" -#: ../../common_information/processes_tasks.rst:30 -#: ../../common_information/processes_tasks.rst:94 -#: ../../common_information/processes_tasks.rst:192 +#: ../../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:30 +#: ../../common_information/processes_tasks.rst:26 msgid "Scalar product of vectors" msgstr "" -#: ../../common_information/processes_tasks.rst:32 -#: ../../common_information/processes_tasks.rst:96 -#: ../../common_information/processes_tasks.rst:200 +#: ../../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:32 +#: ../../common_information/processes_tasks.rst:28 msgid "Sum of matrix elements" msgstr "" -#: ../../common_information/processes_tasks.rst:34 -#: ../../common_information/processes_tasks.rst:98 -#: ../../common_information/processes_tasks.rst:206 +#: ../../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:34 +#: ../../common_information/processes_tasks.rst:30 msgid "Sum of values by rows in the matrix" msgstr "" -#: ../../common_information/processes_tasks.rst:36 -#: ../../common_information/processes_tasks.rst:100 -#: ../../common_information/processes_tasks.rst:216 +#: ../../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:36 +#: ../../common_information/processes_tasks.rst:32 msgid "Sum of values by columns in the matrix" msgstr "" -#: ../../common_information/processes_tasks.rst:38 -#: ../../common_information/processes_tasks.rst:102 -#: ../../common_information/processes_tasks.rst:226 +#: ../../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:38 +#: ../../common_information/processes_tasks.rst:34 msgid "Maximum value of matrix elements" msgstr "" -#: ../../common_information/processes_tasks.rst:40 -#: ../../common_information/processes_tasks.rst:105 -#: ../../common_information/processes_tasks.rst:236 +#: ../../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:40 +#: ../../common_information/processes_tasks.rst:36 msgid "Minimum value of matrix elements" msgstr "" -#: ../../common_information/processes_tasks.rst:42 -#: ../../common_information/processes_tasks.rst:108 -#: ../../common_information/processes_tasks.rst:239 +#: ../../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:42 +#: ../../common_information/processes_tasks.rst:38 msgid "Finding maximum values by rows in the matrix" msgstr "" -#: ../../common_information/processes_tasks.rst:44 -#: ../../common_information/processes_tasks.rst:110 -#: ../../common_information/processes_tasks.rst:244 +#: ../../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:44 +#: ../../common_information/processes_tasks.rst:40 msgid "Finding maximum values by columns in the matrix" msgstr "" -#: ../../common_information/processes_tasks.rst:46 -#: ../../common_information/processes_tasks.rst:112 -#: ../../common_information/processes_tasks.rst:247 +#: ../../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:46 +#: ../../common_information/processes_tasks.rst:42 msgid "Finding minimum values by rows in the matrix" msgstr "" -#: ../../common_information/processes_tasks.rst:48 -#: ../../common_information/processes_tasks.rst:114 -#: ../../common_information/processes_tasks.rst:252 +#: ../../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:48 +#: ../../common_information/processes_tasks.rst:44 msgid "Finding minimum values by columns in the matrix" msgstr "" -#: ../../common_information/processes_tasks.rst:50 -#: ../../common_information/processes_tasks.rst:116 -#: ../../common_information/processes_tasks.rst:256 +#: ../../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:50 +#: ../../common_information/processes_tasks.rst:46 msgid "Integration – rectangle method" msgstr "" -#: ../../common_information/processes_tasks.rst:52 -#: ../../common_information/processes_tasks.rst:118 -#: ../../common_information/processes_tasks.rst:262 +#: ../../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:52 +#: ../../common_information/processes_tasks.rst:48 msgid "Integration – trapezoidal method" msgstr "" -#: ../../common_information/processes_tasks.rst:54 -#: ../../common_information/processes_tasks.rst:120 +#: ../../common_information/processes_tasks.rst:50 +#: ../../common_information/processes_tasks.rst:111 +#: ../../common_information/processes_tasks.rst:167 #: ../../common_information/processes_tasks.rst:268 -#: ../../common_information/processes_tasks.rst:420 msgid "21" msgstr "" -#: ../../common_information/processes_tasks.rst:54 +#: ../../common_information/processes_tasks.rst:50 msgid "Integration – Monte Carlo method" msgstr "" -#: ../../common_information/processes_tasks.rst:56 -#: ../../common_information/processes_tasks.rst:122 -#: ../../common_information/processes_tasks.rst:276 +#: ../../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:56 +#: ../../common_information/processes_tasks.rst:52 msgid "Counting the number of alphabetical characters in a string" msgstr "" -#: ../../common_information/processes_tasks.rst:59 -#: ../../common_information/processes_tasks.rst:124 -#: ../../common_information/processes_tasks.rst:283 +#: ../../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:59 +#: ../../common_information/processes_tasks.rst:54 msgid "Counting the frequency of a character in a string" msgstr "" -#: ../../common_information/processes_tasks.rst:61 -#: ../../common_information/processes_tasks.rst:290 +#: ../../common_information/processes_tasks.rst:56 +#: ../../common_information/processes_tasks.rst:173 msgid "24" msgstr "" -#: ../../common_information/processes_tasks.rst:61 +#: ../../common_information/processes_tasks.rst:56 msgid "Counting the number of words in a string" msgstr "" -#: ../../common_information/processes_tasks.rst:63 -#: ../../common_information/processes_tasks.rst:294 +#: ../../common_information/processes_tasks.rst:58 +#: ../../common_information/processes_tasks.rst:175 msgid "25" msgstr "" -#: ../../common_information/processes_tasks.rst:63 +#: ../../common_information/processes_tasks.rst:58 msgid "Counting the number of sentences in a string" msgstr "" -#: ../../common_information/processes_tasks.rst:65 -#: ../../common_information/processes_tasks.rst:298 +#: ../../common_information/processes_tasks.rst:60 +#: ../../common_information/processes_tasks.rst:177 msgid "26" msgstr "" -#: ../../common_information/processes_tasks.rst:65 +#: ../../common_information/processes_tasks.rst:60 msgid "Checking lexicographical order of two strings" msgstr "" -#: ../../common_information/processes_tasks.rst:67 -#: ../../common_information/processes_tasks.rst:305 +#: ../../common_information/processes_tasks.rst:62 +#: ../../common_information/processes_tasks.rst:179 msgid "27" msgstr "" -#: ../../common_information/processes_tasks.rst:67 +#: ../../common_information/processes_tasks.rst:62 msgid "Counting the number of differing characters between two strings" msgstr "" -#: ../../common_information/processes_tasks.rst:72 +#: ../../common_information/processes_tasks.rst:66 msgid "Second task" msgstr "" -#: ../../common_information/processes_tasks.rst:78 +#: ../../common_information/processes_tasks.rst:71 msgid "Broadcast (one to all transfer)" msgstr "" -#: ../../common_information/processes_tasks.rst:80 +#: ../../common_information/processes_tasks.rst:73 msgid "Reduce (all to one transfer)" msgstr "" -#: ../../common_information/processes_tasks.rst:82 +#: ../../common_information/processes_tasks.rst:75 msgid "Allreduce (all to one and broadcast)" msgstr "" -#: ../../common_information/processes_tasks.rst:84 +#: ../../common_information/processes_tasks.rst:77 msgid "Scatter (one to all transfer)" msgstr "" -#: ../../common_information/processes_tasks.rst:86 +#: ../../common_information/processes_tasks.rst:79 msgid "Gather (all to one transfer)" msgstr "" -#: ../../common_information/processes_tasks.rst:88 +#: ../../common_information/processes_tasks.rst:81 msgid "Line" msgstr "" -#: ../../common_information/processes_tasks.rst:90 +#: ../../common_information/processes_tasks.rst:83 msgid "Ring" msgstr "" -#: ../../common_information/processes_tasks.rst:92 +#: ../../common_information/processes_tasks.rst:85 msgid "Star" msgstr "" -#: ../../common_information/processes_tasks.rst:94 +#: ../../common_information/processes_tasks.rst:87 msgid "Torus Grid" msgstr "" -#: ../../common_information/processes_tasks.rst:96 +#: ../../common_information/processes_tasks.rst:89 msgid "Hypercube" msgstr "" -#: ../../common_information/processes_tasks.rst:98 +#: ../../common_information/processes_tasks.rst:91 msgid "Horizontal strip scheme - matrix-vector multiplication" msgstr "" -#: ../../common_information/processes_tasks.rst:100 +#: ../../common_information/processes_tasks.rst:93 msgid "Vertical strip scheme - matrix-vector multiplication" msgstr "" -#: ../../common_information/processes_tasks.rst:102 +#: ../../common_information/processes_tasks.rst:95 msgid "" "Horizontal strip scheme – partitioning only matrix A - matrix-matrix " "multiplication" msgstr "" -#: ../../common_information/processes_tasks.rst:105 +#: ../../common_information/processes_tasks.rst:97 msgid "" "Horizontal strip scheme A, vertical strip scheme B - matrix-matrix " "multiplication" msgstr "" -#: ../../common_information/processes_tasks.rst:108 +#: ../../common_information/processes_tasks.rst:99 msgid "Gaussian method – horizontal strip scheme" msgstr "" -#: ../../common_information/processes_tasks.rst:110 +#: ../../common_information/processes_tasks.rst:101 msgid "Gaussian method – vertical strip scheme" msgstr "" -#: ../../common_information/processes_tasks.rst:112 +#: ../../common_information/processes_tasks.rst:103 msgid "Gauss-Jordan method" msgstr "" -#: ../../common_information/processes_tasks.rst:114 +#: ../../common_information/processes_tasks.rst:105 msgid "Iterative methods (Jacobi)" msgstr "" -#: ../../common_information/processes_tasks.rst:116 +#: ../../common_information/processes_tasks.rst:107 msgid "Iterative methods (Gauss-Seidel)" msgstr "" -#: ../../common_information/processes_tasks.rst:118 +#: ../../common_information/processes_tasks.rst:109 msgid "Iterative methods (Simple)" msgstr "" -#: ../../common_information/processes_tasks.rst:120 +#: ../../common_information/processes_tasks.rst:111 msgid "Bubble sort (odd-even transposition algorithm)" msgstr "" -#: ../../common_information/processes_tasks.rst:122 +#: ../../common_information/processes_tasks.rst:113 msgid "Image smoothing" msgstr "" -#: ../../common_information/processes_tasks.rst:124 +#: ../../common_information/processes_tasks.rst:115 msgid "Contrast enhancement" msgstr "" -#: ../../common_information/processes_tasks.rst:128 +#: ../../common_information/processes_tasks.rst:119 msgid "Third task" msgstr "" -#: ../../common_information/processes_tasks.rst:133 +#: ../../common_information/processes_tasks.rst:124 msgid "" -"Dense matrix multiplication. Elements of type double. Block scheme, " -"Cannon’s algorithm." +"Dense matrix multiplication. Elements of data type double. Block scheme, " +"Cannon's algorithm." msgstr "" -#: ../../common_information/processes_tasks.rst:140 +#: ../../common_information/processes_tasks.rst:126 msgid "" -"Dense matrix multiplication. Elements of type double. Block scheme, Fox’s" -" algorithm." +"Dense matrix multiplication. Elements of data type double. Block scheme, " +"Fox's algorithm." msgstr "" -#: ../../common_information/processes_tasks.rst:147 +#: ../../common_information/processes_tasks.rst:128 msgid "" -"Dense matrix multiplication. Elements of type double. Strassen’s " +"Dense matrix multiplication. Elements of data type double. Strassen's " "algorithm." msgstr "" -#: ../../common_information/processes_tasks.rst:154 +#: ../../common_information/processes_tasks.rst:130 msgid "" -"Sparse matrix multiplication. Elements of type double. Matrix storage " -"format – row format (CRS)." +"Sparse matrix multiplication. Elements of data type double. Matrix " +"storage format – row format (CRS)." msgstr "" -#: ../../common_information/processes_tasks.rst:162 +#: ../../common_information/processes_tasks.rst:132 msgid "" -"Sparse matrix multiplication. Elements of type double. Matrix storage " -"format – column format (CCS)." +"Sparse matrix multiplication. Elements of data type double. Matrix " +"storage format – column format (CCS)." msgstr "" -#: ../../common_information/processes_tasks.rst:170 +#: ../../common_information/processes_tasks.rst:134 msgid "Solving systems of linear equations using the conjugate gradient method." msgstr "" -#: ../../common_information/processes_tasks.rst:176 +#: ../../common_information/processes_tasks.rst:136 msgid "" "Computing multidimensional integrals using a multistep scheme (rectangle " "method)." msgstr "" -#: ../../common_information/processes_tasks.rst:184 +#: ../../common_information/processes_tasks.rst:138 msgid "" "Computing multidimensional integrals using a multistep scheme " "(trapezoidal method)." msgstr "" -#: ../../common_information/processes_tasks.rst:192 +#: ../../common_information/processes_tasks.rst:140 msgid "" -"Computing multidimensional integrals using a multistep scheme (Simpson’s " +"Computing multidimensional integrals using a multistep scheme (Simpson's " "method)." msgstr "" -#: ../../common_information/processes_tasks.rst:200 +#: ../../common_information/processes_tasks.rst:142 msgid "Computing multidimensional integrals using the Monte Carlo method." msgstr "" -#: ../../common_information/processes_tasks.rst:206 +#: ../../common_information/processes_tasks.rst:144 msgid "" -"Global search algorithm (Strongin’s) for one-dimensional optimization " +"Global search algorithm (Strongin's) for one-dimensional optimization " "problems. Parallelization by characteristics." msgstr "" -#: ../../common_information/processes_tasks.rst:216 +#: ../../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:226 +#: ../../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:236 +#: ../../common_information/processes_tasks.rst:153 msgid "Quick sort with simple merging." msgstr "" -#: ../../common_information/processes_tasks.rst:239 -msgid "Quick sort with odd-even merging (Batcher’s method)." +#: ../../common_information/processes_tasks.rst:155 +msgid "Quick sort with odd-even merging (Batcher's method)." msgstr "" -#: ../../common_information/processes_tasks.rst:244 +#: ../../common_information/processes_tasks.rst:157 msgid "Shell sort with simple merging." msgstr "" -#: ../../common_information/processes_tasks.rst:247 -msgid "Shell sort with odd-even merging (Batcher’s method)." +#: ../../common_information/processes_tasks.rst:159 +msgid "Shell sort with odd-even merging (Batcher's method)." msgstr "" -#: ../../common_information/processes_tasks.rst:252 +#: ../../common_information/processes_tasks.rst:161 msgid "Radix sort for integers with simple merging." msgstr "" -#: ../../common_information/processes_tasks.rst:256 -msgid "Radix sort for integers with odd-even merging (Batcher’s method)." +#: ../../common_information/processes_tasks.rst:163 +msgid "Radix sort for integers with odd-even merging (Batcher's method)." msgstr "" -#: ../../common_information/processes_tasks.rst:262 +#: ../../common_information/processes_tasks.rst:165 msgid "Radix sort for floating-point numbers (type double) with simple merging." msgstr "" -#: ../../common_information/processes_tasks.rst:268 +#: ../../common_information/processes_tasks.rst:167 msgid "" "Radix sort for floating-point numbers (type double) with odd-even merging" -" (Batcher’s method)." +" (Batcher's method)." msgstr "" -#: ../../common_information/processes_tasks.rst:276 +#: ../../common_information/processes_tasks.rst:169 msgid "" -"Shortest path search from one vertex (Dijkstra’s algorithm). With CRS " +"Shortest path search from one vertex (Dijkstra's algorithm). With CRS " "graphs." msgstr "" -#: ../../common_information/processes_tasks.rst:283 +#: ../../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:290 -msgid "Convex hull construction – Graham’s scan." +#: ../../common_information/processes_tasks.rst:173 +msgid "Convex hull construction – Graham's scan." msgstr "" -#: ../../common_information/processes_tasks.rst:294 -msgid "Convex hull construction – Jarvis’s march." +#: ../../common_information/processes_tasks.rst:175 +msgid "Convex hull construction – Jarvis's march." msgstr "" -#: ../../common_information/processes_tasks.rst:298 +#: ../../common_information/processes_tasks.rst:177 msgid "Linear image filtering (horizontal partition). Gaussian kernel 3x3." msgstr "" -#: ../../common_information/processes_tasks.rst:305 +#: ../../common_information/processes_tasks.rst:179 msgid "Linear image filtering (vertical partition). Gaussian kernel 3x3." msgstr "" -#: ../../common_information/processes_tasks.rst:312 +#: ../../common_information/processes_tasks.rst:181 msgid "28" msgstr "" -#: ../../common_information/processes_tasks.rst:312 +#: ../../common_information/processes_tasks.rst:181 msgid "Linear image filtering (block partition). Gaussian kernel 3x3." msgstr "" -#: ../../common_information/processes_tasks.rst:318 +#: ../../common_information/processes_tasks.rst:183 msgid "29" msgstr "" -#: ../../common_information/processes_tasks.rst:318 +#: ../../common_information/processes_tasks.rst:183 msgid "Edge detection in an image using the Sobel operator." msgstr "" -#: ../../common_information/processes_tasks.rst:323 +#: ../../common_information/processes_tasks.rst:185 msgid "30" msgstr "" -#: ../../common_information/processes_tasks.rst:323 +#: ../../common_information/processes_tasks.rst:185 msgid "Contrast enhancement of grayscale image using linear histogram stretching." msgstr "" -#: ../../common_information/processes_tasks.rst:330 +#: ../../common_information/processes_tasks.rst:187 msgid "31" msgstr "" -#: ../../common_information/processes_tasks.rst:330 +#: ../../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:338 +#: ../../common_information/processes_tasks.rst:189 msgid "32" msgstr "" -#: ../../common_information/processes_tasks.rst:338 +#: ../../common_information/processes_tasks.rst:189 msgid "Convex hull construction for components of a binary image." msgstr "" -#: ../../common_information/processes_tasks.rst:345 +#: ../../common_information/processes_tasks.rst:193 msgid "Comments for tasks 2 and 3:" msgstr "" -#: ../../common_information/processes_tasks.rst:347 +#: ../../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 " @@ -610,48 +610,36 @@ msgid "" "should be carried out using the ‘tree’ of processes.”" msgstr "" -#: ../../common_information/processes_tasks.rst:355 -#: ../../common_information/processes_tasks.rst:369 -#: ../../common_information/processes_tasks.rst:382 -#: ../../common_information/processes_tasks.rst:395 -#: ../../common_information/processes_tasks.rst:405 -#: ../../common_information/processes_tasks.rst:415 -#: ../../common_information/processes_tasks.rst:425 +#: ../../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:358 -#: ../../common_information/processes_tasks.rst:372 -#: ../../common_information/processes_tasks.rst:385 -#: ../../common_information/processes_tasks.rst:398 -#: ../../common_information/processes_tasks.rst:408 -#: ../../common_information/processes_tasks.rst:418 -#: ../../common_information/processes_tasks.rst:428 -msgid "Varinats for task 2" +#: ../../common_information/processes_tasks.rst:206 +msgid "Variants for task 2" msgstr "" -#: ../../common_information/processes_tasks.rst:358 -#: ../../common_information/processes_tasks.rst:372 -#: ../../common_information/processes_tasks.rst:385 -#: ../../common_information/processes_tasks.rst:398 -#: ../../common_information/processes_tasks.rst:408 -#: ../../common_information/processes_tasks.rst:418 -#: ../../common_information/processes_tasks.rst:428 -msgid "Varinats for task 3" +#: ../../common_information/processes_tasks.rst:206 +msgid "Variants for task 3" msgstr "" -#: ../../common_information/processes_tasks.rst:360 -#: ../../common_information/processes_tasks.rst:387 +#: ../../common_information/processes_tasks.rst:208 +#: ../../common_information/processes_tasks.rst:235 msgid "1 - 5" msgstr "" -#: ../../common_information/processes_tasks.rst:360 -#: ../../common_information/processes_tasks.rst:374 -#: ../../common_information/processes_tasks.rst:430 +#: ../../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:363 +#: ../../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 " @@ -660,57 +648,75 @@ msgid "" "MPI_Cart_Create and MPI_Graph_Create)”" msgstr "" -#: ../../common_information/processes_tasks.rst:374 +#: ../../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:377 +#: ../../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:387 +#: ../../common_information/processes_tasks.rst:235 msgid "11 - 14" msgstr "" -#: ../../common_information/processes_tasks.rst:390 +#: ../../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:400 +#: ../../common_information/processes_tasks.rst:248 msgid "26 - 27" msgstr "" -#: ../../common_information/processes_tasks.rst:400 +#: ../../common_information/processes_tasks.rst:248 msgid "24 - 32" msgstr "" -#: ../../common_information/processes_tasks.rst:403 +#: ../../common_information/processes_tasks.rst:251 msgid "SOLUTION OF A SYSTEM OF LINEAR ALGEBRAIC EQUATIONS" msgstr "" -#: ../../common_information/processes_tasks.rst:410 +#: ../../common_information/processes_tasks.rst:258 msgid "15 - 20" msgstr "" -#: ../../common_information/processes_tasks.rst:413 +#: ../../common_information/processes_tasks.rst:261 msgid "SORT ALGORITHMS" msgstr "" -#: ../../common_information/processes_tasks.rst:420 +#: ../../common_information/processes_tasks.rst:268 msgid "14 - 21" msgstr "" -#: ../../common_information/processes_tasks.rst:423 +#: ../../common_information/processes_tasks.rst:271 msgid "GRAPH PROCESSING ALGORITHMS" msgstr "" -#: ../../common_information/processes_tasks.rst:430 +#: ../../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 index a77c8255d..8ee85a5b4 100644 --- a/docs/locale/ru/LC_MESSAGES/common_information/report.po +++ b/docs/locale/ru/LC_MESSAGES/common_information/report.po @@ -9,7 +9,7 @@ msgid "" msgstr "" "Project-Id-Version: Parallel Programming Course \n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-02-04 00:05+0100\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" @@ -26,156 +26,159 @@ msgid "Report" msgstr "" #: ../../common_information/report.rst:4 -msgid "Report’s points" +msgid "Report points" msgstr "" -#: ../../common_information/report.rst:7 ../../common_information/report.rst:15 -msgid "Presence and Completeness" +#: ../../common_information/report.rst:7 +msgid "Completeness" msgstr "" -#: ../../common_information/report.rst:7 ../../common_information/report.rst:31 +#: ../../common_information/report.rst:7 ../../common_information/report.rst:27 msgid "Text Quality" msgstr "" -#: ../../common_information/report.rst:7 ../../common_information/report.rst:39 +#: ../../common_information/report.rst:7 ../../common_information/report.rst:34 msgid "Formatting Quality" msgstr "" #: ../../common_information/report.rst:7 -msgid "T otal" +msgid "Total" msgstr "" -#: ../../common_information/report.rst:10 +#: ../../common_information/report.rst:9 msgid "5" msgstr "" -#: ../../common_information/report.rst:10 +#: ../../common_information/report.rst:9 msgid "2.5" msgstr "" -#: ../../common_information/report.rst:10 +#: ../../common_information/report.rst:9 msgid "10" msgstr "" -#: ../../common_information/report.rst:13 +#: ../../common_information/report.rst:12 msgid "Requirements for Criteria" msgstr "" -#: ../../common_information/report.rst:17 +#: ../../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:18 -msgid "Problem Statement (substantive)" +#: ../../common_information/report.rst:17 +msgid "Problem Statement (descriptive)" msgstr "" -#: ../../common_information/report.rst:19 +#: ../../common_information/report.rst:18 msgid "Algorithm Description" msgstr "" -#: ../../common_information/report.rst:20 +#: ../../common_information/report.rst:19 msgid "Description of the Parallel Algorithm Scheme" msgstr "" -#: ../../common_information/report.rst:21 +#: ../../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:24 +#: ../../common_information/report.rst:21 msgid "" "Experimental Results (execution time and algorithm quality assessment), " "description of correctness verification" msgstr "" -#: ../../common_information/report.rst:26 +#: ../../common_information/report.rst:22 msgid "Conclusions from the Results" msgstr "" -#: ../../common_information/report.rst:27 +#: ../../common_information/report.rst:23 msgid "Conclusion" msgstr "" -#: ../../common_information/report.rst:28 +#: ../../common_information/report.rst:24 msgid "References" msgstr "" -#: ../../common_information/report.rst:29 +#: ../../common_information/report.rst:25 msgid "Appendix (include code, ensuring readability)" msgstr "" -#: ../../common_information/report.rst:33 +#: ../../common_information/report.rst:29 msgid "Meaningfulness" msgstr "" -#: ../../common_information/report.rst:34 +#: ../../common_information/report.rst:30 msgid "Coherence" msgstr "" -#: ../../common_information/report.rst:35 +#: ../../common_information/report.rst:31 msgid "Clarity" msgstr "" -#: ../../common_information/report.rst:36 +#: ../../common_information/report.rst:32 msgid "Quality of language (only the most obvious mistakes are considered)" msgstr "" -#: ../../common_information/report.rst:41 +#: ../../common_information/report.rst:36 msgid "Requirements for Headings" msgstr "" -#: ../../common_information/report.rst:42 +#: ../../common_information/report.rst:37 msgid "Requirements for Text Alignment" msgstr "" -#: ../../common_information/report.rst:43 +#: ../../common_information/report.rst:38 msgid "Requirements for Paragraph Indentation" msgstr "" -#: ../../common_information/report.rst:44 +#: ../../common_information/report.rst:39 msgid "Requirements for the Formatting of Figures, Graphs, and Tables" msgstr "" -#: ../../common_information/report.rst:45 +#: ../../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:48 +#: ../../common_information/report.rst:42 msgid "Comments" msgstr "" -#: ../../common_information/report.rst:50 +#: ../../common_information/report.rst:44 msgid "Failure to meet the requirements will result in a deduction of points." msgstr "" -#: ../../common_information/report.rst:52 +#: ../../common_information/report.rst:45 msgid "" "The request will include points and comments regarding any requirement " "violations (if applicable)." msgstr "" -#: ../../common_information/report.rst:54 +#: ../../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:56 +#: ../../common_information/report.rst:47 msgid "" -"The report is reviewed remotely; the entire review process takes place in" -" the request. The report is NOT submitted in person." +"The report is reviewed online; the entire review process takes place in " +"the request." msgstr "" -#: ../../common_information/report.rst:58 +#: ../../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 " -"**in-person and remote** parts of the corresponding lab work are fully " -"completed." +"**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 index e6b453906..a560fd63d 100644 --- a/docs/locale/ru/LC_MESSAGES/common_information/threading_tasks.po +++ b/docs/locale/ru/LC_MESSAGES/common_information/threading_tasks.po @@ -9,7 +9,7 @@ msgid "" msgstr "" "Project-Id-Version: Parallel Programming Course \n" "Report-Msgid-Bugs-To: \n" -"POT-Creation-Date: 2025-02-04 00:05+0100\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" @@ -22,278 +22,278 @@ msgstr "" "Generated-By: Babel 2.17.0\n" #: ../../common_information/threading_tasks.rst:2 -msgid "Threading tasks" +msgid "Thread parallelism tasks" msgstr "" #: ../../common_information/threading_tasks.rst:5 -msgid "V ariant Number" +msgid "Variant Number" msgstr "" #: ../../common_information/threading_tasks.rst:5 msgid "Tasks" msgstr "" -#: ../../common_information/threading_tasks.rst:9 +#: ../../common_information/threading_tasks.rst:7 msgid "1" msgstr "" -#: ../../common_information/threading_tasks.rst:9 +#: ../../common_information/threading_tasks.rst:7 msgid "" "Dense matrix multiplication. Elements of type double. Block scheme, " -"Cannon’s algorithm." +"Cannon's algorithm." msgstr "" -#: ../../common_information/threading_tasks.rst:12 +#: ../../common_information/threading_tasks.rst:9 msgid "2" msgstr "" -#: ../../common_information/threading_tasks.rst:12 +#: ../../common_information/threading_tasks.rst:9 msgid "" -"Dense matrix multiplication. Elements of type double. Block scheme, Fox’s" +"Dense matrix multiplication. Elements of type double. Block scheme, Fox's" " algorithm." msgstr "" -#: ../../common_information/threading_tasks.rst:15 +#: ../../common_information/threading_tasks.rst:11 msgid "3" msgstr "" -#: ../../common_information/threading_tasks.rst:15 +#: ../../common_information/threading_tasks.rst:11 msgid "" -"Dense matrix multiplication. Elements of type double. Strassen’s " +"Dense matrix multiplication. Elements of type double. Strassen's " "algorithm." msgstr "" -#: ../../common_information/threading_tasks.rst:18 +#: ../../common_information/threading_tasks.rst:13 msgid "4" msgstr "" -#: ../../common_information/threading_tasks.rst:18 +#: ../../common_information/threading_tasks.rst:13 msgid "" "Sparse matrix multiplication. Elements of type double. Matrix storage " -"format – row format (CRS)." +"format – row format (Compressed Row Storage)." msgstr "" -#: ../../common_information/threading_tasks.rst:21 +#: ../../common_information/threading_tasks.rst:15 msgid "5" msgstr "" -#: ../../common_information/threading_tasks.rst:21 +#: ../../common_information/threading_tasks.rst:15 msgid "" "Sparse matrix multiplication. Elements of type double. Matrix storage " -"format – column format (CCS)." +"format – column format (Compressed Column Storage)." msgstr "" -#: ../../common_information/threading_tasks.rst:24 +#: ../../common_information/threading_tasks.rst:17 msgid "6" msgstr "" -#: ../../common_information/threading_tasks.rst:24 +#: ../../common_information/threading_tasks.rst:17 msgid "" "Sparse matrix multiplication. Complex type elements. Matrix storage " -"format – row format (CRS)." +"format – row format (Compressed Row Storage)." msgstr "" -#: ../../common_information/threading_tasks.rst:27 +#: ../../common_information/threading_tasks.rst:19 msgid "7" msgstr "" -#: ../../common_information/threading_tasks.rst:27 +#: ../../common_information/threading_tasks.rst:19 msgid "" "Sparse matrix multiplication. Complex type elements. Matrix storage " -"format – column format (CCS)." +"format – column format (Compressed Column Storage)." msgstr "" -#: ../../common_information/threading_tasks.rst:30 +#: ../../common_information/threading_tasks.rst:21 msgid "8" msgstr "" -#: ../../common_information/threading_tasks.rst:30 +#: ../../common_information/threading_tasks.rst:21 msgid "Solving systems of linear equations using the conjugate gradient method." msgstr "" -#: ../../common_information/threading_tasks.rst:33 +#: ../../common_information/threading_tasks.rst:23 msgid "9" msgstr "" -#: ../../common_information/threading_tasks.rst:33 +#: ../../common_information/threading_tasks.rst:23 msgid "" "Computing multidimensional integrals using a multistep scheme (rectangle " "method)." msgstr "" -#: ../../common_information/threading_tasks.rst:36 +#: ../../common_information/threading_tasks.rst:25 msgid "10" msgstr "" -#: ../../common_information/threading_tasks.rst:36 +#: ../../common_information/threading_tasks.rst:25 msgid "" "Computing multidimensional integrals using a multistep scheme " "(trapezoidal method)." msgstr "" -#: ../../common_information/threading_tasks.rst:39 +#: ../../common_information/threading_tasks.rst:27 msgid "11" msgstr "" -#: ../../common_information/threading_tasks.rst:39 +#: ../../common_information/threading_tasks.rst:27 msgid "" -"Computing multidimensional integrals using a multistep scheme (Simpson’s " +"Computing multidimensional integrals using a multistep scheme (Simpson's " "method)." msgstr "" -#: ../../common_information/threading_tasks.rst:42 +#: ../../common_information/threading_tasks.rst:29 msgid "12" msgstr "" -#: ../../common_information/threading_tasks.rst:42 +#: ../../common_information/threading_tasks.rst:29 msgid "Computing multidimensional integrals using the Monte Carlo method." msgstr "" -#: ../../common_information/threading_tasks.rst:45 +#: ../../common_information/threading_tasks.rst:31 msgid "13" msgstr "" -#: ../../common_information/threading_tasks.rst:45 +#: ../../common_information/threading_tasks.rst:31 msgid "Quick sort with simple merging." msgstr "" -#: ../../common_information/threading_tasks.rst:47 +#: ../../common_information/threading_tasks.rst:33 msgid "14" msgstr "" -#: ../../common_information/threading_tasks.rst:47 -msgid "Quick sort with odd-even merging (Batcher’s method)." +#: ../../common_information/threading_tasks.rst:33 +msgid "Quick sort with odd-even merging (Batcher's method)." msgstr "" -#: ../../common_information/threading_tasks.rst:49 +#: ../../common_information/threading_tasks.rst:35 msgid "15" msgstr "" -#: ../../common_information/threading_tasks.rst:49 +#: ../../common_information/threading_tasks.rst:35 msgid "Shell sort with simple merging." msgstr "" -#: ../../common_information/threading_tasks.rst:51 +#: ../../common_information/threading_tasks.rst:37 msgid "16" msgstr "" -#: ../../common_information/threading_tasks.rst:51 -msgid "Shell sort with odd-even merging (Batcher’s method)." +#: ../../common_information/threading_tasks.rst:37 +msgid "Shell sort with odd-even merging (Batcher's method)." msgstr "" -#: ../../common_information/threading_tasks.rst:53 +#: ../../common_information/threading_tasks.rst:39 msgid "17" msgstr "" -#: ../../common_information/threading_tasks.rst:53 +#: ../../common_information/threading_tasks.rst:39 msgid "Radix sort for integers with simple merging." msgstr "" -#: ../../common_information/threading_tasks.rst:55 +#: ../../common_information/threading_tasks.rst:41 msgid "18" msgstr "" -#: ../../common_information/threading_tasks.rst:55 -msgid "Radix sort for integers with odd-even merging (Batcher’s method)." +#: ../../common_information/threading_tasks.rst:41 +msgid "Radix sort for integers with odd-even merging (Batcher's method)." msgstr "" -#: ../../common_information/threading_tasks.rst:58 +#: ../../common_information/threading_tasks.rst:43 msgid "19" msgstr "" -#: ../../common_information/threading_tasks.rst:58 +#: ../../common_information/threading_tasks.rst:43 msgid "Radix sort for floating-point numbers (type double) with simple merging." msgstr "" -#: ../../common_information/threading_tasks.rst:61 +#: ../../common_information/threading_tasks.rst:45 msgid "20" msgstr "" -#: ../../common_information/threading_tasks.rst:61 +#: ../../common_information/threading_tasks.rst:45 msgid "" "Radix sort for floating-point numbers (type double) with odd-even merging" -" (Batcher’s method)." +" (Batcher's method)." msgstr "" -#: ../../common_information/threading_tasks.rst:64 +#: ../../common_information/threading_tasks.rst:47 msgid "21" msgstr "" -#: ../../common_information/threading_tasks.rst:64 -msgid "Shortest path search from one vertex (Dijkstra’s algorithm)." +#: ../../common_information/threading_tasks.rst:47 +msgid "Shortest path search from one vertex (Dijkstra's algorithm)." msgstr "" -#: ../../common_information/threading_tasks.rst:67 +#: ../../common_information/threading_tasks.rst:49 msgid "22" msgstr "" -#: ../../common_information/threading_tasks.rst:67 -msgid "Convex hull construction – Graham’s scan." +#: ../../common_information/threading_tasks.rst:49 +msgid "Convex hull construction – Graham's scan." msgstr "" -#: ../../common_information/threading_tasks.rst:69 +#: ../../common_information/threading_tasks.rst:51 msgid "23" msgstr "" -#: ../../common_information/threading_tasks.rst:69 -msgid "Convex hull construction – Jarvis’s march." +#: ../../common_information/threading_tasks.rst:51 +msgid "Convex hull construction – Jarvis's march." msgstr "" -#: ../../common_information/threading_tasks.rst:71 +#: ../../common_information/threading_tasks.rst:53 msgid "24" msgstr "" -#: ../../common_information/threading_tasks.rst:71 +#: ../../common_information/threading_tasks.rst:53 msgid "Linear image filtering (horizontal partition). Gaussian kernel 3x3." msgstr "" -#: ../../common_information/threading_tasks.rst:74 +#: ../../common_information/threading_tasks.rst:55 msgid "25" msgstr "" -#: ../../common_information/threading_tasks.rst:74 +#: ../../common_information/threading_tasks.rst:55 msgid "Linear image filtering (vertical partition). Gaussian kernel 3x3." msgstr "" -#: ../../common_information/threading_tasks.rst:77 +#: ../../common_information/threading_tasks.rst:57 msgid "26" msgstr "" -#: ../../common_information/threading_tasks.rst:77 +#: ../../common_information/threading_tasks.rst:57 msgid "Linear image filtering (block partition). Gaussian kernel 3x3." msgstr "" -#: ../../common_information/threading_tasks.rst:80 +#: ../../common_information/threading_tasks.rst:59 msgid "27" msgstr "" -#: ../../common_information/threading_tasks.rst:80 +#: ../../common_information/threading_tasks.rst:59 msgid "Edge detection in an image using the Sobel operator." msgstr "" -#: ../../common_information/threading_tasks.rst:82 +#: ../../common_information/threading_tasks.rst:61 msgid "28" msgstr "" -#: ../../common_information/threading_tasks.rst:82 +#: ../../common_information/threading_tasks.rst:61 msgid "Contrast enhancement of grayscale image using linear histogram stretching." msgstr "" -#: ../../common_information/threading_tasks.rst:85 +#: ../../common_information/threading_tasks.rst:63 msgid "29" msgstr "" -#: ../../common_information/threading_tasks.rst:85 +#: ../../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:88 +#: ../../common_information/threading_tasks.rst:65 msgid "30" msgstr "" -#: ../../common_information/threading_tasks.rst:88 +#: ../../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 770dc8584..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-02-04 00:05+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" @@ -26,7 +26,7 @@ msgid "User Guide:" msgstr "Инструкция по выполнению работы" #: ../../index.rst:16 -msgid "Common Information:" +msgid "Course Details:" msgstr "" #: ../../index.rst:2 @@ -42,3 +42,6 @@ msgstr "" "программирование». Вы можете перейти по ссылкам, чтобы узнать больше о " "каждой теме." +#~ msgid "Common Information:" +#~ msgstr "" +