@ Don I was about to post answer, you are right let him learn, will see what he tried so far.
------edit-------------
for input given in post #1
Next time I am not going to answer,till you show your effort towards it..this is the best opportunity to learn, so take advantage of it. don't just copy paste.. I hope you followed what Don said.
Last edited by Akshay Hegde; 11-30-2013 at 02:03 AM..
This User Gave Thanks to Akshay Hegde For This Post:
Hi,
How can we apply lock on a text file through Unix Ksh script. I did found a command flock (file descriptor) but am not very acquainted with the usage.
Can anybody tell me if I need to use Flock command for applying locks to a file while writing on it. If the person can explain the usage... (3 Replies)
I have an L point filter flt which I need to apply to an array fin length N, the result being stored in fout. The filter will start shifting until one gets to the last element of fin.
How can I do this. I ma getting quite confused. :wall:
I got an array of indices ixa and ixb which give the... (2 Replies)
I have a value X, a value DX and an odd integer N (say N=9) and want to create an array such that
let X = 10, DX = 2 and N = 9
DIST(1) = X - 4 * DX
DIST(2) = X - 3 * DX
DIST(3) = X - 2 * DX
DIST(4) = X - DX
DIST(5) = X
DIST(6) = X + DX
DIST(7) = X + 2 * DX
DIST(8) = X + 3 * DX
DIST(9)... (2 Replies)
Hi Admins,
Basically i am HPUX guy.HP will release patch bundles every three months and the same we are applying on servers as proactive steps. Please let me know how it happens with AIX.
My servers are AIX 5.3 with TL 10 and some are TL 7.
These servers are installed 2 years back and... (1 Reply)
Hi,
I'm having a general query. If we do cat <file name> on a Ebcidic format file then many unknown characters are displayed in my screen.
Can we change the character set related to EBCIDIC in session level and apply the cat command on a EBCIDIC file? By doing so can we able to see the... (2 Replies)
I am trying to apply an awk action over multiple files in a directory. It is a simple action, I want to print out the 1st 2 columns (i.e. $1 and $2) in each tab-separated document and output the result in a new file *.pp
This is the awk that I have come up with so far, which is not giving me a... (6 Replies)
I have applied a patch using this command:
patch -p1 < (file)
then I did git commit -a.
Now I want to recompile the kernel for making this patch live.
Should I use
make oldconfig
or
make localmodconfig
After that,
make -j$(grep -c "processor" /proc/cpuinfo)
sudo make... (1 Reply)
The version of Samba in our billing server is 4.1.17-Debian.
I have been reminded by our management to implement the patch for Samba on this server.
However, I am not sure how to implement the patch. I have browsed some websites for the correct patch to implement for Samba 4.1.17, and the patch... (11 Replies)
Discussion started by: anaigini45
11 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)