hello everyone. im sure someone has run into the problem of timestamping files and end up haveing 2 files with the same name thus over writeing one of them.
In my application i am trying to get a timestamp w/ milliseconds but i am haveing no luck and finding an answer in the man pages.
I know... (3 Replies)
I use something like this in perl to get the date and time:
use Time::localtime;
use Time::gmtime;
$tm = gmtime;
$time_str = sprintf "%04d-%02d-%02d %02d:%02d:%02d",
$tm->year + 1900, $tm->mon + 1, $tm->mday,
$tm->hour, $tm->min, $tm->sec;
It gives me something like this:
2010-08-26... (1 Reply)
Hey everyone,
I'm coming from Linux where the top command gave me lots of process
info (particularly CPU time in milliseconds) and I'm trying to find
similar info in Solaris.
So far I've looked at prstat and ps but neither give cpu time in
milliseconds, both seem to have 1 second... (2 Replies)
I need to put a small delay into a shell script. I'm looking for something smaller than "sleep" - a second is way too long. I want to sleep something like 10 milliseconds. I've tried "usleep" and "nanosleep", but the script doesn't recognize them.
I'm using the bash shell but I'm willing to... (9 Replies)
Hi All,
I have one file which contains time for request and response.
I want to calculate time difference in milliseconds for each line.
This file can contain 10K lines.
Sample file with 4 lines.
for first line.
Request Time: 15:23:45,255
Response Time: 15:23:45,258
Time diff... (6 Replies)
I am using Sun OS 5.10
I am Using nawk to extract specific column from csv file.
The third column of csv is the time in Milliseconds and I need to convert it to Date then save it in another csv file.
I am use this command to extract the columns I need and save it in tttn.csv
nawk 'BEGIN... (6 Replies)
Discussion started by: Hozaifa
6 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)
10-27-2017
