the hash approach of POSIX key

[Sebastian Huber]

On 05/21/2012 04:16 PM, Ashi wrote:
>
>
> 2012/5/21 Gedare Bloom <gedare at rtems.org <mailto:gedare at rtems.org>>
>
>     On Mon, May 21, 2012 at 9:30 AM, Ashi <ashi08104 at gmail.com
>     <mailto:ashi08104 at gmail.com>> wrote:
>      > Hi, all.
>      > I'm working on the POSIX key project(here is a introduction of it:[1]).
>      > Since using hash is a good candidate of the solution, I'm trying to do the
>     Hashing is a good candidate solution for what problem? It is not clear
>     to me what the hash solves, that is why to use a hash at all?
>
> Sorry for the obscure description. Here, we use hash table to dynamicly manage
> POSIX key, then the key can be added and deleted flexibly without losing the
> speed of key query, add, delete operation. While key and it's data field is
> fixed in current implementation, more description of the problem of current
> POSIX implementation is in [1]. This hash approach is an alternative to another
> approach(the rbtree approach), I have decide which is better.(Probably, both
> should be implemented).

Searching by hash tables gives good average case performance, but please 
remember that RTEMS is supposed to be a real-time operating system.  Thus we 
are more interested in the worst-case performance and deterministic behaviour.

-- 
Sebastian Huber, embedded brains GmbH

Address : Obere Lagerstr. 30, D-82178 Puchheim, Germany
Phone   : +49 89 18 90 80 79-6
Fax     : +49 89 18 90 80 79-9
E-Mail  : sebastian.huber at embedded-brains.de
PGP     : Public key available on request.

Diese Nachricht ist keine geschäftliche Mitteilung im Sinne des EHUG.