mirror of
https://github.com/gentoo-mirror/guru.git
synced 2026-07-21 04:53:07 -04:00
sys-cluster/muster: initial import
Signed-off-by: Alessandro Barbieri <lssndrbarbieri@gmail.com>
This commit is contained in:
32
sys-cluster/muster/metadata.xml
Normal file
32
sys-cluster/muster/metadata.xml
Normal file
@@ -0,0 +1,32 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd">
|
||||
<pkgmetadata>
|
||||
<maintainer type="person">
|
||||
<email>lssndrbarbieri@gmail.com</email>
|
||||
<name>Alessandro Barbieri</name>
|
||||
</maintainer>
|
||||
<upstream>
|
||||
<remote-id type="github">LLNL/muster</remote-id>
|
||||
</upstream>
|
||||
<longdescription lang="en">
|
||||
The Muster library provides implementations of serial and parallel K-Medoids
|
||||
clustering algorithms. It is intended as a general framework for parallel
|
||||
cluster analysis, particularly for performance data analysis on systems with
|
||||
very large numbers of processes.
|
||||
|
||||
The parallel implementations in the Muster are designed to perform well even
|
||||
in environments where the data to be clustered is entirely distributed. For
|
||||
example, many performance tools need to analyze one data element from each
|
||||
process in a system. To analyze this data efficiently, clustering algorithms
|
||||
that move as little data as possible are required. In Muster, we exploit
|
||||
sampled clustering algorithms to realize this efficiency.
|
||||
|
||||
The parallel algorithms in Muster are implemented using the Message Passing
|
||||
Interface (MPI), making them suitable for use on many of the world's largest
|
||||
supercomputers. They should, however, also run efficiently on your laptop.
|
||||
</longdescription>
|
||||
<use>
|
||||
<flag name="pmpi">Build with PMPI bindings</flag>
|
||||
<flag name="tests">Build and install test programs</flag>
|
||||
</use>
|
||||
</pkgmetadata>
|
||||
Reference in New Issue
Block a user