@@ -10,10 +10,33 @@ Projects for university course "Parallel and distributed systems".
10
10
11
11
## 1. Parallel MPI Application: Minimal Spanning Tree - Prim's Algorithm <a name =" parallel " ></a >
12
12
13
- *** soon***
13
+ Prim's algorithm (Parallel Version) written within OpenMPI.
14
+
15
+ How to run a program (via * Makefile* ):
16
+ * ` make prepare ` - for preparing environment (adjusted to the laboratory conditions)
17
+ * ` make ` - for compiling the program
18
+ * ` make run ` - to run the default version of program, takes 3 args:
19
+ - ` n ` - number of processes
20
+ - ` in ` - path to the file with input data
21
+ - ` out ` * optional* - path to the file with output data (adjacency matrix of MST)
22
+ * ` make run0_ ` (` _ ` means number between 1 and 5)
23
+
24
+ [ * link to documentation* ] ( ./parallel/doc.pdf )
14
25
15
26
---
16
27
17
28
## 2. Distributed <* type to be established* > Application: <* subject to be established* > <a name =" distributed " ></a >
18
29
19
- *** soon***
30
+ Prim's algorithm (Distributed Version) written within UPC++.
31
+
32
+ How to run a program (via * Makefile* ):
33
+ * ` make prepare ` - for preparing environment (adjusted to the laboratory conditions)
34
+ * ` make compile ` - for compiling the program
35
+ * ` make run ` - to run the default version of program, takes 3 args:
36
+ - ` n ` - number of processes
37
+ - ` in ` - path to the file with input data
38
+ - ` out ` * optional* - path to the file with output data (adjacency matrix of MST)
39
+ * ` make run0_ ` (` _ ` means number between 1 and 5)
40
+
41
+
42
+ [ * link to documentation* ] ( ./distributed/doc.pdf )
0 commit comments