04-25-2008
Well yes, if you still want it submitted by hand then that's a good solution.
9 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
I do not have the luxery of a server that i can try on, so i had to post my qn here.
Say i have two jobs in the cron table, the jobs are scheduled 2 mins apart. Assuming the first jobs does a lot of operations and takes > 2 mins. Will the second job be executed? Will Unix actually have a queue... (3 Replies)
Discussion started by: new2ss
3 Replies
2. Shell Programming and Scripting
i need to execute 5 jobs at a time in background and need to get the exit status of all the jobs i wrote small script below , i'm not sure this is right way to do it.any ideas please help.
$cat run_job.ksh
#!/usr/bin/ksh
####################################
typeset -u SCHEMA_NAME=$1
... (1 Reply)
Discussion started by: GrepMe
1 Replies
3. Shell Programming and Scripting
Hi,
I have more that 100 jobs I can run background, if I want only 4 running at ther same time, how can I write a script to control it?
Thanks
peter (0 Replies)
Discussion started by: laopi
0 Replies
4. Shell Programming and Scripting
Hello,
I am running GNU bash, version 3.2.39(1)-release (x86_64-pc-linux-gnu). I have a specific question pertaining to waiting on jobs run in sub-shells, based on the max number of parallel processes I want to allow, and then wait... (1 Reply)
Discussion started by: srao
1 Replies
5. Shell Programming and Scripting
Hi
Is it possible to run different cron jobs at the same time? It appears that when I run ones at 15 min granularity that they may prevent ones running later in the day.
Should crons run at same time have impact on one another? (4 Replies)
Discussion started by: rob171171
4 Replies
6. Red Hat
I've scheduled few jobs using cron. But they are not running .....
What might be the possible reasons ?? Also tell me how to troubleshoot.............
Please help me .......
Thanks in Advance. (2 Replies)
Discussion started by: vamshigvk475
2 Replies
7. UNIX for Dummies Questions & Answers
Hi,
I'm running atq for a user and its showing 2 'at' jobs in the queue to start at a later time.
> atq
Is there any way i can find out the creation date/time of these jobs?
and ideally what job created them and what script(s) they are going to run?
All i can see is the job number and... (3 Replies)
Discussion started by: finn
3 Replies
8. Shell Programming and Scripting
I have multiple jobs and each job dependent on other job.
Each Job generates a log and If job completed successfully log file end's with JOB ENDED SUCCESSFULLY message and if it failed then it will end with JOB ENDED with FAILURE.
I need an help how to start.
Attaching the JOB dependency... (3 Replies)
Discussion started by: santoshkumarkal
3 Replies
9. UNIX for Beginners Questions & Answers
on linux redhat, ubuntu systems, what reason would there be for a cron job not running at exactly the time it was scheduled to run, everytime?
meaning, if i put something in cron to run every 120 seconds (2 minutes), why is it that some times, i find that cron would sometimes run the job a few... (1 Reply)
Discussion started by: SkySmart
1 Replies
LEARN ABOUT REDHAT
dgelss
DGELSS(l) ) DGELSS(l)
NAME
DGELSS - compute the minimum norm solution to a real linear least squares problem
SYNOPSIS
SUBROUTINE DGELSS( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK, WORK, LWORK, INFO )
INTEGER INFO, LDA, LDB, LWORK, M, N, NRHS, RANK
DOUBLE PRECISION RCOND
DOUBLE PRECISION A( LDA, * ), B( LDB, * ), S( * ), WORK( * )
PURPOSE
DGELSS computes the minimum norm solution to a real linear least squares problem: Minimize 2-norm(| b - A*x |).
using the singular value decomposition (SVD) 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 effective rank of A is determined by treating as zero those singular values which are less than RCOND times the largest singular value.
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 the matrices B and X. NRHS >= 0.
A (input/output) DOUBLE PRECISION array, dimension (LDA,N)
On entry, the M-by-N matrix A. On exit, the first min(m,n) rows of A are overwritten with its right singular vectors, stored row-
wise.
LDA (input) INTEGER
The leading dimension of the array A. LDA >= max(1,M).
B (input/output) DOUBLE PRECISION array, dimension (LDB,NRHS)
On entry, the M-by-NRHS right hand side matrix B. On exit, B is overwritten by 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,max(M,N)).
S (output) DOUBLE PRECISION array, dimension (min(M,N))
The singular values of A in decreasing order. The condition number of A in the 2-norm = S(1)/S(min(m,n)).
RCOND (input) DOUBLE PRECISION
RCOND is used to determine the effective rank of A. Singular values S(i) <= RCOND*S(1) are treated as zero. If RCOND < 0, machine
precision is used instead.
RANK (output) INTEGER
The effective rank of A, i.e., the number of singular values which are greater than RCOND*S(1).
WORK (workspace/output) DOUBLE PRECISION array, dimension (LWORK)
On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
LWORK (input) INTEGER
The dimension of the array WORK. LWORK >= 1, and also: LWORK >= 3*min(M,N) + max( 2*min(M,N), max(M,N), NRHS ) For good perfor-
mance, LWORK should generally be larger.
If LWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of the WORK array, returns this
value as the first entry of the WORK array, and no error message related to LWORK is issued by XERBLA.
INFO (output) INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value.
> 0: the algorithm for computing the SVD failed to converge; if INFO = i, i off-diagonal elements of an intermediate bidiagonal
form did not converge to zero.
LAPACK version 3.0 15 June 2000 DGELSS(l)