05-12-2011
for ((i=1; i<=3; i++));do eval "one-$i=one.$RANDOM" ; done
"-" requirement is there.
So, any other solution to execute this commad
9 More Discussions You Might Find Interesting
1. UNIX for Advanced & Expert Users
hi i have small shell script as follows
cd /utilities/promoter/tmp
grep SENDREPLY $1 | grep 'zzzzz@zzz.com' | awk -F" -f1 > /tmp/$LOGNAME/$1.request
cd /tmp/$LOGNAME
grep -e "\.sql" -e "\.md" $1.request > upd_$1.txt
grep -v -e "\.sql" -e "\.md" $1.request > copy_$1.txt
... (1 Reply)
Discussion started by: zedex
1 Replies
2. UNIX for Advanced & Expert Users
hi Guys!
My requirement is... I need to get notified if somebody executes a specific commands...like kill or httpd stop.... something like that....
can somebody help me out...
Regards,
kiran (8 Replies)
Discussion started by: dddkiran
8 Replies
3. Shell Programming and Scripting
a) cd /root/user/dir/sd/disk
./runInstaller -silent -responseFile
b) cd /root1/user1
cp /root/user/dir/sd/disk/ram.txt
now a) executes and starts running but b) interupts a) and is executed while a) is running on the other hand
so I want b) to start only after successfull completion of... (6 Replies)
Discussion started by: sriki32
6 Replies
4. Solaris
hi,
i have to get the info between start to stop of a command execution
suppose,
if we execute the command like pkgadd then while its executing it ask some questions , i have to get total information untill pkgadd command complete into a perticular file. (3 Replies)
Discussion started by: shankr3
3 Replies
5. AIX
Hi,
I'm planning to update managed system firmware to new release using HMC.
This is cite from IBM documentation describing HMC managed system updates:
What I know we install new firmware to T side and in case some problems we boot P side and reject new fw on T.
So if HMC updates both T and... (0 Replies)
Discussion started by: vilius
0 Replies
6. Shell Programming and Scripting
Hi Experts,
I am very much new to linux scripting, I am currently working on reducing my manual work and hence writing a script to automate few task.
I am running below command to snmpwalk the router..
snmpwalk -v 3 -u WANDL_SU -a MD5 -A vfipmpls -x DES -X VfIpMpLs -l authPriv... (19 Replies)
Discussion started by: Hanumant.madane
19 Replies
7. Shell Programming and Scripting
below is the output xml string from some other command and i will be parsing it using awk
cat /tmp/alerts.xml
<Alert id="10102" name="APP-DS-ds_ha-140018-componentFailure-S" alertDefinitionId="13982" resourceId="11427" ctime="1359453507621" fixed="false" reason="If Event/Log Level(ANY) and... (2 Replies)
Discussion started by: vivek d r
2 Replies
8. UNIX for Advanced & Expert Users
Hi All,
We have a table that has to store around 80-100 million records. The table is partitioned by a column called Market Code. There are 30 partitions each corresponding to one MRKT_CD.
The source of this table is a join between 3-4 other tables. We are loading this table through SQLPLUS... (2 Replies)
Discussion started by: jerome_rajan
2 Replies
9. UNIX for Dummies Questions & Answers
Hello Experts,
I am still learning linux and have come across a question, hope to get some answer.
I have two servers, and both have the same version of svn client installed and both have the same user_id.
my SVN client version:
svn, version 1.6.11 (r934486)
compiled Mar 2 2011,... (4 Replies)
Discussion started by: babyPen1985
4 Replies
LEARN ABOUT DEBIAN
bup-margin
bup-margin(1) General Commands Manual bup-margin(1)
NAME
bup-margin - figure out your deduplication safety margin
SYNOPSIS
bup margin [options...]
DESCRIPTION
bup margin iterates through all objects in your bup repository, calculating the largest number of prefix bits shared between any two
entries. This number, n, identifies the longest subset of SHA-1 you could use and still encounter a collision between your object ids.
For example, one system that was tested had a collection of 11 million objects (70 GB), and bup margin returned 45. That means a 46-bit
hash would be sufficient to avoid all collisions among that set of objects; each object in that repository could be uniquely identified by
its first 46 bits.
The number of bits needed seems to increase by about 1 or 2 for every doubling of the number of objects. Since SHA-1 hashes have 160 bits,
that leaves 115 bits of margin. Of course, because SHA-1 hashes are essentially random, it's theoretically possible to use many more bits
with far fewer objects.
If you're paranoid about the possibility of SHA-1 collisions, you can monitor your repository by running bup margin occasionally to see if
you're getting dangerously close to 160 bits.
OPTIONS
--predict
Guess the offset into each index file where a particular object will appear, and report the maximum deviation of the correct answer
from the guess. This is potentially useful for tuning an interpolation search algorithm.
--ignore-midx
don't use .midx files, use only .idx files. This is only really useful when used with --predict.
EXAMPLE
$ bup margin
Reading indexes: 100.00% (1612581/1612581), done.
40
40 matching prefix bits
1.94 bits per doubling
120 bits (61.86 doublings) remaining
4.19338e+18 times larger is possible
Everyone on earth could have 625878182 data sets
like yours, all in one repository, and we would
expect 1 object collision.
$ bup margin --predict
PackIdxList: using 1 index.
Reading indexes: 100.00% (1612581/1612581), done.
915 of 1612581 (0.057%)
SEE ALSO
bup-midx(1), bup-save(1)
BUP
Part of the bup(1) suite.
AUTHORS
Avery Pennarun <apenwarr@gmail.com>.
Bup unknown- bup-margin(1)