mirror of
https://github.com/kuhyx/WUT_Computer_Science.git
synced 2026-07-04 13:03:05 +02:00
wip: added distributed arrays
This commit is contained in:
parent
b255edad36
commit
39cc08350d
8
.vscode/extensions.json
vendored
8
.vscode/extensions.json
vendored
@ -1,6 +1,12 @@
|
||||
{
|
||||
"recommendations": [
|
||||
"github.vscode-github-actions",
|
||||
"yzhang.markdown-all-in-one"
|
||||
"yzhang.markdown-all-in-one",
|
||||
"ms-python.autopep8",
|
||||
"nwgh.bandit",
|
||||
"ms-python.black-formatter",
|
||||
"usernamehw.errorlens",
|
||||
"ms-python.debugpy",
|
||||
"ms-python.vscode-pylance"
|
||||
]
|
||||
}
|
||||
@ -6,6 +6,7 @@ from abc import ABC, abstractmethod
|
||||
from concurrent.futures import ThreadPoolExecutor
|
||||
from functools import partial
|
||||
from time_measurement import time_measurement, time_accumulator
|
||||
import dask.array as da
|
||||
|
||||
class LinearAlgebraUtils(ABC):
|
||||
@staticmethod
|
||||
@ -471,3 +472,98 @@ class ProcessLinearAlgebraUtils:
|
||||
except Exception as e:
|
||||
print(f"Error during Gaussian elimination: {e}")
|
||||
return None
|
||||
|
||||
class DistributedArraysLinearAlgebraUtils(ABC):
|
||||
@staticmethod
|
||||
@time_measurement(time_accumulator)
|
||||
def dot_product(v1, v2):
|
||||
dv1 = da.from_array(v1, chunks='auto')
|
||||
dv2 = da.from_array(v2, chunks='auto')
|
||||
return da.dot(dv1, dv2).compute()
|
||||
|
||||
@staticmethod
|
||||
@time_measurement(time_accumulator)
|
||||
def matrix_vector_multiply(A, x):
|
||||
dA = da.from_array(A, chunks='auto')
|
||||
dx = da.from_array(x, chunks='auto')
|
||||
return da.dot(dA, dx).compute().tolist()
|
||||
|
||||
@staticmethod
|
||||
@time_measurement(time_accumulator)
|
||||
def vector_norm(v):
|
||||
dv = da.from_array(v, chunks='auto')
|
||||
return da.linalg.norm(dv).compute()
|
||||
|
||||
@staticmethod
|
||||
@time_measurement(time_accumulator)
|
||||
def vector_scalar_divide(x, scalar):
|
||||
dx = da.from_array(x, chunks='auto')
|
||||
return (dx / scalar).compute().tolist()
|
||||
|
||||
@staticmethod
|
||||
@time_measurement(time_accumulator)
|
||||
def matrix_scalar_multiply(A, w):
|
||||
dA = da.from_array(A, chunks='auto')
|
||||
return (dA * w).compute().tolist()
|
||||
|
||||
@staticmethod
|
||||
@time_measurement(time_accumulator)
|
||||
def vector_vector_subtraction(v1, v2):
|
||||
dv1 = da.from_array(v1, chunks='auto')
|
||||
dv2 = da.from_array(v2, chunks='auto')
|
||||
return (dv1 - dv2).compute().tolist()
|
||||
|
||||
@staticmethod
|
||||
@time_measurement(time_accumulator)
|
||||
def vector_vector_addition(v1, v2):
|
||||
dv1 = da.from_array(v1, chunks='auto')
|
||||
dv2 = da.from_array(v2, chunks='auto')
|
||||
return (dv1 + dv2).compute().tolist()
|
||||
|
||||
@staticmethod
|
||||
@time_measurement(time_accumulator)
|
||||
def scalar_vector_multiply(omega, vector):
|
||||
dvector = da.from_array(vector, chunks='auto')
|
||||
return (omega * dvector).compute().tolist()
|
||||
|
||||
@staticmethod
|
||||
@time_measurement(time_accumulator)
|
||||
def matrix_norm(A):
|
||||
dA = da.from_array(A, chunks='auto')
|
||||
return da.linalg.norm(dA).compute()
|
||||
|
||||
@staticmethod
|
||||
@time_measurement(time_accumulator)
|
||||
def matrix_matrix_subtraction(A, B):
|
||||
dA = da.from_array(A, chunks='auto')
|
||||
dB = da.from_array(B, chunks='auto')
|
||||
return (dA - dB).compute().tolist()
|
||||
|
||||
@staticmethod
|
||||
@time_measurement(time_accumulator)
|
||||
def gaussian_elimination(A, b):
|
||||
try:
|
||||
dA = da.from_array(A, chunks='auto')
|
||||
db = da.from_array(b, chunks='auto')
|
||||
Ab = da.hstack([dA, db[:, None]])
|
||||
Ab = Ab.persist()
|
||||
|
||||
def elimination_step(Ab, k):
|
||||
n = Ab.shape[0]
|
||||
max_index = da.argmax(da.abs(Ab[k:, k])) + k
|
||||
Ab[[k, max_index]] = Ab[[max_index, k]]
|
||||
Ab = Ab.persist()
|
||||
factor = Ab[k + 1:, k] / Ab[k, k]
|
||||
Ab[k + 1:] -= factor[:, None] * Ab[k]
|
||||
return Ab
|
||||
|
||||
for k in range(A.shape[0]):
|
||||
Ab = elimination_step(Ab, k)
|
||||
|
||||
x = da.zeros(A.shape[0])
|
||||
for i in range(A.shape[0] - 1, -1, -1):
|
||||
x[i] = (Ab[i, -1] - da.dot(Ab[i, i + 1:-1], x[i + 1:])) / Ab[i, i]
|
||||
return x.compute().tolist()
|
||||
except Exception as e:
|
||||
print(f"Error during Gaussian elimination: {e}")
|
||||
return None
|
||||
|
||||
@ -4,3 +4,4 @@ class ProcessingType(Enum):
|
||||
SEQUENTIAL = auto()
|
||||
THREADS = auto()
|
||||
PROCESSES = auto()
|
||||
DISTRIBUTED_ARRAYS = auto()
|
||||
|
||||
@ -1,2 +1,3 @@
|
||||
scipy
|
||||
pytest
|
||||
dask
|
||||
@ -41,7 +41,8 @@ class RichardsonMethod:
|
||||
methods = {
|
||||
ProcessingType.SEQUENTIAL: linAlg.SequentialLinearAlgebraUtils,
|
||||
ProcessingType.THREADS: linAlg.ThreadsLinearAlgebraUtils,
|
||||
ProcessingType.PROCESSES: linAlg.ProcessLinearAlgebraUtils
|
||||
ProcessingType.PROCESSES: linAlg.ProcessLinearAlgebraUtils,
|
||||
ProcessingType.DISTRIBUTED_ARRAYS: linAlg.DistributedArraysLinearAlgebraUtils
|
||||
}
|
||||
|
||||
try:
|
||||
@ -77,6 +78,9 @@ class RichardsonMethod:
|
||||
case linAlg.ProcessLinearAlgebraUtils:
|
||||
sequential_time = total_time - time_accumulator.total_time
|
||||
print(f"Total: {total_time:.3e}s, Seq: {sequential_time:.3e}s, Parallel (processes): {time_accumulator.total_time:.3e}s, Tests time: {tests_time.total_time:.3e}s")
|
||||
case linAlg.DistributedArraysLinearAlgebraUtils:
|
||||
sequential_time = total_time - time_accumulator.total_time
|
||||
print(f"Total: {total_time:.3e}s, Seq: {sequential_time:.3e}s, Parallel (distributed arrays): {time_accumulator.total_time:.3e}s, Tests time: {tests_time.total_time:.3e}s")
|
||||
case _:
|
||||
print("Unhandled LinAlg type")
|
||||
|
||||
|
||||
Loading…
Reference in New Issue
Block a user