Space and time-efficient hashing of garbage-collected objects
β Scribed by Agesen, Ole
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 80 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1074-3227
No coin nor oath required. For personal study only.
β¦ Synopsis
The hashCode() method found in the Java TM programming language, and similar methods in other languages, map an arbitrary object to an integer value that is constant for the lifetime of the object. We review existing implementations of the hash operation, specifying the kinds of memory systems for which they work. Then we propose a new implementation of hashing for the hardest case: memory systems with compaction and direct pointers. Our proposal uses just two bits of space per object for the (majority of) objects that are never hashed.
π SIMILAR VOLUMES
## Abstract A new strategy to yield information from the maximum number of voxels, each at the optimum signalβtoβnoise ratio (SNR) per unit time, in MR spectroscopic imaging (MRSI) is introduced. In the past, maximum acquisition dutyβcycle was obtained by multiplexing in time several single slices