Workflows

What is a Workflow?
36 Workflows visible to you, out of a total of 37

Name: Random Forest Contact Person: support-compss@bsc.es Access Level: public License Agreement: Apache2 Platform: COMPSs Machine: MareNostrum4 This is an example of Random Forest algorithm from dislib. To show the usage, the code generates a synthetical input matrix. The results are printed by screen. This application used dislib-0.9.0

Name: GridSearchCV Contact Person: support-compss@bsc.es Access Level: public License Agreement: Apache2 Platform: COMPSs Machine: MareNostrum5

GridSearch of kNN algorithm for the iris.csv dataset (https://gist.githubusercontent.com/netj/8836201/raw/6f9306ad21398ea43cba4f7d537619d0e07d5ae3/iris.csv). This application used dislib-0.9.0

Name: GridSearchCV Contact Person: support-compss@bsc.es Access Level: public License Agreement: Apache2 Platform: COMPSs Machine: MareNostrum5

GridSearch of kNN algorithm for the iris.csv dataset (https://gist.githubusercontent.com/netj/8836201/raw/6f9306ad21398ea43cba4f7d537619d0e07d5ae3/iris.csv). This application used dislib-0.9.0

Stable

Name: Matrix Multiplication Contact Person: support-compss@bsc.es 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 A and B, the elements of the ...

Type: COMPSs

Creator: Raül Sirvent

Submitter: Raül Sirvent

DOI: 10.48546/workflowhub.workflow.1088.1

Stable

Name: Matrix Multiplication Contact Person: support-compss@bsc.es 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 A and B, the elements of the ...

Type: COMPSs

Creator: Raül Sirvent

Submitter: Raül Sirvent

DOI: 10.48546/workflowhub.workflow.1086.1

Stable

Lysozyme in water full COMPSs application

Type: COMPSs

Creator: Javier Conejero

Submitter: Raül Sirvent

Name: KMeans Contact Person: support-compss@bsc.es Access Level: public License Agreement: Apache2 Platform: COMPSs Machine: MareNostrum5

KMEans for clustering the housing.csv dataset (https://github.com/sonarsushant/California-House-Price-Prediction/blob/master/housing.csv). This application used dislib-0.9.0

Stable

Name: TruncatedSVD (Randomized SVD) Contact Person: support-compss@bsc.es Access Level: public License Agreement: Apache2 Platform: COMPSs Machine: MareNostrum5

TruncatedSVD (Randomized SVD) for computing just 456 singular values out of a (4.5M x 850) size matrix. The input matrix represents a CFD transient simulation of air moving past a cylinder. This application used dislib-0.9.0

Type: COMPSs

Creator: Cristian Tatu

Submitter: Cristian Tatu

Stable

Name: SparseLU Contact Person: support-compss@bsc.es 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. ...

Type: COMPSs

Creator: Raül Sirvent

Submitter: Raül Sirvent

DOI: 10.48546/workflowhub.workflow.1047.1

Stable

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

Type: COMPSs

Creator: Raül Sirvent

Submitter: Raül Sirvent

DOI: 10.48546/workflowhub.workflow.1046.1

Powered by
(v.1.16.0-main)
Copyright © 2008 - 2024 The University of Manchester and HITS gGmbH