Solaris server read and write randomly slow Post: 302902874

9 More Discussions You Might Find Interesting

1. Post Here to Contact Site Administrators and Moderators

It seems last 20 min Server was very very Slow

Hi Guys, Since last 20-30 min Server was Too slow ..even few of times i got Database connection error. Thanks Sanjay Tripathi

2. HP-UX

Server become too slow

Hi, Since last week our server become too slow when we try to run application on it. When we run top command, it show as below: So it's nothing to do with heavy utilization, right? Can you give some opinion on what actually had happended? Thank you very much... :b:

3. Shell Programming and Scripting

Read line from file randomly

I have data file with customer.dat, and this contains the customer names >cat customer.dat FirstName1 LastName1 FistName2 LastName1 FistName3 MiddleName3 LastName3 This file can contain areoun 100 customer names. Regards,

4. Shell Programming and Scripting

use awk to read randomly located columns in an excel file

Hi, I have an excel file that have a random count of columns/fields and what im trying to do is to only retrieve all the rows under 2 specific field headers. I can use the usually command for awk which is awk 'print{ $1 $2}' > output.txt, but the location of the 2 specific field headers is...

5. UNIX for Advanced & Expert Users

Linux server is slow

Hello, I am using Redhat redhat 4 update 4 kernal 2.6. My server is some time suddenly running slow. The averge cpu load goes up to 50 to 60. (There is only two CPU and usually, the averge load is between 1 to 2.5) That time, i see, there are several sessions connected. Normally, we have...

6. Shell Programming and Scripting

Find all files with group read OR group write OR user write permission

I need to find all the files that have group Read or Write permission or files that have user write permission. This is what I have so far: find . -exec ls -l {} \; | awk '/-...rw..w./ {print $1 " " $3 " " $4 " " $9}' It shows me all files where group read = true, group write = true...

7. IP Networking

read/write,write/write lock with smbclient fails

Hi, We have smb client running on two of the linux boxes and smb server on another linux system. During a backup operation which uses smb, read of a file was allowed while write to the same file was going on.Also simultaneous writes to the same file were allowed.Following are the settings in the...

8. Solaris

Hard disk write performance very slow

Dear All, I have a hard disk in solaris on which the write performanc is too slow. The CPU , RAM memory are absolutely fine. What might be reason. Kindly explain. Rj

9. Infrastructure Monitoring

99% performance wa, slow server.

There is a big problem with the server (VPS based on OpenVZ, CentOS 5, 3GB RAM). The problem is the following. The first 15-20 minutes after starting the server is operating normally, the load average is less than or about 1.0, but then begins to increase sharply% wa, then hovers around 95-99%....

LEARN ABOUT REDHAT

dlaeda

DLAEDA(l)								 )								 DLAEDA(l)

NAME

       DLAEDA  -  compute the Z vector corresponding to the merge step in the CURLVLth step of the merge process with TLVLS steps for the CURPBMth
       problem

SYNOPSIS

       SUBROUTINE DLAEDA( N, TLVLS, CURLVL, CURPBM, PRMPTR, PERM, GIVPTR, GIVCOL, GIVNUM, Q, QPTR, Z, ZTEMP, INFO )

	   INTEGER	  CURLVL, CURPBM, INFO, N, TLVLS

	   INTEGER	  GIVCOL( 2, * ), GIVPTR( * ), PERM( * ), PRMPTR( * ), QPTR( * )

	   DOUBLE	  PRECISION GIVNUM( 2, * ), Q( * ), Z( * ), ZTEMP( * )

PURPOSE

       DLAEDA computes the Z vector corresponding to the merge step in the CURLVLth step of the merge process with TLVLS steps	for  the  CURPBMth
       problem.

ARGUMENTS

       N      (input) INTEGER
	      The dimension of the symmetric tridiagonal matrix.  N >= 0.

       TLVLS  (input) INTEGER
	      The total number of merging levels in the overall divide and conquer tree.

	      CURLVL (input) INTEGER The current level in the overall merge routine, 0 <= curlvl <= tlvls.

	      CURPBM  (input)  INTEGER	The  current  problem in the current level in the overall merge routine (counting from upper left to lower
	      right).

	      PRMPTR (input) INTEGER array, dimension (N lg N) Contains a list of pointers which indicate where in PERM a level's  permutation	is
	      stored.  PRMPTR(i+1) - PRMPTR(i) indicates the size of the permutation and incidentally the size of the full, non-deflated problem.

       PERM   (input) INTEGER array, dimension (N lg N)
	      Contains the permutations (from deflation and sorting) to be applied to each eigenblock.

	      GIVPTR  (input)  INTEGER array, dimension (N lg N) Contains a list of pointers which indicate where in GIVCOL a level's Givens rota-
	      tions are stored.  GIVPTR(i+1) - GIVPTR(i) indicates the number of Givens rotations.

	      GIVCOL (input) INTEGER array, dimension (2, N lg N) Each pair of numbers indicates a pair of columns to take place in a Givens rota-
	      tion.

	      GIVNUM  (input)  DOUBLE  PRECISION  array,  dimension  (2, N lg N) Each number indicates the S value to be used in the corresponding
	      Givens rotation.

       Q      (input) DOUBLE PRECISION array, dimension (N**2)
	      Contains the square eigenblocks from previous levels, the starting positions for blocks are given by QPTR.

       QPTR   (input) INTEGER array, dimension (N+2)
	      Contains a list of pointers which indicate where in Q an eigenblock is stored.  SQRT( QPTR(i+1) - QPTR(i) ) indicates  the  size	of
	      the block.

       Z      (output) DOUBLE PRECISION array, dimension (N)
	      On output this vector contains the updating vector (the last row of the first sub-eigenvector matrix and the first row of the second
	      sub-eigenvector matrix).

       ZTEMP  (workspace) DOUBLE PRECISION array, dimension (N)

       INFO   (output) INTEGER
	      = 0:  successful exit.
	      < 0:  if INFO = -i, the i-th argument had an illegal value.

FURTHER DETAILS

       Based on contributions by
	  Jeff Rutter, Computer Science Division, University of California
	  at Berkeley, USA

LAPACK version 3.0						   15 June 2000 							 DLAEDA(l)