09-19-2011
Thanks above!
I was running the commands on a virtual machine. It is supposed that the VM with CentOS5.6 running on a Linux machine. So with the output of "cat /etc/redhat-release", can I say the VM was set up with right CentOS?
10 More Discussions You Might Find Interesting
1. Tips and Tutorials
A common thing in shell scripting. I came across this script that will be useful for people learning to write script.
#!/usr/bin/ksh
#
# SCRIPT: 12_ways_to_parse.ksh.ksh
#
#
# REV: 1.2.A
#
# PURPOSE: This script shows the different ways of reading
# a file line by line. Again... (0 Replies)
Discussion started by: google
0 Replies
2. UNIX for Dummies Questions & Answers
How many ways are there to open a file in unix?
wha i know is mentioned below
suppose if xx is a filename, then
1) cat xx
2) more xx
3) view xx
4) less xx
I heard there are seven ways to open a file. If so, can anyone tell me all the ways to open a file and correct me the above... (3 Replies)
Discussion started by: venkatesht
3 Replies
3. UNIX for Dummies Questions & Answers
What are the ways to know about a command? (7 Replies)
Discussion started by: g.ashok
7 Replies
4. Programming
what are the precautions to be taken care for avoiding zombie process ? (8 Replies)
Discussion started by: Gopi Krishna P
8 Replies
5. Shell Programming and Scripting
Hi!
I really need your help!
I need to operate the columns separate by ',' of a file with this structure
a1,a2,a3
b1,b2,b3,b4,b5
c1,c2
d1,d2,d3
e1
....
and I want the result of this subtractions
a1-a1,a2-a1,a3-a1
b1-b1,b2-b1,b3-b1,b4-b1,b5-b1 (10 Replies)
Discussion started by: geparada88
10 Replies
6. UNIX for Dummies Questions & Answers
How does X windows system launch a program?
Does X give init a command (fork) or does x give BASH a command? Can/does X interact with init directly or does everything go through BASH? :wall:
Thanks in advance! (4 Replies)
Discussion started by: theKbStockpiler
4 Replies
7. Programming
Hello, I need some help to correct my algorithm steps to sum a number. I am confused... please input some steps
Example:
Let's say a number 5.
Now we can get a list of numbers: 1, 2, 3, 4 (less than 5 in sorted order).
so the sum could be: 1+4; 2+3 ( 1+1+1+1+1 or 1+2+2 is not a solution).
... (1 Reply)
Discussion started by: sureshcisco
1 Replies
8. Shell Programming and Scripting
Hi I am trying to make my scripts to run from any directory and after some research (googling) I find there are 2 ways to do this
1. export PATH=$PATH:directory
2. create a /bin directory in your home directory and put your scripts there.
Could someone tell me the relative merits of either... (1 Reply)
Discussion started by: piynik
1 Replies
9. Shell Programming and Scripting
How to copy a file from directroy/ prior version to the directory/ new version automatically. (4 Replies)
Discussion started by: roy1912
4 Replies
10. Shell Programming and Scripting
Okay so I'm 13 and my dad set me a challenge of writing a program that check to see if a box is online with input parameter when starting the program so i came back with this.The top commented out bit is what he showed me how to do after i show him my code.
#!/bin/sh
#in=${@}
#tst=`echo... (3 Replies)
Discussion started by: mattylad000
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)