05-09-2002
For the AIX:
a- Edit the /etc/security/limits
Note: See the ulimit command.
For Sun (increase of FS):
If Solaris 8, for free learn about solstice disk-suite :
SUNWdsab Solstice DiskSuite 4.2.1 Collection
SUNWmdg Solstice DiskSuite Tool
SUNWmdnr Solstice DiskSuite Log Daemon Configuration Files
SUNWmdnu Solstice DiskSuite Log Daemon
SUNWmdr Solstice DiskSuite Drivers
SUNWmdu Solstice DiskSuite Commands
SUNWmdx Solstice DiskSuite Drivers(64-bit)
Else with wallet: Veritas Volume Manager and Veritas File System
Good luck, Hugo.
10 More Discussions You Might Find Interesting
1. Filesystems, Disks and Memory
I'm a new guy to this field and I'm learning a lot about UNIX! Can any explan to me what exactly does 'heap size' mean and how can i increase the size for AIX 4.3.3? (2 Replies)
Discussion started by: i2admin
2 Replies
2. UNIX for Advanced & Expert Users
I'm running websphere 4.5 on AIX 5 with java 1.3 and would like to find out the following: How much memory is allocated to each JVM, and how much of the allocated heap size is actually being used by a specific JVM? (0 Replies)
Discussion started by: rein
0 Replies
3. Shell Programming and Scripting
Hello,
has anyone written something that will monitor/gather weblogic heap info ? I need to gather size, high/low stats to a file that I can upload to a speadsheet
thanks for your help! (2 Replies)
Discussion started by: galenw
2 Replies
4. Programming
Hi,
I have a basic doubt here.
Consider the following code snippet:
main()
{
int *a;
.
.
}
Here the memory for a gets allocated in heap or stack. (5 Replies)
Discussion started by: naan
5 Replies
5. Shell Programming and Scripting
Hi Friends,
i need a unix command to check the heap space availability on unix system as I am getting following error:
Error occurred during initialization of VM
Could not reserve enough space for object heap
Error occurred during initialization of VM
Could not reserve enough space for... (2 Replies)
Discussion started by: Anji
2 Replies
6. HP-UX
The Resident size(as observed from top) of my process is increasing. But, the behaviour is very random. My process works on request reponse model. So when i put some request load on my process the memory starts increasing. For initial few hours (approx ~3 hrs) it increase at a rapid rate and after... (1 Reply)
Discussion started by: atgoel
1 Replies
7. HP-UX
Hi All,
We are facing issues on HPUX with the C heap region growing. We use a product for CRM by name ClarifyCRM and it uses a native layer for DB access. so there are best practices in place to actual control memory. recently we have seen issues that the C heap region is growing faster than... (0 Replies)
Discussion started by: ramchand75
0 Replies
8. UNIX for Dummies Questions & Answers
Hi
I have one Java application installed in my Solaris system. Is there a way to find out the heap memory allocated size/used size/free size for the particular Java process?
If anyone knows the command, please let me know. Even I appreciate if I have any scripts to find out the same.
... (0 Replies)
Discussion started by: nthiruvenkatam
0 Replies
9. Programming
I want to find the size of the total memory allocated on the heap for the following statement:
int* a = new int;How can I use the sizeof operator for this?
I used:
printf("\t===> %d\n",sizeof(*a));
Is this statement correct?
I have asked the question because when I checked the memory of... (13 Replies)
Discussion started by: rupeshkp728
13 Replies
10. Solaris
Hi,
I have solaris 10 (sparc) operating system machine on which I have installed supported weblogic 10.3. It was installed properly. As we know weblogic uses jvm to run and uses a part of jvm memory.
But I am facing one problem in which JVM is getting crashed again and again resulting my... (2 Replies)
Discussion started by: neeraj.tati
2 Replies
Heap(3pm) User Contributed Perl Documentation Heap(3pm)
NAME
Heap - Perl extensions for keeping data partially sorted
SYNOPSIS
use Heap;
my $heap = Heap->new;
my $elem;
use Heap::Elem::Num(NumElem);
foreach $i ( 1..100 ) {
$elem = NumElem( $i );
$heap->add( $elem );
}
while( defined( $elem = $heap->extract_top ) ) {
print "Smallest is ", $elem->val, "
";
}
DESCRIPTION
The Heap collection of modules provide routines that manage a heap of elements. A heap is a partially sorted structure that is always able
to easily extract the smallest of the elements in the structure (or the largest if a reversed compare routine is provided).
If the collection of elements is changing dynamically, the heap has less overhead than keeping the collection fully sorted.
The elements must be objects as described in "Heap::Elem" and all elements inserted into one heap must be mutually compatible - either the
same class exactly or else classes that differ only in ways unrelated to the Heap::Elem interface.
METHODS
$heap = HeapClass::new(); $heap2 = $heap1->new();
Returns a new heap object of the specified (sub-)class. This is often used as a subroutine instead of a method, of course.
$heap->DESTROY
Ensures that no internal circular data references remain. Some variants of Heap ignore this (they have no such references). Heap
users normally need not worry about it, DESTROY is automatically invoked when the heap reference goes out of scope.
$heap->add($elem)
Add an element to the heap.
$elem = $heap->top
Return the top element on the heap. It is not removed from the heap but will remain at the top. It will be the smallest element on
the heap (unless a reversed cmp function is being used, in which case it will be the largest). Returns undef if the heap is empty.
This method used to be called "minimum" instead of "top". The old name is still supported but is deprecated. (It was confusing to use
the method "minimum" to get the maximum value on the heap when a reversed cmp function was used for ordering elements.)
$elem = $heap->extract_top
Delete the top element from the heap and return it. Returns undef if the heap was empty.
This method used to be called "extract_minimum" instead of "extract_top". The old name is still supported but is deprecated. (It was
confusing to use the method "extract_minimum" to get the maximum value on the heap when a reversed cmp function was used for ordering
elements.)
$heap1->absorb($heap2)
Merge all of the elements from $heap2 into $heap1. This will leave $heap2 empty.
$heap1->decrease_key($elem)
The element will be moved closed to the top of the heap if it is now smaller than any higher parent elements. The user must have
changed the value of $elem before decrease_key is called. Only a decrease is permitted. (This is a decrease according to the cmp
function - if it is a reversed order comparison, then you are only permitted to increase the value of the element. To be pedantic, you
may only use decrease_key if $elem-cmp($elem_original) <= 0> if $elem_original were an elem with the value that $elem had before it was
decreased.)
$elem = $heap->delete($elem)
The element is removed from the heap (whether it is at the top or not).
AUTHOR
John Macdonald, john@perlwolf.com
COPYRIGHT
Copyright 1998-2007, O'Reilly & Associates.
This code is distributed under the same copyright terms as perl itself.
SEE ALSO
Heap::Elem(3), Heap::Binary(3), Heap::Binomial(3), Heap::Fibonacci(3).
perl v5.8.8 2007-10-23 Heap(3pm)