dmesg giving errors

10 More Discussions You Might Find Interesting

1. Red Hat

Dmesg errors

Dear All , Very recently I find there are a lot of I/O errors in our Red HAt Linux Server. Pl find the below end_request: I/O error, dev sdcp, sector 0 sd 7:0:0:32784: SCSI error: return code = 0x00010000 end_request: I/O error, dev sdn, sector 0 sd 7:0:0:33289: SCSI error: return...

2. Shell Programming and Scripting

Solaris script using awk giving errors - please advise

I'm using solaris 10 Scenario as follows I have a logfile with 2 columns: column 1 = source directory + filename column 2 = destination directory + filename Using cron, my script polls for new files and adds them to the logfile ($ELOG) as described above. Using sed, the distination...

3. Red Hat

Linux system hangs giving ntp errors

Hi folks, I am facing issue of my system (host1) getting hanged after throwing following ntpd messages. I am not able to ssh to the server there after. only option is to restart the host: Dec 29 02:58:51 host1 ntpd: time reset -0.207907 s Dec 29 02:58:51 host1 ntpd: synchronisation lost Dec 29...

4. Linux

dmesg error

hi all, this is my permenent error.how to clear this error permenently... please help me out. here is my error output. please tell me clearly as i am very new to Linux(beginner) hda: packet command error: status=0x51 { DriveReady SeekComplete Error } hda: packet command error:...

5. HP-UX

dmesg error ??

Hi all, I have a very weard error message in my dmesg output, and I cannot find the solution in google. Does anyone know what it might be ? Equivalently mapped reserve pool exhausted; Overall application performance may be improved by increasing the "eqmemsize" tunable parameter (currently...

6. Programming

gcc Compiler Switches: giving Illogical Errors

Hi, Has anyone used gcc compiler and know alot about it? I am compiling a file with: gcc -o xyz xyz.c abc.o -lsocket -lnsl it compiles pretty fine. But whe I use switches gcc -o -Wall -pedantic -ansi xyz xyz.c abc.o -lsocket -lnsl it starts giving illogical, rather I should say stupid...

7. IP Networking

dmesg error

Oct 8 05:01:48 servername raid: Sense=7000060000000098000000003FD8000000000000000000000000000000000000000000000008380 00000000000000000000000FF0F053154303338343333353320202020202003010300000000000000000000000000000000000000000000000000000...

8. UNIX for Dummies Questions & Answers

dmesg error

hi, when i do a "dmesg" command, i saw many of this message appeared. Nov 12 07:00:20 catty graph_ftp: graph_ftp ftp faild it seems like it has some problems with my gftp application? pls tell me what's wrong and how to solve it. thanks alot.

9. UNIX for Dummies Questions & Answers

dmesg freebsd

hey,i use freeBSD 4.7stable, dmesg returns me a tons of info like: ax R *Handler Int 16 aio_max R *Handler Int 17 aio_prio_delta_max R *Handler Int 18 delaytimer_max R *Handler Int 19 mq_open_max R *Handler Int 20 pagesize R *Handler Int 21 rtsig_max R *Handler Int...

10. UNIX for Dummies Questions & Answers

sun dmesg says

Oct 22 13:40:07 snmpdx: community_check() : bad community from Oct 22 13:40:07 snmpdx: session_open() failed for a pdu received from any help? thanks

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)

BSD