09-11-2012
Autosys R11.3 : Error on log file size limit
Just had a migration from Autosys 4.5 to R11.3.
After the migration to R11.3, Autosys jobs have been failing when the log file reaches a size of 800 MB.
This did not happen before the migration, when Autosys 4.5 was used.
Is there a way to configure the file size limit/cap in Autosys R11.3?
Has anyone experienced this issue in using Autosys R11.3 and resolved it? If so, can you please advise on what can be done?
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
How do I limit size of a file to 1 MB or something like that under Linux? (4 Replies)
Discussion started by: _hp_
4 Replies
2. Solaris
I want to have a permanent file created - and limit the size that this file can grow.. I want a circular file..
ie max size of file is 10 mb.. and if any new data written to file the oldest data removed..
How can I do this?
I am on solaris 9 x86 (3 Replies)
Discussion started by: frustrated1
3 Replies
3. AIX
Can anybody help me?
How to increase file size limit in aix 5.2? I have already specified in /etc/security/limits file :
default:
fsize = -1
core = 2097151
cpu = -1
data = -1
rss = -1
stack = -1
nofiles = 2000 (2 Replies)
Discussion started by: vjm
2 Replies
4. UNIX for Advanced & Expert Users
Hi,
I have a problem writing or copying a file 2GB or larger to either the second or third disk on my C8000. I've searched this forum and found some good information on this but still nothing to solve the problem.
I'm running hpux 11i, JFS3.3 and disk version 4 (from fstyp) on all 3 disks.
... (2 Replies)
Discussion started by: HaidoodFaulkauf
2 Replies
5. Linux
Hi,
I'm using Linux 2.6 cross compiled for a embedded powerpc.
Earlier we were using busybox syslogd for logging the messages, but as the flexibilty is less, we decided to move to standard syslog.
Now I want to limit the size of the log file (/var/log/messages) to 128K.
I couldn't find... (4 Replies)
Discussion started by: jockey007
4 Replies
6. UNIX for Dummies Questions & Answers
Everytime I try to start Discreet Flame on my Octane2 machine it keeps giving me an error message "initial log size exceeds limit--aborting"
Can anyone please help me how to fix this problem. Thanks.
Octane2
IRIX64 Release 6.5
Flame 2007 (0 Replies)
Discussion started by: dewaraja
0 Replies
7. UNIX for Advanced & Expert Users
Everytime I try to start Discreet Flame on my Octane2 machine it keeps giving me an error message "initial log size exceeds limit--aborting"
Can anyone please help me how to fix this problem. Thanks.
Octane2
IRIX64 Release 6.5
Flame 2007 (0 Replies)
Discussion started by: dewaraja
0 Replies
8. Shell Programming and Scripting
Everytime I try to start Discreet Flame on my Octane2 machine it keeps giving me an error message "initial log size exceeds limit--aborting"
Can anyone please help me how to fix this problem. Thanks.
Octane2
IRIX64 Release 6.5
Flame 2007 (6 Replies)
Discussion started by: dewaraja
6 Replies
9. UNIX for Advanced & Expert Users
hi,
how can I find out what the limit of a file size is on unix?
thanks (6 Replies)
Discussion started by: JamesByars
6 Replies
10. Shell Programming and Scripting
Hi All,
I want to store 32KB of file in Oracle DB into CLOB field. I am not able to insert more than 32KB of file into CLOB. So i want to put a limit on the file size. I am using k shell.
My file size will dynamically increase its size, i want to check the file size if it is more than 32KB... (1 Reply)
Discussion started by: rajeshorpu
1 Replies
LEARN ABOUT REDHAT
sgelsx
SGELSX(l) ) SGELSX(l)
NAME
SGELSX - routine is deprecated and has been replaced by routine SGELSY
SYNOPSIS
SUBROUTINE SGELSX( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK, WORK, INFO )
INTEGER INFO, LDA, LDB, M, N, NRHS, RANK
REAL RCOND
INTEGER JPVT( * )
REAL A( LDA, * ), B( LDB, * ), WORK( * )
PURPOSE
This routine is deprecated and has been replaced by routine SGELSY. SGELSX computes the minimum-norm solution to a real linear least
squares problem:
minimize || A * X - B ||
using a complete orthogonal factorization of A. A is an M-by-N matrix which may be rank-deficient.
Several right hand side vectors b and solution vectors x can be handled in a single call; they are stored as the columns of the M-by-NRHS
right hand side matrix B and the N-by-NRHS solution matrix X.
The routine first computes a QR factorization with column pivoting:
A * P = Q * [ R11 R12 ]
[ 0 R22 ]
with R11 defined as the largest leading submatrix whose estimated condition number is less than 1/RCOND. The order of R11, RANK, is the
effective rank of A.
Then, R22 is considered to be negligible, and R12 is annihilated by orthogonal transformations from the right, arriving at the complete
orthogonal factorization:
A * P = Q * [ T11 0 ] * Z
[ 0 0 ]
The minimum-norm solution is then
X = P * Z' [ inv(T11)*Q1'*B ]
[ 0 ]
where Q1 consists of the first RANK columns of Q.
ARGUMENTS
M (input) INTEGER
The number of rows of the matrix A. M >= 0.
N (input) INTEGER
The number of columns of the matrix A. N >= 0.
NRHS (input) INTEGER
The number of right hand sides, i.e., the number of columns of matrices B and X. NRHS >= 0.
A (input/output) REAL array, dimension (LDA,N)
On entry, the M-by-N matrix A. On exit, A has been overwritten by details of its complete orthogonal factorization.
LDA (input) INTEGER
The leading dimension of the array A. LDA >= max(1,M).
B (input/output) REAL array, dimension (LDB,NRHS)
On entry, the M-by-NRHS right hand side matrix B. On exit, the N-by-NRHS solution matrix X. If m >= n and RANK = n, the residual
sum-of-squares for the solution in the i-th column is given by the sum of squares of elements N+1:M in that column.
LDB (input) INTEGER
The leading dimension of the array B. LDB >= max(1,M,N).
JPVT (input/output) INTEGER array, dimension (N)
On entry, if JPVT(i) .ne. 0, the i-th column of A is an initial column, otherwise it is a free column. Before the QR factorization
of A, all initial columns are permuted to the leading positions; only the remaining free columns are moved as a result of column
pivoting during the factorization. On exit, if JPVT(i) = k, then the i-th column of A*P was the k-th column of A.
RCOND (input) REAL
RCOND is used to determine the effective rank of A, which is defined as the order of the largest leading triangular submatrix R11
in the QR factorization with pivoting of A, whose estimated condition number < 1/RCOND.
RANK (output) INTEGER
The effective rank of A, i.e., the order of the submatrix R11. This is the same as the order of the submatrix T11 in the complete
orthogonal factorization of A.
WORK (workspace) REAL array, dimension
(max( min(M,N)+3*N, 2*min(M,N)+NRHS )),
INFO (output) INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
LAPACK version 3.0 15 June 2000 SGELSX(l)