Hi ,
How can i set a cronjob which needs to run every 05,20,35,50 min .
I tried 05,20,35,50 * * * * /exec/eerrtis/tttttk/AOOK00000/bin/Packing.sh.. but its giving error while saving the crontab
file ....
What is the correct way ???
Thanks and Regards (4 Replies)
hi!
i have a file like the attachement.
I'd like to get for each line the min, max and average values. (there is 255 values for each line)
how can i get that ?
i try this, is it right?
BEGIN {FS = ","; OFS = ";";max=0;min=0;moy=0;total=0;freq=890}
$0 !~ /Trace1:/ {
... (1 Reply)
I need help trying to grep for a error in log file for only last 15 min.
example
under /var/adm/messages i need to grep for "error 102" but only if it occured in last 15 mins?
Thanks (7 Replies)
I want to check the counter value for every 1 min until the particular counter value is reached and it should exit.
Counter value: 15.( For Example)
counter = 1
The start time is noted using Localtime.
How can i do this in perl?
Regards
Archana (1 Reply)
hi,
i have a file with folowing content:
STORAGE PERCENTAGE FLAG:
/storage_01 64% 0
/storage_02 17% 1
/storage_03 10% 0
/storage_04 50% 1
I need to get the value of STORAGE from those with FLAG=0 and which has the min PERCENTAGE
i am able to get the STORAGE corresponding to... (8 Replies)
Dear All
I am using Solaris8 on my sun UltraSPARC machine. Can you please let
me know what is the minimum HW requirement to install Solaris10g ?
Thank you in advance (1 Reply)
Hi,
I am trying to run a script in cron every 5 min in SOLARIS 10
When I do5 * * * * /path to fileor*/5 * * * * /path to file
Doesn't work. Please let me know what should I put in the cron entry
Thanks (2 Replies)
Gents,
I have a big file file like this.
5100010002
5100010004
5100010006
5100010008
5100010010
5100010012
5102010002
5102010004
5102010006
5102010008
5102010010
5102010012
The file is sorted and I would like to find the min and max value, taking in the consideration key1... (3 Replies)
Discussion started by: jiam912
3 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)