Sux data structures 0.3 (Default branch)


 
Thread Tools Search this Thread
Special Forums News, Links, Events and Announcements Software Releases - RSS News Sux data structures 0.3 (Default branch)
# 1  
Old 02-21-2008
Sux data structures 0.3 (Default branch)

Sux is a set of high-performance implementationsof basic and advanced succinct data structures inC++ and Java.Image

More...
Login or Register to Ask a Question

Previous Thread | Next Thread

3 More Discussions You Might Find Interesting

1. Programming

Signalsafe data structures

Hello, I have a signal handler which manipulates a data structure. The data structure's operations aren't atomic. So if two threads/processes are in a critical section at the same time the data structure will be broken. With threads you can avoid this stuff with semaphores etc. However,... (10 Replies)
Discussion started by: littlegnome
10 Replies

2. Shell Programming and Scripting

Perl Data Structures

Here is what i need to do. @data #has all column wise data so say info for col 1 location for all rows would be in this array $array = \@data But i need to create a file which should contain these information in a format for all columns even if i have got no values from some of the index... (0 Replies)
Discussion started by: dinjo_jo
0 Replies

3. Programming

shared memory - userdefined data structures

Hello, I wonder if I can write my userdefined data structures(ex: a list) to a shared memory segment? I know, the shm functions get (void*) parameter so I should be able to read and write a list into the shared memory. may someone inform and clarify me about that, please? (1 Reply)
Discussion started by: xyzt
1 Replies
Login or Register to Ask a Question
pfdat_hash_locks(5)						     OBSOLETE						       pfdat_hash_locks(5)

NAME
pfdat_hash_locks - OBSOLETE kernel tunable parameter DESCRIPTION
The tunable is obsolete and has been removed. HP-UX will automatically calculate the value based on the system configuration. Global kernel structures containing information on a running process or memory usage are frequently accessed or modified by several threads concurrently. To prevent race conditions, these structures are protected by spinlocks (kernel data used for synchronization) which allow only the spinlock "holder" to proceed, while all others attempting to access the structure must wait. Hashed spinlocks are used when each instance of such a data structure is to be protected, and there are several instances. Using a single spinlock for all instances would cause too much contention, but using one spinlock per structure wastes memory while the majority of the locks are unused at any given time. By allocating a pool of hashed locks, a hash function picks one lock per group of structures, reducing contention while conserving memory. The system-calculated value of sets the size of such a pool for the pfdat data structure spinlocks. WARNINGS
All HP-UX kernel tunable parameters are release specific. This parameter may be removed or have its meaning changed in future releases of HP-UX. Installation of optional kernel software, from HP or other vendors, may cause changes to tunable parameter values. After installation, some tunable parameters may no longer be at the default or recommended values. For information about the effects of installation on tun- able values, consult the documentation for the kernel software being installed. For information about optional kernel software that was factory installed on your system, see at AUTHOR
was developed by HP. Tunable Kernel Parameters pfdat_hash_locks(5)