High Performance Computing Post: 302257144

6 More Discussions You Might Find Interesting

1. AIX

Performance Problem - High CPU utilization

Hello everybody. I have a problem with my AIX 5.3. Recently my unix shows a high cpu utilization with sar or topas. I need to find what I have to do to solve this problem, in fact, I don't know what is my problem. I had the same problem with another AIX 5.3 running the same...

2. High Performance Computing

IBM Scheduler for High Throughput Computing on IBM Blue Gene P

A lightweight scheduler that supports high-throughput computing (HTC) applications on Blue Gene/P. (NEW: 06/12/2008 in grid) More...

3. High Performance Computing

What does high performance computing mean?

Sorry, I am not really from a computer science background. But from the subject of it, does it mean something like multi processor programming? distributed computing? like using erlang? Sound like it, which excite me. I just had a 3 day crash course in erlang and "Cocurrency oriented programming"...

4. High Performance Computing

High performance Linkpack

hello everyone , Im new to HPL. i wanted to know whether High performance linpack solves linear system of equations for single precision airthmatic on LINUX. it works for double precision , so is there any HPL version which is for single precision.\ thanks .

5. Emergency UNIX and Linux Support

Performance investigation, very high runq-sz %runocc

I've just been handed a hot potato from a colleague who left :(... our client has been complaining about slow performance on one of our servers. I'm not very experienced in investigating performance issues so I hoping someone will be so kind to provide some guidance Here is an overview of the...

6. High Performance Computing

High Performance Linpack Compiling Issue

I'm trying to compile Linpack on a Ubuntu cluster. I'm running MPI. I've modified the following values to fit my system TOPdir MPdir LAlib CC LINKER. When compiling I get the following error: (the error is at the end, the other errors in between are because I've ran the script several times so...

LEARN ABOUT DEBIAN

gc

GC(1)							      General Commands Manual							     GC(1)

NAME

       gc - count graph components

SYNOPSIS

       gc [ -necCaDUrs?  ] [ files ]

DESCRIPTION

       gc is a graph analogue to wc in that it prints to standard output the number of nodes, edges, connected components or clusters contained in
       the input files.  It also prints a total count for all graphs if more than one graph is given.

OPTIONS

       The following options are supported:

       -n     Count nodes.

       -e     Count edges.

       -c     Count connected components.

       -C     Count clusters. By definition, a cluster is a graph or subgraph whose name begins with "cluster".

       -a     Count all. Equivalent to -encC

       -r     Recursively analyze subgraphs.

       -s     Print no output. Only exit value is important.

       -D     Only analyze directed graphs.

       -U     Only analyze undirected graphs.

       -?     Print usage information.

       By default, gc returns the number of nodes and edges.

OPERANDS

       The following operand is supported:

       files   Names of files containing 1 or more graphs in dot format.  If no files operand is specified, the standard input will be used.

EXIT STATUS

       The following exit values are returned:

       0   Successful completion.

       1   The -U or -E option was used, and a graph of the wrong type was encountered.

AUTHOR

       Emden R. Gansner <erg@research.att.com>

SEE ALSO

       wc(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), sccmap(1), tred(1), libgraph(3)

								   21 March 2001							     GC(1)