Merge pull request '[Л/Р 6] Миронов Евгений' (#60) from MironovEvgeniy/distributed-computing:mironov-eo-lab-6 into main

Reviewed-on: http://student.git.athene.tech/v.moiseev/distributed-computing/pulls/60
This commit is contained in:
Vladislav Moiseev 2023-12-17 22:47:11 +04:00
commit 7020bd0de9
11 changed files with 906 additions and 0 deletions

484
tasks/mironov-eo/lab_6/.gitignore vendored Normal file
View File

@ -0,0 +1,484 @@
## Ignore Visual Studio temporary files, build results, and
## files generated by popular Visual Studio add-ons.
##
## Get latest from `dotnet new gitignore`
# dotenv files
.env
# User-specific files
*.rsuser
*.suo
*.user
*.userosscache
*.sln.docstates
# User-specific files (MonoDevelop/Xamarin Studio)
*.userprefs
# Mono auto generated files
mono_crash.*
# Build results
[Dd]ebug/
[Dd]ebugPublic/
[Rr]elease/
[Rr]eleases/
x64/
x86/
[Ww][Ii][Nn]32/
[Aa][Rr][Mm]/
[Aa][Rr][Mm]64/
bld/
[Bb]in/
[Oo]bj/
[Ll]og/
[Ll]ogs/
# Visual Studio 2015/2017 cache/options directory
.vs/
# Uncomment if you have tasks that create the project's static files in wwwroot
#wwwroot/
# Visual Studio 2017 auto generated files
Generated\ Files/
# MSTest test Results
[Tt]est[Rr]esult*/
[Bb]uild[Ll]og.*
# NUnit
*.VisualState.xml
TestResult.xml
nunit-*.xml
# Build Results of an ATL Project
[Dd]ebugPS/
[Rr]eleasePS/
dlldata.c
# Benchmark Results
BenchmarkDotNet.Artifacts/
# .NET
project.lock.json
project.fragment.lock.json
artifacts/
# Tye
.tye/
# ASP.NET Scaffolding
ScaffoldingReadMe.txt
# StyleCop
StyleCopReport.xml
# Files built by Visual Studio
*_i.c
*_p.c
*_h.h
*.ilk
*.meta
*.obj
*.iobj
*.pch
*.pdb
*.ipdb
*.pgc
*.pgd
*.rsp
*.sbr
*.tlb
*.tli
*.tlh
*.tmp
*.tmp_proj
*_wpftmp.csproj
*.log
*.tlog
*.vspscc
*.vssscc
.builds
*.pidb
*.svclog
*.scc
# Chutzpah Test files
_Chutzpah*
# Visual C++ cache files
ipch/
*.aps
*.ncb
*.opendb
*.opensdf
*.sdf
*.cachefile
*.VC.db
*.VC.VC.opendb
# Visual Studio profiler
*.psess
*.vsp
*.vspx
*.sap
# Visual Studio Trace Files
*.e2e
# TFS 2012 Local Workspace
$tf/
# Guidance Automation Toolkit
*.gpState
# ReSharper is a .NET coding add-in
_ReSharper*/
*.[Rr]e[Ss]harper
*.DotSettings.user
# TeamCity is a build add-in
_TeamCity*
# DotCover is a Code Coverage Tool
*.dotCover
# AxoCover is a Code Coverage Tool
.axoCover/*
!.axoCover/settings.json
# Coverlet is a free, cross platform Code Coverage Tool
coverage*.json
coverage*.xml
coverage*.info
# Visual Studio code coverage results
*.coverage
*.coveragexml
# NCrunch
_NCrunch_*
.*crunch*.local.xml
nCrunchTemp_*
# MightyMoose
*.mm.*
AutoTest.Net/
# Web workbench (sass)
.sass-cache/
# Installshield output folder
[Ee]xpress/
# DocProject is a documentation generator add-in
DocProject/buildhelp/
DocProject/Help/*.HxT
DocProject/Help/*.HxC
DocProject/Help/*.hhc
DocProject/Help/*.hhk
DocProject/Help/*.hhp
DocProject/Help/Html2
DocProject/Help/html
# Click-Once directory
publish/
# Publish Web Output
*.[Pp]ublish.xml
*.azurePubxml
# Note: Comment the next line if you want to checkin your web deploy settings,
# but database connection strings (with potential passwords) will be unencrypted
*.pubxml
*.publishproj
# Microsoft Azure Web App publish settings. Comment the next line if you want to
# checkin your Azure Web App publish settings, but sensitive information contained
# in these scripts will be unencrypted
PublishScripts/
# NuGet Packages
*.nupkg
# NuGet Symbol Packages
*.snupkg
# The packages folder can be ignored because of Package Restore
**/[Pp]ackages/*
# except build/, which is used as an MSBuild target.
!**/[Pp]ackages/build/
# Uncomment if necessary however generally it will be regenerated when needed
#!**/[Pp]ackages/repositories.config
# NuGet v3's project.json files produces more ignorable files
*.nuget.props
*.nuget.targets
# Microsoft Azure Build Output
csx/
*.build.csdef
# Microsoft Azure Emulator
ecf/
rcf/
# Windows Store app package directories and files
AppPackages/
BundleArtifacts/
Package.StoreAssociation.xml
_pkginfo.txt
*.appx
*.appxbundle
*.appxupload
# Visual Studio cache files
# files ending in .cache can be ignored
*.[Cc]ache
# but keep track of directories ending in .cache
!?*.[Cc]ache/
# Others
ClientBin/
~$*
*~
*.dbmdl
*.dbproj.schemaview
*.jfm
*.pfx
*.publishsettings
orleans.codegen.cs
# Including strong name files can present a security risk
# (https://github.com/github/gitignore/pull/2483#issue-259490424)
#*.snk
# Since there are multiple workflows, uncomment next line to ignore bower_components
# (https://github.com/github/gitignore/pull/1529#issuecomment-104372622)
#bower_components/
# RIA/Silverlight projects
Generated_Code/
# Backup & report files from converting an old project file
# to a newer Visual Studio version. Backup files are not needed,
# because we have git ;-)
_UpgradeReport_Files/
Backup*/
UpgradeLog*.XML
UpgradeLog*.htm
ServiceFabricBackup/
*.rptproj.bak
# SQL Server files
*.mdf
*.ldf
*.ndf
# Business Intelligence projects
*.rdl.data
*.bim.layout
*.bim_*.settings
*.rptproj.rsuser
*- [Bb]ackup.rdl
*- [Bb]ackup ([0-9]).rdl
*- [Bb]ackup ([0-9][0-9]).rdl
# Microsoft Fakes
FakesAssemblies/
# GhostDoc plugin setting file
*.GhostDoc.xml
# Node.js Tools for Visual Studio
.ntvs_analysis.dat
node_modules/
# Visual Studio 6 build log
*.plg
# Visual Studio 6 workspace options file
*.opt
# Visual Studio 6 auto-generated workspace file (contains which files were open etc.)
*.vbw
# Visual Studio 6 auto-generated project file (contains which files were open etc.)
*.vbp
# Visual Studio 6 workspace and project file (working project files containing files to include in project)
*.dsw
*.dsp
# Visual Studio 6 technical files
*.ncb
*.aps
# Visual Studio LightSwitch build output
**/*.HTMLClient/GeneratedArtifacts
**/*.DesktopClient/GeneratedArtifacts
**/*.DesktopClient/ModelManifest.xml
**/*.Server/GeneratedArtifacts
**/*.Server/ModelManifest.xml
_Pvt_Extensions
# Paket dependency manager
.paket/paket.exe
paket-files/
# FAKE - F# Make
.fake/
# CodeRush personal settings
.cr/personal
# Python Tools for Visual Studio (PTVS)
__pycache__/
*.pyc
# Cake - Uncomment if you are using it
# tools/**
# !tools/packages.config
# Tabs Studio
*.tss
# Telerik's JustMock configuration file
*.jmconfig
# BizTalk build output
*.btp.cs
*.btm.cs
*.odx.cs
*.xsd.cs
# OpenCover UI analysis results
OpenCover/
# Azure Stream Analytics local run output
ASALocalRun/
# MSBuild Binary and Structured Log
*.binlog
# NVidia Nsight GPU debugger configuration file
*.nvuser
# MFractors (Xamarin productivity tool) working folder
.mfractor/
# Local History for Visual Studio
.localhistory/
# Visual Studio History (VSHistory) files
.vshistory/
# BeatPulse healthcheck temp database
healthchecksdb
# Backup folder for Package Reference Convert tool in Visual Studio 2017
MigrationBackup/
# Ionide (cross platform F# VS Code tools) working folder
.ionide/
# Fody - auto-generated XML schema
FodyWeavers.xsd
# VS Code files for those working on multiple tools
.vscode/*
!.vscode/settings.json
!.vscode/tasks.json
!.vscode/launch.json
!.vscode/extensions.json
*.code-workspace
# Local History for Visual Studio Code
.history/
# Windows Installer files from build outputs
*.cab
*.msi
*.msix
*.msm
*.msp
# JetBrains Rider
*.sln.iml
.idea
##
## Visual studio for Mac
##
# globs
Makefile.in
*.userprefs
*.usertasks
config.make
config.status
aclocal.m4
install-sh
autom4te.cache/
*.tar.gz
tarballs/
test-results/
# Mac bundle stuff
*.dmg
*.app
# content below from: https://github.com/github/gitignore/blob/master/Global/macOS.gitignore
# General
.DS_Store
.AppleDouble
.LSOverride
# Icon must end with two \r
Icon
# Thumbnails
._*
# Files that might appear in the root of a volume
.DocumentRevisions-V100
.fseventsd
.Spotlight-V100
.TemporaryItems
.Trashes
.VolumeIcon.icns
.com.apple.timemachine.donotpresent
# Directories potentially created on remote AFP share
.AppleDB
.AppleDesktop
Network Trash Folder
Temporary Items
.apdisk
# content below from: https://github.com/github/gitignore/blob/master/Global/Windows.gitignore
# Windows thumbnail cache files
Thumbs.db
ehthumbs.db
ehthumbs_vista.db
# Dump file
*.stackdump
# Folder config file
[Dd]esktop.ini
# Recycle Bin used on file shares
$RECYCLE.BIN/
# Windows Installer files
*.cab
*.msi
*.msix
*.msm
*.msp
# Windows shortcuts
*.lnk
# Vim temporary swap files
*.swp

View File

@ -0,0 +1,25 @@

Microsoft Visual Studio Solution File, Format Version 12.00
# Visual Studio Version 17
VisualStudioVersion = 17.8.34322.80
MinimumVisualStudioVersion = 10.0.40219.1
Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "ConsoleApp1", "ConsoleApp1\ConsoleApp1.csproj", "{24793D16-F80E-48B2-8A04-76BD2CB61C1C}"
EndProject
Global
GlobalSection(SolutionConfigurationPlatforms) = preSolution
Debug|Any CPU = Debug|Any CPU
Release|Any CPU = Release|Any CPU
EndGlobalSection
GlobalSection(ProjectConfigurationPlatforms) = postSolution
{24793D16-F80E-48B2-8A04-76BD2CB61C1C}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
{24793D16-F80E-48B2-8A04-76BD2CB61C1C}.Debug|Any CPU.Build.0 = Debug|Any CPU
{24793D16-F80E-48B2-8A04-76BD2CB61C1C}.Release|Any CPU.ActiveCfg = Release|Any CPU
{24793D16-F80E-48B2-8A04-76BD2CB61C1C}.Release|Any CPU.Build.0 = Release|Any CPU
EndGlobalSection
GlobalSection(SolutionProperties) = preSolution
HideSolutionNode = FALSE
EndGlobalSection
GlobalSection(ExtensibilityGlobals) = postSolution
SolutionGuid = {D17B9FEE-F4BF-4559-899B-434F4545FF67}
EndGlobalSection
EndGlobal

View File

@ -0,0 +1,14 @@
<Project Sdk="Microsoft.NET.Sdk">
<PropertyGroup>
<OutputType>Exe</OutputType>
<TargetFramework>net8.0</TargetFramework>
<ImplicitUsings>enable</ImplicitUsings>
<Nullable>enable</Nullable>
</PropertyGroup>
<ItemGroup>
<PackageReference Include="BenchmarkDotNet" Version="0.13.11" />
</ItemGroup>
</Project>

View File

@ -0,0 +1,177 @@
using CommandLine;
using System;
using System.Collections.Concurrent;
using System.Collections.Generic;
using System.Linq;
using System.Runtime.CompilerServices;
using System.Text;
using System.Threading.Tasks;
using static ConsoleApp1.MatrixHelper;
namespace ConsoleApp1
{
public class MatrixHelper
{
static readonly Random rand = new Random();
object lockObject = new object();
public double[,] RandomGenerateMatrix(int dimensionsCount)
{
double[,] result = new double[dimensionsCount, dimensionsCount];
for (int i = 0; i < dimensionsCount; i++)
{
for (int j = 0; j < dimensionsCount; j++)
{
result[i, j] = rand.NextDouble() * 10;
}
}
return result;
}
public double determinantOfMatrixGaus(double[,] mat)
{
int n = mat.GetLength(0);
int i, j, k;
for (i = 0; i < n - 1; i++)
{
for (j = i + 1; j < n; j++)
{
if (j == i)
continue;
double someDet = mat[j, i] / mat[i, i];
for (k = i; k < n; k++)
mat[j, k] -= someDet * mat[i, k];
}
}
double det = 1;
for (i = 0; i < n; i++)
det = det * mat[i, i];
return det;
}
public double determinantOfMatrixParallelGaus(double[,] mat, int threadCount)
{
int n = mat.GetLength(0);
Parallel.For(0, n - 1,
new ParallelOptions()
{
MaxDegreeOfParallelism = threadCount
},
(i) =>
{
for (int j = i + 1; j < n; j++)
{
if (j == i)
continue;
double det = mat[j, i] / mat[i, i];
for (int k = i; k < n; k++)
mat[j, k] = mat[j, k] - det * mat[i, k];
};
});
double det = 1;
for (int i = 0; i < n; i++)
det = det * mat[i, i];
return det;
}
public double determinantOfMatrixLaplas(double[,] matrix, int threadCount)
{
int size = matrix.GetLength(0);
if (size == 1)
{
return matrix[0, 0];
}
else if (size == 2)
{
return matrix[0, 0] * matrix[1, 1] - matrix[0, 1] * matrix[1, 0];
}
else
{
double determinant = 0;
Parallel.For(0, size,
new ParallelOptions
{
MaxDegreeOfParallelism = threadCount
},
(i) =>
{
double[,] subMatrix = GetSubMatrix(matrix, i);
double subDeterminant = matrix[0, i] * Determinant(subMatrix);
double value = Math.Pow(-1, i) * subDeterminant;
lock (lockObject)
{
determinant += value;
}
});
return determinant;
}
}
static double[,] GetSubMatrix(double[,] matrix, int columnIndex)
{
int size = matrix.GetLength(0);
double[,] subMatrix = new double[size - 1, size - 1];
for (int i = 1; i < size; i++)
{
for (int j = 0; j < size; j++)
{
if (j < columnIndex)
{
subMatrix[i - 1, j] = matrix[i, j];
}
else if (j > columnIndex)
{
subMatrix[i - 1, j - 1] = matrix[i, j];
}
}
}
return subMatrix;
}
static double Determinant(double[,] matrix)
{
int size = matrix.GetLength(0);
if (size == 1)
{
return matrix[0, 0];
}
else if (size == 2)
{
return matrix[0, 0] * matrix[1, 1] - matrix[0, 1] * matrix[1, 0];
}
else
{
double determinant = 0;
for (int i = 0; i < size; i++)
{
double[,] subMatrix = GetSubMatrix(matrix, i);
determinant += (int)Math.Pow(-1, i) * matrix[0, i] * Determinant(subMatrix);
}
return determinant;
}
}
}
}

View File

@ -0,0 +1,63 @@
using BenchmarkDotNet.Attributes;
using BenchmarkDotNet.Running;
using ConsoleApp1;
using System.Collections.Concurrent;
BenchmarkRunner.Run<MatrixTest>();
[MemoryDiagnoser]
public class MatrixTest
{
double[,] Matrix100;
double[,] Matrix10;
MatrixHelper matrixHelper;
public MatrixTest()
{
matrixHelper = new MatrixHelper();
Matrix10 = matrixHelper.RandomGenerateMatrix(10);
Matrix100 = matrixHelper.RandomGenerateMatrix(100);
}
[Benchmark]
public double MatrixDeterminantLaplas10()
{
return matrixHelper.determinantOfMatrixLaplas(Matrix10, 1);
}
[Benchmark]
public double MatrixDeterminantLaplasParallel10()
{
return matrixHelper.determinantOfMatrixLaplas(Matrix10, 15);
}
[Benchmark]
public double MatrixDeterminantGausParallel10()
{
return matrixHelper.determinantOfMatrixParallelGaus(Matrix10, 15);
}
[Benchmark]
public double MatrixDeterminantGaus10()
{
return matrixHelper.determinantOfMatrixGaus(Matrix10);
}
[Benchmark]
public double MatrixDeterminantGausParallel100()
{
return matrixHelper.determinantOfMatrixParallelGaus(Matrix100, 15);
}
[Benchmark]
public double MatrixDeterminantGaus100()
{
return matrixHelper.determinantOfMatrixGaus(Matrix100);
}
}

View File

@ -0,0 +1,143 @@
# Отчет по лабораторной работе №6
Выполнил студент гр. ИСЭбд-41 Миронов Е.О.
## Выбор алгоритма
Предложенный алгоритм(теорема Лапласа) имеет асимптотику примерно O(n!). Для подсчета определителя матрицы размерностью более 10х10 он зависает. Запустить его на матрицу 100х100 на моей машине просто невозвожно.
Поэтому рассматриваю другой алгоритм - метод Гаусса. Он имеет сложность O(n^3), и его уже реально выполнять на больших данных.
Но на каждом шаге изменяется общий ресурс в виде исходной матрицы, поэтому алгоритм должен плохо параллелиться.
Также ко всему этому определитель матрицы свыше 100х100 слишком большой и не поддерживается типом double.
![](pic/1.png)
![](pic/2.png)
В итоге решил использовать теорему Лапласа на матрицах до 10х10 и метод Гаусса на матрицах до 100х100
## Создание приложения
Выбрал язык C#, Консольное приложение.
Попробуем запустить все алгоритмы на матрицах 3х3 и проверить результат выполнения.
![](pic/3.png)
Немного разные результаты спишу на погрешность типа double
Однопоточный метод Гаусса
```cs
public double determinantOfMatrixGaus(double[,] mat, int n)
{
int i, j, k;
for (i = 0; i < n - 1; i++)
{
for (j = i + 1; j < n; j++)
{
if (j == i)
continue;
double someDet = mat[j, i] / mat[i, i];
for (k = i; k < n; k++)
mat[j, k] -= someDet * mat[i, k];
}
}
double det = 1;
for (i = 0; i < n; i++)
det = det * mat[i, i];
return det;
}
```
Параллельный метод Гаусса
```cs
public double determinantOfMatrixParallelGaus(double[,] mat, int n)
{
Parallel.For(0, n - 1,
new ParallelOptions()
{
MaxDegreeOfParallelism = threadCount
},
(i) =>
{
for (int j = i + 1; j < n; j++)
{
if (j == i)
continue;
double det = mat[j, i] / mat[i, i];
for (int k = i; k < n; k++)
mat[j, k] = mat[j, k] - det * mat[i, k];
};
});
double det = 1;
for (int i = 0; i < n; i++)
det = det * mat[i, i];
return det;
}
```
Почему это работает до конца не понятно.
Возможно потому что алгоритм меняет только строку j, и только на основании данных строк i (счетчик в Parallel.For - синхронизован) и j(текущая строка).
Сделал вот такую проверку - все ок, ни одной ошибки
![](pic/4.png)
Однако я все равно сомневаюсь в прошлой реализации и подозреваю, что где-то есть race condition.
Поэтому вот реализация в которой куча блокировок, и она работает намного медленее, но зато я в ней уверен.
``` cs
public double determinantOfMatrixParallelGaus(double[,] mat, int n)
{
lockObjects = new object[n].Select(x => new object()).ToArray();
for (int i = 0; i < n - 1; i++)
{
lock (lockObjects[i])
{
Parallel.For(i + 1, n,
(j) =>
{
if (j == i)
return;
lock (lockObjects[j])
{
double det = mat[j, i] / mat[i, i];
for (int k = i; k < n; k++)
mat[j, k] = mat[j, k] - det * mat[i, k];
}
});
}
}
double det = 1;
for (int i = 0; i < n; i++)
det = det * mat[i, i];
return det;
}
```
## Бенчмарки
Запускаю тесты
1) Лаплас 10х10 в один поток
2) Лаплас 10х10 в 15 потоков
3) Гаусс 10х10 в 15 потоков
4) Гаусс 10х10 в 1 поток
5) Гаусс 100х100 в 15 потоков
6) Гаусс 100х100 в 1 поток.
![](pic/5.png)
Видим, что в нашем тесте параллельные реализации работают быстрее однопоточных.
Помимо этого и без того понятного вывода видим огромную разницу в алгоритмах Гаусса и Лапласа. С объемом данных большим в 100 раз алгоритм Гаусса справляется быстрее в 40 раз. При этом он является оптимальным по памяти и практически не создает нагрузки на сборщик мусора.

Binary file not shown.

After

Width:  |  Height:  |  Size: 70 KiB

Binary file not shown.

After

Width:  |  Height:  |  Size: 70 KiB

Binary file not shown.

After

Width:  |  Height:  |  Size: 96 KiB

Binary file not shown.

After

Width:  |  Height:  |  Size: 74 KiB

Binary file not shown.

After

Width:  |  Height:  |  Size: 25 KiB