Adding a new OPAL hash table routine. Please read the algorithm description in opal/class/opal_hash_table.c for more precise details on the design and implementation. This algorithm was contributed by David Linden of H.P. in partnership with Mellanox Technologies. This contribution achieves two objectives:

1. It's actually hashing now, whereas the old OPAL hash table was not. Thus, it is a bug fix for and, as such, should be included in the 1.8 series.

2. It is dynamic and can grow and shrink the number of buckets in accordance with job size, whereas the old OPAL hash table had a fixed number of buckets which resulted in poor retrieval performance at large scale.

This scheme has been deployed in the field on very large H.P./Mellanox systems and has been demonstrated to significantly decrease job startup time (~ 20% improvement) when launching applications directly with srun in SLURM environments. However, neither SLURM nor direct launch are prerequisites to take advanatge of this change as any entity that utilizes OPAL hash table objects can benefit (at least partically) from this contribution.

On Nov. 3 2014 I amended this commit to include a missing prototype.

On Nov. 4 2014 I amended this commit in my local topic branch to include @rhc54 cleanup of the ompi debugger symbols in the OPAL hash table code.
Merge pull request #16 from jladd-mlnx/topic/new_opal_hash_table

Adding a new OPAL hash table routine. Please read the algorithm descript...