Guru's
I need to develop a graph which shows the CPU, memory and swap space utilization in a single graph against time
I know of NMON but I am not able to make a single graph out of it.
Does anyone know of any script or tool for data sampling and developing graph?
Thanks in advance
... (1 Reply)
It's been a while since i've been here.. and hopefully you can help me.
I have created a script to get the filesystem utilization. Now i want to create a growth graph, which would show how much kb we increase per day.
Here's the data
03-02-2010 00:00:00: /dev/md/dsk/d30 46473377 7355320... (5 Replies)
Hi,
Is it possible to have a Solaris cluster of 2 nodes at SITE-A using SVM and creating metaset using say 2 LUNs (on SAN). Then replicating these 2 LUNs to remote site SITE-B via storage based replication and then using these LUNs by importing them as a metaset on a server at SITE-B which is... (0 Replies)
Dear all,
I have a hash in my data file and I'd like to output the data contained within as a graph (can be lines or histogram form) but I dont know how to do this with Perl.
Can somone suggest how I can have a graph with Keys of the hash being on the X-axis and the Values for the keys plotted on... (1 Reply)
Hello,
Please how can represent this graph in java ?
i have to apply an algorithm on this graphe, the first instruction of the algorithm is to verify if the three last vertices are dependent or not ?
Thank you. (1 Reply)
Hi
I have a file:
r58778.3|SOURCES={KEY=f665931a...,fw,221-705}|ERRORS={16_1:T,30_1:T,56_1:C,57_1:T,59_1:A,101_1:A,115:-,158_1:C,186_1:A,204:-,271_1:T,305:-,350_1:C,368_1:G,442_1:C,472_1:G,477_1:A}|SOURCE_1="Contig_1092402550638"(f665931a359e36cea0976db191ff60ff09cc816e)
I want to retain... (15 Replies)
Hi Experts,
I am in need of running a script from one node say node 1 via node 2.
My scheduling tool dont have access to node2 , so i need to invoke the list file from node1 but the script needs to run from node2. because the server to which i am hitting, is having access only for the node... (5 Replies)
Hi,
We have HP UX service guard cluster on OS 11.23. Recently 40+ LUNs presented to both nodes by SAN team but I was asked to mount them on only one node. I created required VGs/LVs, created VxFS and mounted all of them and they are working fine. Now client requested those FS on 2nd node as... (4 Replies)
Discussion started by: prvnrk
4 Replies
LEARN ABOUT OSX
mpi_graph_create
MPI_Graph_create(3OpenMPI)MPI_Graph_create(3OpenMPI)NAME
MPI_Graph_create - Makes a new communicator to which topology information has been attached.
SYNTAX C Syntax
#include <mpi.h>
int MPI_Graph_create(MPI_Comm comm_old, int nnodes, int *index,
int *edges, int reorder, MPI_Comm *comm_graph)
Fortran Syntax
INCLUDE 'mpif.h'
MPI_GRAPH_CREATE(COMM_OLD, NNODES, INDEX, EDGES, REORDER,
COMM_GRAPH, IERROR)
INTEGER COMM_OLD, NNODES, INDEX(*), EDGES(*)
INTEGER COMM_GRAPH, IERROR
LOGICAL REORDER
C++ Syntax
#include <mpi.h>
Graphcomm Intracomm::Create_graph(int nnodes, const int index[],
const int edges[], bool reorder) const
INPUT PARAMETERS
comm_old Input communicator without topology (handle).
nnodes Number of nodes in graph (integer).
index Array of integers describing node degrees (see below).
edges Array of integers describing graph edges (see below).
reorder Ranking may be reordered (true) or not (false) (logical).
OUTPUT PARAMETERS
comm_graph
Communicator with graph topology added (handle).
IERROR Fortran only: Error status (integer).
DESCRIPTION
MPI_Graph_create returns a handle to a new communicator to which the graph topology information is attached. If reorder = false then the
rank of each process in the new group is identical to its rank in the old group. Otherwise, the function may reorder the processes. If the
size, nnodes, of the graph is smaller than the size of the group of comm_old, then some processes are returned MPI_COMM_NULL, in analogy to
MPI_Cart_create and MPI_Comm_split. The call is erroneous if it specifies a graph that is larger than the group size of the input communi-
cator.
The three parameters nnodes, index, and edges define the graph structure. nnodes is the number of nodes of the graph. The nodes are num-
bered from 0 to nnodes-1. The ith entry of array index stores the total number of neighbors of the first i graph nodes. The lists of neigh-
bors of nodes 0, 1, ..., nnodes-1 are stored in consecutive locations in array edges. The array edges is a flattened representation of the
edge lists. The total number of entries in index is nnodes and the total number of entries in edges is equal to the number of graph edges.
The definitions of the arguments nnodes, index, and edges are illustrated with the following simple example.
Example: Assume there are four processes 0, 1, 2, 3 with the following adjacency matrix:
Process Neighbors
0 1, 3
1 0
2 3
3 0, 2
Then, the input arguments are:
nnodes = 4
index = 2, 3, 4, 6
edges = 1, 3, 0, 3, 0, 2
Thus, in C, index[0] is the degree of node zero, and index[i] - index[i-1] is the degree of node i, i=1, . . . , nnodes-1; the list of
neighbors of node zero is stored in edges[j], for 0 <= j <= index[0] - 1 and the list of neighbors of node i, i > 0 , is stored in
edges[j], index[i-1] <= j <= index[i] - 1.
In Fortran, index(1) is the degree of node zero, and index(i+1) - index(i) is the degree of node i, i=1, . . . , nnodes-1; the list of
neighbors of node zero is stored in edges(j), for 1 <= j <= index(1) and the list of neighbors of node i, i > 0, is stored in edges(j),
index(i) + 1 <= j <= index(i + 1).
ERRORS
Almost all MPI routines return an error value; C routines as the value of the function and Fortran routines in the last argument. C++ func-
tions do not return errors. If the default error handler is set to MPI::ERRORS_THROW_EXCEPTIONS, then on error the C++ exception mechanism
will be used to throw an MPI:Exception object.
Before the error value is returned, the current MPI error handler is called. By default, this error handler aborts the MPI job, except for
I/O function errors. The error handler may be changed with MPI_Comm_set_errhandler; the predefined error handler MPI_ERRORS_RETURN may be
used to cause error values to be returned. Note that MPI does not guarantee that an MPI program can continue past an error.
SEE ALSO
MPI_Graph_get
MPI_Graphdims_get
Open MPI 1.2 September 2006 MPI_Graph_create(3OpenMPI)