Sponsored Content
Operating Systems HP-UX HP-UX Trying to Understand Shared Memory Segments Post 302176177 by Perderabo on Monday 17th of March 2008 04:22:00 PM
Old 03-17-2008
Not necessarily a problem, but probably a problem. A shared memory segment will not go away until explicitly removed. Most likely the process died without cleaning up. This is often caused by newbie sysadmins who jump into "kill -9". "ipcs -mb" will tell you how much memory is being consumed. "ipcrm" can get rid of it.
 

10 More Discussions You Might Find Interesting

1. 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... (1 Reply)
Discussion started by: cjcamaro
1 Replies

2. HP-UX

Shared Memory segments

Hello.... AIX has a limit of 11 shared memory segments per process, does any one know how many HP have?? If so how do I find that out?? Thanks in advance...... (2 Replies)
Discussion started by: catwomen
2 Replies

3. 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;... (6 Replies)
Discussion started by: ddx08
6 Replies

4. 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... (9 Replies)
Discussion started by: elzalem
9 Replies

5. 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... (12 Replies)
Discussion started by: DreamWarrior
12 Replies

6. 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. (0 Replies)
Discussion started by: otheus
0 Replies

7. Programming

Write into shared memory segments

I have created a shared memory segment (which size is 64 bytes) using shmget, shmat e.t.c and i want to divide it into 2 areas. One area for input data and one area for output? How can i do that? Furthermore, When i have to write my input data into the shared memory segment i want to write... (3 Replies)
Discussion started by: mae4
3 Replies

8. 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? (1 Reply)
Discussion started by: pchangba
1 Replies

9. Programming

C programming - Memory Segments

Can someone tell me how many bytes are allocated for C segments(text,data,heap,stack). (3 Replies)
Discussion started by: nandumishra
3 Replies

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... (5 Replies)
Discussion started by: iamjag
5 Replies
shmget(2)							System Calls Manual							 shmget(2)

NAME
shmget() - get shared memory segment SYNOPSIS
DESCRIPTION
returns the shared memory identifier associated with key. A shared memory identifier and associated data structure and shared memory segment of size size bytes (see glossary(9)) are created for key if one of the following is true: o key is equal to This call creates a new identifier, subject to available resources. The identifier will never be returned by another call to until it has been released by a call to The identifier should be used among the calling process and its descen- dents; however, it is not a requirement. The resource can be accessed by any process having the proper permissions. o key does not already have a shared memory identifier associated with it, and (shmflg & is "true". If is set in shmflg the shared memory segment created can only be shared by processes of the same executable type. That is, an application compiled as a 32-bit process will be able to share the same memory segment with other 32-bit processes, and an application compiled as a 64-bit process will be able to share the same memory segment with other 64-bit processes. If a 64-bit bit process want to create a shared memory segment which can also be shared with 32-bit processes, the 64-bit process must specify in addition to in shmflg. The 32-bit process does not need to specify On Itanium(R)-based platforms, if the Adaptive Address Space feature is being used, then additional rules may apply. See the section below on Adaptive Address Space. Upon creation, the data structure associated with the new shared memory identifier is initialized as follows: o and are set equal to the effective user ID and effective group ID, respectively, of the calling process. o the low-order 9 bits of are set equal to the low-order 9 bits of shmflg. is set equal to the value of size. o and are set equal to 0. o is set equal to the current time. Specifying in a call to along with forces the shared memory segment to be allocated from the global quadrant and not from the local quad- rants. If this is not possible, will fail. Refer to setmemwindow(1M) for more information. Specifying in a call to along with can improve the performance of co-operating processes in cases where these processes are accessing a large number of shared memory segments. This flag is treated as a hint. The flags and involve the placement of physical memory. This is important only on Cache Coherent Non-Uniform Memory Architecture (ccNUMA) systems. They will have no effect otherwise. For more information regarding ccNUMA and locality domains, see mpctl(2). These flags are hints to the system. If memory of the desired type is not available, the next most suitable memory is returned instead. If is set in shmflg, physical memory will come from interleaved memory. Interleaved memory is a hardware construct which combines the mem- ory from several locality domains into one region of memory. This memory is striped together with a very fine granularity. Interleaved memory is a good place to put shared objects, the kernel, and objects that could be accessed from any part of the system. This is the default behavior for shared memory segments created with this call. If is set in shmflg, physical memory for this mapping will always be allocated from the locality domain where the call to was made. Note that this flag implicitly uses the current locality domain, so the caller should be aware of locality domain configurations and bindings. See mpctl(2). If is set in shmflg, physical memory will come from the locality domain of the first processor to read or write that memory. If the shared memory is paged out and then back in again, physical memory will come from the locality domain of the processor bringing in that memory. System V Shared Memory Under Adaptive Address Space Itanium-based platforms have the capability to create two types of processes: MGAS (Mostly Global Address Space), which is the default, and MPAS (Mostly Private Address Space). See ld(1) and chatr(1). If 64-bit MPAS and 64-bit MGAS processes want to share a mapping among themselves without incurring the cost of aliasing, then (shmflg & should be "true", but (shmflg & should be "false". 64-bit MPAS processes should also specify the flag to the shmat(2) call. Such a map- ping cannot be shared with 32-bit MGAS processes. See the for details. EXAMPLES
The following call to returns a unique shmid for the newly created shared memory segment of 4096 bytes: RETURN VALUE
Upon successful completion, a non-negative integer, namely a shared memory identifier, is returned. Otherwise, a value of -1 is returned and is set to indicate the error. ERRORS
fails if any of the following conditions are encountered: size is less than the system-imposed minimum or greater than the system-imposed maximum. A shared memory identifier exists for key but is in 64-bit address space and the process performing the request has been compiled as a 32-bit executable. In order to avoid receiving this error, both and must be set in shmflg by the 64-bit processes upon segment creation. A shared memory identifier exists for key but operation permission (see glossary(9)) as specified by the low-order 9 bits of shmflg would not be granted. A shared memory identifier exists for key but the size of the segment associated with it is less than size and size is not equal to zero. A shared memory identifier does not exist for key and (shmflg & is "false". A shared memory identifier is to be created but the system-imposed limit on the maximum number of allowed shared memory identifiers system wide would be exceeded. A shared memory identifier and associated shared memory segment are to be created, but the amount of available physical memory is not sufficient to fill the request. A shared memory segment with or specified was to be created; however, there is not enough space in the global quadrant. A shared memory identifier exists for key but ((shmflg & && (shmflg & is "true". SEE ALSO
chatr(1), ld(1), ipcrm(1), ipcs(1), mpctl(2), shmctl(2), shmop(2), ftok(3C), privileges(5). in STANDARDS CONFORMANCE
shmget(2)
All times are GMT -4. The time now is 05:33 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy