#! /bin/bash
df_threshold=90;
while read x
do
x=${x%\%}
echo $x | egrep -q "^[0-9]*$"
[ $? -ne 0 ] && continue
if [ $(echo "$x > $df_threshold"|bc) -eq 1 ] ; then
echo "$x is more than $df_threshold "
fi
done < df_fnl.txt
This User Gave Thanks to balajesuri For This Post:
Guys,
I've a problem in the "sed" command used in my shellscripts
This is the problamatic line in my shell script:
sed -e 's/${line1}/${line1_m}/g' prod_hier_1234.txt > test.txt
It doesn't do the job of replacing the string stored in variable 'line1' to 'line1_m'.
However If I replace the... (10 Replies)
Hi all,
I am looking for api to get me system monitoring statictics every 5 minutes.
I am looking at the following statistics:
1. System CPU Usage
2. Process CPU Usage
3. Process Memory Usage
4. I/O Usage for a certain disk.
5. Process I/O bytes/sec utilization.
I have seen very... (2 Replies)
I wanna put a LDAP search command into a script and there I have the following problem.
I have these variables in a bash script
com="ldapsearch -LLL -x -W"
node=" -b 'o=me,ou=addressbook,dc=subdomain,dc=dyndns,dc=org'"
uri=" -H ldaps://subdomain.dyndns.org"
user=" -D... (2 Replies)
Hi Guru's,
I 'm trying to execute the below given script in Unix. I am having an issue with the script. The output of the script is given below:
#!/bin/bash
File_Home="/home/essftp/Risk"
cd /home/essftp/Risk
rm -f FileList
rm -f credit_risk*
file1=`ls -lt... (4 Replies)
hello,
i'm having some performance problem on one of my linux machines and i hope someone will be able to help me analyzing the problem.
machine info:
Linux fedora, cpu x 4 cores of 1.6Ghz, 8G memory, 8G swap.
i've enabled sar on my machine and created a graph using ksar utility for... (15 Replies)
Hi all,
Very new to shell scripting so appreciate some help!
There is a process count that I need to monitor, I have the AIX command that gives this value and I've cleaned it up with grep/awk so it only spits out the value I'm interested in:
echo "psc -i 10050 -s RELOAD_SERVICE" | tmadmin... (14 Replies)
#!/bin/sh
date=`date +%y%m%d -d"1 day ago"`
inbound_dir=/vis/logfiles/to_solmis
cp `grep -il ST~856~ $inbound_dir/*$date*` /vis/sumit/in_ASN/
echo 'SENDER,RECEIVER,DATE,TIME,ASNUMBER' > a.csv
for i in /vis/sumit/in_ASN/*
do
... (8 Replies)
Hi,
I have used expr command to increment the date.
for e.g.,
case 1 :
echo $(date -d $(echo `expr 20010101 + 1`))
it returns
Tue Jan 2 00:00:00 IST 2001
case 2:
echo $(date -d $(echo `expr 20010101 - 1`))
it returns
date: invalid date `20010100'
please suggest me, how to... (3 Replies)
Dear gurus of Linux / Unix.
I have a server, which I use to monitoring traffic, the problem that I find is when I run the following command:
probe:~ # sar -n DEV 1
I see that I one second appear info in some interface and in the other second no appear, I don't know what will be the... (0 Replies)
This morning we had an activity on our Nagios server, whereby we inserted new disks into the server, and rebooted the server.
The disk implementation failed, therefore we had to revoke the changes, and rebooted the server once again.
The server was up and running at 6:00 am this morning.... (2 Replies)
Discussion started by: anaigini45
2 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)