hello, we have a aix 5.2 server with 8GB of ram. is it possible, without actually removing the hardware, to have the O/S think it has only 4GB of ram? We would like to see how the handles and responds if it only had 4Gb instead of the 8GB. Any ideas or suggestions? Thanks
Looks like i found... (6 Replies)
Hi,
I have a server which is running out of space on the rootvg. When trying to find some spare space I discovered there are 2 sysdump logical volumes, each of 5GB, yet if I get an estimate of the dump size it's only 0.5 GB.
$ lsvg -l rootvg|grep sysdump
hd71 sysdump 20 ... (1 Reply)
Hi All,
The below script I run daily and it consumes 2 hours approx.
In this I am calling another script and executing the same twice.
Is the loop below the cause for the slow process?Is it possible to finetune the program so that it runs in a much faster way?
The first script:
#!/bin/ksh... (4 Replies)
Hi
I have used gzip on AIX and the used paging space has jumped from 7% to 20%. The gzip process is finished since a long time. But the used paging space is still the same. How to release this space ? (1 Reply)
Hi All,
Could some one help me to reduce the code...
if
then
./plist -m "$queuename" |grep $2|awk '{print $3}' >unlock.log
elif
then
./plist -m "$queuename" |grep $2|awk '{print $4}' >unlock.log
else
./plist -m "$queuename" |grep $2|awk '{print $5}' >unlock.log
.
.
.
.
... (1 Reply)
hi all,
i have written the following script that does this work:
1. copy large logs files from one server to another.
2. then unzip this files and extraxt from these large https logs only those fields that are neccesary.
3. then archive the extracted logs to new files.
BUT the problem is... (7 Replies)
Dear All,
I have to reduce the redundancy of a file that is like this:
a b 0
a c 0
a f 1
b a 1
b a 0
b c 1
d f 0
g h 1
f d 1
Basically, this file describe a network with relative nodes and edges.
The nodes are the different letters and the edges are represented by the numbers (in... (7 Replies)
Discussion started by: giuliangiuseppe
7 Replies
LEARN ABOUT DEBIAN
mpi_kmeans
MPI_KMEANS(1) General Commands Manual MPI_KMEANS(1)NAME
mpi_kmeans - K-Means clustering tool
SYNOPSIS
mpi_kmeans [options]
DESCRIPTION
mpi_kmeans is a program that uses k-means clustering to produce a list of cluster centers. The resulting data can be used by mpi_assign(1)
to assign points to those cluster centers.
OPTIONS
A summary of options is included below.
Generic Options:
--help Produce help message
Input/Output Options:
--data file
Training file, one datum per line (default: "data.txt")
--output file
Output file, one cluster center per line (default: "output.txt")
K-Means Options:
--k num
Number of clusters to generate (default: 100)
--restarts num
Number of k-means restarts (default: 0 = single run)
--maxiter num
Maximum number of k-means iterations (default: 0 = infinity)
EXAMPLES
mpi_kmeans --k 2 --data example.txt --output clusters.txt
SEE ALSO mpi_assign(1)AUTHOR
mpi_kmeans was written by Peter Gehler <peter.gehler@tuebingen.mpg.de>.
This manual page was written by Christian Kastner <debian@kvr.at>, for the Debian project (and may be used by others).
April 11, 2011 MPI_KMEANS(1)