van der Vegt et al., 2011 - Google Patents
A parallel compact hash tablevan der Vegt et al., 2011
View PDF- Document ID
- 9902167389604479128
- Author
- van der Vegt S
- Laarman A
- Publication year
- Publication venue
- International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
External Links
Snippet
LNCS 7119 - A Parallel Compact Hash Table Page 1 A Parallel Compact Hash Table Steven
van der Vegt and Alfons Laarman Formal Methods and Tools, University of Twente, The
Netherlands s.vandervegt@student.utwente.nl, awlaarman@ewi.utwente.nl Abstract. We …
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
- G06F9/52—Programme synchronisation; Mutual exclusion, e.g. by means of semaphores; Contention for resources among tasks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/023—Free address space management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/30—Arrangements for executing machine-instructions, e.g. instruction decode
- G06F9/30003—Arrangements for executing specific machine instructions
- G06F9/3004—Arrangements for executing specific machine instructions to perform operations on memory
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/30—Arrangements for executing machine-instructions, e.g. instruction decode
- G06F9/38—Concurrent instruction execution, e.g. pipeline, look ahead
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/30—Arrangements for executing machine-instructions, e.g. instruction decode
- G06F9/30003—Arrangements for executing specific machine instructions
- G06F9/30076—Arrangements for executing specific machine instructions to perform miscellaneous control operations, e.g. NOP
- G06F9/30087—Synchronisation or serialisation instructions
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/36—Preventing errors by testing or debugging software
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformations of program code
- G06F8/41—Compilation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2201/00—Indexing scheme relating to error detection, to error correction, and to monitoring
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ashkiani et al. | A dynamic hash table for the GPU | |
| Van Dijk et al. | Sylvan: multi-core framework for decision diagrams | |
| Yang et al. | A wait-free queue as fast as fetch-and-add | |
| Howley et al. | A non-blocking internal binary search tree | |
| Maier et al. | Concurrent hash tables: Fast and general (?)! | |
| US9563477B2 (en) | Performing concurrent rehashing of a hash table for multithreaded applications | |
| Ellen et al. | Non-blocking binary search trees | |
| Michael et al. | Idempotent work stealing | |
| Laarman et al. | Boosting multi-core reachability performance with shared hash tables | |
| LaMarca | A performance evaluation of lock-free synchronization protocols | |
| van der Vegt et al. | A parallel compact hash table | |
| Fatourou et al. | An efficient wait-free resizable hash table | |
| Dechev et al. | Lc/dc: Lockless containers and data concurrency a novel nonblocking container library for multicore applications | |
| Yudha et al. | Scalable and fast lazy persistency on gpus | |
| Peng et al. | FA-Stack: A fast array-based stack with wait-free progress guarantee | |
| Barnat et al. | Fast, dynamically-sized concurrent hash table | |
| Goodman et al. | Hashing strategies for the Cray XMT | |
| Islam et al. | A performance study of optane persistent memory: from storage data structures' perspective | |
| Lu et al. | Scaling dynamic hash tables on real persistent memory | |
| Chen et al. | Lock-free high-performance hashing for persistent memory via PM-aware holistic optimization | |
| Lamar et al. | Lock-free transactional vector | |
| Gidenstam et al. | NBmalloc: Allocating memory in a lock-free manner | |
| Singh et al. | Efficient hardware primitives for immediate memory reclamation in optimistic data structures | |
| Kahan et al. | " MAMA!" a memory allocator for multithreaded architectures | |
| Jamil et al. | Towards scalable manycore-aware persistent B+-trees for efficient indexing in cloud environments |