9 More Discussions You Might Find Interesting
1. Red Hat
Hi
Please I dont have a lot of redhat skills, but I need some help on creating a file system.
I need to rescan for this new LUN, so I try to check existing LUNs:
fdisk -l
Disk /dev/sda: 299.4 GB, 299439751168 bytes
255 heads, 63 sectors/track, 36404 cylinders
Units = cylinders of... (8 Replies)
Discussion started by: fretagi
8 Replies
2. Shell Programming and Scripting
Hello,
to simulate an environment with 48 disks using Solaris 10 x86,
i try toMake 48 disks (files) with MKFILE :
#for i in c{0,1,2,3,4,5}t{0,1,2,3,4,5,6,7}d0 >do > mkfile 100m $i >done
But i received like result :
#ls /test_zfs
c{0,1,2,3,4,5}t{0,1,2,3,4,5,6,7}d0
Any help... (2 Replies)
Discussion started by: herbich1985
2 Replies
3. UNIX for Advanced & Expert Users
In our company we work for our customer with a job# philosophy, managing all the informations about a job in a share with directories whose name is starting with job number. Under this entry point we have a standard structure of folders, comprising a "communications" folder.
When we send emails... (0 Replies)
Discussion started by: vroby67
0 Replies
4. UNIX for Advanced & Expert Users
Hi,
In order to have a sand box machine that I could use to test some system changes before going to production state, I'd like to duplicate a working system to a virtual one. Ideally, I'd like to manage to do it this way :
- Make a full system backup excluding the user file system (this... (7 Replies)
Discussion started by: pagaille
7 Replies
5. Fedora
Hi guys
I have a SSL server that is running Fedora 9. I wanted to create a directory but get:
mkdir: cannot create directory `test': Read-only file system
Any ideas? (4 Replies)
Discussion started by: wbdevilliers
4 Replies
6. Shell Programming and Scripting
Hello members,
I have some doubts on how to write a script that can reports success / failure of a batch job ?
1. Run a batch job:
2. Wait and search for a particular string in the Log file:
tail -f log01*.txt | egrep -v "^SUCCESSFUL"
echo "continue with the other tasks"
... (1 Reply)
Discussion started by: novice82
1 Replies
7. UNIX for Advanced & Expert Users
Hi All:
I am using an adaptor between a 1TB SATA hard drive and solaris 8 box with 68 pin scsi. I use the format utility to partition the HD which works fine but when I use newfs, I get some errors. I will place them below.
I have blocked and the error message is in red.
Anybody got any... (1 Reply)
Discussion started by: mndavies
1 Replies
8. AIX
hello
i'm running on P570 box aix 5.3 8 cpus 24G ram
there are 1850 users loged in to this box
the problem is that the two sysytem disks busy all the time
hdisk0 100% busy
hdisk1 100% busy
some one have an idea what writing to this disks?
thanks
ariec (9 Replies)
Discussion started by: ariec
9 Replies
9. UNIX for Dummies Questions & Answers
hi all
can anybdy plz tell me how to make a stealth port scan in unix c.
if i want to send *just* ack/fin etc how do i send?
using libnet or what?
thankx (7 Replies)
Discussion started by: ambar
7 Replies
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)