aboutsummaryrefslogtreecommitdiff
blob: 205bfc450f9ee22944354af8bbd6aff2738b751c (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE pkgmetadata SYSTEM "https://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>