Hey All,
I am seeking for the script which will do as follows,
1) Login on one Unix server "Server1"
2) Want to access other Unix server "Server2", and want to get the information as, on one go.
3) Re-direct the output to "space.txt" on "Server1"
Appologies for such query, I dont know would it work or not as I am new in Unix scripting.
Appreciate the soonest support.
Regards,
R.Kodan
Last edited by Scrutinizer; 02-17-2013 at 06:40 AM..
Reason: code tags
Hi there,
i am trying to create a script that checks for the existence of users on the system, if they exist then their details should print on the screen with a message that the id is in use. I am having a bit of trouble with it.
Any ideas?
Cheers
Kev! (8 Replies)
The line is like this
+abc+def+mgh+ddsdsd+sa
i.e. words seperated by +. There is a plus in the beginning.
i want to conver this line to
abc, def, mgh, ddsdsd, sa
please provide the logic in the form of a shell script
Thanks in advance (13 Replies)
Hi All,
I have file nodes.txt that contains node names one by one.
I'm running the following command.
/opt/OV/bin/ovet_topodump.ovpl -nodeif <nodename> -detail
Field <nodename> should take (replace) the node names from the nodes.txt one by one till last node.
Pls. give me script for... (1 Reply)
Hello guys,
Need a help.I have a flat file.
QWER 2:35 7044 00001 ROUT 1188 EA SS
ASD 2:36 7044 00010 ROUT
BSD 2:37 7044 00011 ROUT
END
QWER 3:35 7044 00011 ROUT 1088 EA SS
ASD 3:36 7044 00010 ROUT
BSD 3:37 7044 00011 ROUT
END
QWER 2:35 7044 00001 ROUT 1188 EA SS
ASD ... (1 Reply)
Hi Everyone,
Please find below the script, I needed to understand step by step:confused:. Please If someone can help me out i will be very greatful:D.
Please Guide me in a way which can help me out in figuring what this script doing on my server.
... (3 Replies)
My data is something like shown below.
date1 date2 aaa bbbb ccccc
date3 date4 dddd eeeeeee ffffffffff ggggg hh
I want the output like this
date1date2 aaa eeeeee
I serached in the forum but didn't find the exact matching solution. Please help. (7 Replies)
Hi Experts,
I am very beginner in Bash Shell Scripting. Can anyone please guide me to create a script which should show the most busy file systems in sort basis as there are a lot of file systems on the server.
I was told this task to be done by my IT lead and I must have to do this in... (3 Replies)
This is the input file contents
"data",9999,"data",999
"ddd"y"dat","dat","dart"
9999,999,999,"dat"
99,78,"duhu"yes"duhu"
I need the output file contents
"data",9999,"data",999
"dddydat","dat","dart"
9999,999,999,"dat"
99,78,"duhuyesduhu"
Please use code tags when posting data and... (5 Replies)
Hi Experts,
I have a script as below :
# cat a.sh
var=`mysql -usupport -p'testing' -e "select count(1) from db_test.sampletable;"`
echo $var
the output of this script is :
count(1) 145039
Now i want to remove header from my o/p and modify somewhat like
145039
I have... (9 Replies)
Discussion started by: mukulverma2408
9 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)