Application that counts the number of words in the passed a file or a group of files.

Name: SparseLU Contact Person: [email protected] Access Level: public License Agreement: Apache2 Platform: COMPSs

Description

The Sparse LU application computes an LU matrix factorization on a sparse blocked matrix. The matrix size (number of blocks) and the block size are parameters of the application.

As the algorithm progresses, the area of the matrix that is accessed is smaller; concretely, at each iteration, the 0th row and column of the current matrix are discarded. ...

COMPSs Matrix Multiplication, out-of-core using files. Hypermatrix size used 2x2 blocks (MSIZE=2), block size used 2x2 elements (BSIZE=2)

Monte Carlo Pi Estimation Program Description

This program is a Monte Carlo simulation designed to estimate the value of Pi using PyCOMPSs.

Tasks in the Program

1. Count Points in Circle Task (count_points_in_circle):

• Generates random points within a square with side length 1.
• Counts points falling within the inscribed circle (x^2 + y^2 <= 1).
• Input: Number of points to generate (num_points)
• Output: Tuple containing count of points within the circle and list of generated ...

Name: Matrix multiplication with Files, reproducibility example, without data persistence Contact Person: [email protected] Access Level: public License Agreement: Apache2 Platform: COMPSs

Description

Matrix multiplication is a binary operation that takes a pair of matrices and produces another matrix.

If A is an n×m matrix and B is an m×p matrix, the result AB of their multiplication is an n×p matrix defined only if the number of columns m in A is equal to the number ...

Name: Matrix multiplication with Files, reproducibility example Contact Person: [email protected] Access Level: public License Agreement: Apache2 Platform: COMPSs

Description

Matrix multiplication is a binary operation that takes a pair of matrices and produces another matrix.

If A is an n×m matrix and B is an m×p matrix, the result AB of their multiplication is an n×p matrix defined only if the number of columns m in A is equal to the number of rows m in B. When multiplying ...

Name: Incrementation and Fibonacci Access Level: public License Agreement: Apache2 Platform: COMPSs

Description

Brief Overview: Demonstrates COMPSs task parallelism with increment and Fibonacci computations. Helps to understand COMPSs.

Detailed Description:

1. Performs multiple increments of input values in parallel using COMPSs.
2. Concurrently calculates Fibonacci numbers using recursive COMPSs tasks.
3. Demonstrates task synchronization via compss_wait_on.

Execution

...

Calculates the Fibonacci series up to a specified length.

Name: Matmul GPU Case 1 Cache-ON Contact Person: [email protected] Access Level: public License Agreement: Apache2 Platform: COMPSs Machine: Minotauro-MN4

Matmul running on the GPU leveraging COMPSs GPU Cache for deserialization speedup. Launched using 32 GPUs (16 nodes). Performs C = A @ B Where A: shape (320, 56_900_000) block_size (10, 11_380_000)             B: shape (56_900_000, 10)   block_size (11_380_000, 10)             C: shape (320, 10)                block_size ...

Name: Matmul GPU Case 1 Cache-OFF Contact Person: [email protected] Access Level: public License Agreement: Apache2 Platform: COMPSs 3.3 Machine: Minotauro-MN4

Matmul running on the GPU without Cache. Launched using 32 GPUs (16 nodes). Performs C = A @ B Where A: shape (320, 56_900_000) block_size (10, 11_380_000)             B: shape (56_900_000, 10)   block_size (11_380_000, 10)             C: shape (320, 10)                block_size (10, 10) Total dataset size 291 ...