04-02-2009
Tree was the answer
Thanks VBE,
I made a tree and was able to see it much clearer. I made 4 seperate scripts using case statements. Now my assignment is complete.
Now i got addicted to this stuff and want to add a scoring system where i can append a score. Any ideas?
gpro
7 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
I am doing a "research" paper for school and i'm having a hard time finding accurate information. I am supposed to choose three differant versions of unix, give a brief explination of each, tell why there each differant from each other. I have found a ton of web sites but the information is so vast... (1 Reply)
Discussion started by: pantsusan
1 Replies
2. OS X (Apple)
See this threads:
Page Not Found - Apple
Open Source - Apple (0 Replies)
Discussion started by: Neo
0 Replies
3. UNIX for Dummies Questions & Answers
Hello, I had install the rock cluster 4.3 version on my pcs..but i can't access into the desktop...may i know what is the problem? (1 Reply)
Discussion started by: joannetan9984
1 Replies
4. UNIX for Dummies Questions & Answers
hi, may i know how to run mpi after i had install the rock cluster? is there any guidelines or examples? (0 Replies)
Discussion started by: joannetan9984
0 Replies
5. High Performance Computing
Hai,
I am trying to install rock4.3 in my Intel core2 quad process, but when i insert kernel cd which is the first step in the installation procedure, it asks for driver disk not found.. insert CD/DVD ROM even after i inserted my CD in my driver.. could anyone help me in solving this problem...... (1 Reply)
Discussion started by: sasirekha
1 Replies
6. UNIX and Linux Applications
Hi
Server configuration is
Processor : xeon 64 bit
Os: centos 5
We are in the process of setting up the Rock Cluster with 5 node.Currently the node are communication with each other
however the disk space is not being shared in the cluster
We would like to know how to used one disk space... (1 Reply)
Discussion started by: airquality
1 Replies
7. Red Hat
hello i want to build my career as linux admin.I have completed my Engineering and had one month training on LINUX ADMIN course.I am doing well now in basics.Kindly provide suggetions or advice or books etc etc so that it will enhance my knowledge in linux Redhat. (1 Reply)
Discussion started by: dillipkmrpadhy
1 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)