Hashtable + shared memory Post: 302484147

10 More Discussions You Might Find Interesting

1. Programming

Shared memory

Dear Reader, Is is necessary to attach / dettach the shared memory segments for write operations , if more than one program is accessing same shared memory segments.. I have used semaphore mutex and still I'm getting segmentation fault when I write to the segment when other program is already...

2. UNIX for Advanced & Expert Users

Shared memory shortage but lots of unused memory

I am running HP-UX B.11.11. I'm increasing a parameter for a database engine so that it uses more memory to buffer the disk drive (to speed up performance). I have over 5GB of memory not being used. But when I try to start the DB with the increased buffer parameter I get told. "Not...

3. Linux

all about shared memory

Hi all :confused: , I am new to unix.I have been asked to implement shared memory in user's mode.What does this mean?What is the difference it makes in kernel mode and in users mode?What are the advantages of this impemenation(user's mode)? And also i would like to know why exactly shared...

4. Programming

help with shared memory

what i want to do is have an int that can been written into by 2 processes but my code doesn't seem to work. #include <sys/types.h> #include <sys/ipc.h> #include <sys/sem.h> #include <sys/shm.h> #include<stdio.h> #define KEY1 (1492) int main() { int shmid; volatile int * addr;...

5. Programming

memory sharing - not shared memory -

hi, this is the problem: i want to swap a linked list between 4 processes (unrelated), is there any way i can do that just by sending a pointer to a structure? //example typedef struct node { int x; char c; struct node *next; } node; or i should send the items ( x,c ) by...

6. Programming

Shared memory in shared library

I need to create a shared library to access an in memory DB. The DB is not huge, but big enough to make it cumbersome to carry around in every single process using the shared library. Luckily, it is pretty static information, so I don't need to worry much about synchronizing the data between...

7. Programming

Shared memory for shared library

I am writing a shared library in Linux (but compatible with other UNIXes) and I want to allow multiple instances to share a piece of memory -- 1 byte is enough. What's the "best" way to do this? I want to optimize for speed and portability. Obviously, I'll have to worry about mutual exclusion.

8. UNIX for Advanced & Expert Users

Shared Memory

Hi, Using ipcs we can see shared memory, etc.. details. How can I add/remove shared memory(command name)? Thanks, Naga:cool:

9. AIX

shared memory

1.How to know wich process is using the shared memory? 2.How to flush (release) the process from the shared memory?

10. Programming

Shared library with acces to shared memory.

Hello. I am new to this forum and I would like to ask for advice about low level POSIX programming. I have to implement a POSIX compliant C shared library. A file will have some variables and the shared library will have some functions which need those variables. There is one special...

LEARN ABOUT CENTOS

lh_stats

lh_stats(3)							      OpenSSL							       lh_stats(3)

NAME

       lh_stats, lh_node_stats, lh_node_usage_stats, lh_stats_bio, lh_node_stats_bio, lh_node_usage_stats_bio - LHASH statistics

SYNOPSIS

	#include <openssl/lhash.h>

	void lh_stats(LHASH *table, FILE *out);
	void lh_node_stats(LHASH *table, FILE *out);
	void lh_node_usage_stats(LHASH *table, FILE *out);

	void lh_stats_bio(LHASH *table, BIO *out);
	void lh_node_stats_bio(LHASH *table, BIO *out);
	void lh_node_usage_stats_bio(LHASH *table, BIO *out);

DESCRIPTION

       The LHASH structure records statistics about most aspects of accessing the hash table.  This is mostly a legacy of Eric Young writing this
       library for the reasons of implementing what looked like a nice algorithm rather than for a particular software product.

       lh_stats() prints out statistics on the size of the hash table, how many entries are in it, and the number and result of calls to the
       routines in this library.

       lh_node_stats() prints the number of entries for each 'bucket' in the hash table.

       lh_node_usage_stats() prints out a short summary of the state of the hash table.  It prints the 'load' and the 'actual load'.  The load is
       the average number of data items per 'bucket' in the hash table.  The 'actual load' is the average number of items per 'bucket', but only
       for buckets which contain entries.  So the 'actual load' is the average number of searches that will need to find an item in the hash
       table, while the 'load' is the average number that will be done to record a miss.

       lh_stats_bio(), lh_node_stats_bio() and lh_node_usage_stats_bio() are the same as the above, except that the output goes to a BIO.

RETURN VALUES

       These functions do not return values.

SEE ALSO

       bio(3), lhash(3)

HISTORY

       These functions are available in all versions of SSLeay and OpenSSL.

       This manpage is derived from the SSLeay documentation.

1.0.1e								    2013-02-11							       lh_stats(3)

10 More Discussions You Might Find Interesting

1. Programming

Shared memory

Discussion started by: joseph_shibu

2. UNIX for Advanced & Expert Users

Shared memory shortage but lots of unused memory

Discussion started by: cjcamaro

3. Linux

all about shared memory

Discussion started by: vijaya2006

4. Programming

help with shared memory

Discussion started by: ddx08