- Representation of numeric data
- Range, precision, and rounding errors
- Arrays
- Representation of character data
- Strings and string processing
- Runtime storage management
- Pointers and references
- Linked structures
- Implementation strategies for stacks, queues, and hash tables
- Implementation strategies for graphs and trees
- Strategies for choosing the right data structure
Parallel implementation of Multi-List data structure (spillner)
Material Type: | Coding example, Article / White paper |
|
Technical Format: | text file, zip archive, PDF document | |
Location: | Go to materials | |
Date Added: | 12/22/2010 | |
Date Modified: | 12/22/2010 | |
Author: | Brent Spillner, USA | |
| Description: The included code and white paper provides details for the implementation of a thread-safe data structure that creates and manages multiple ordered lists as a single data structure. Lists within the structure are indexed starting at 0 and proceed up to one less than the number of lists created. A set of API functions to interact with the multi-list structure are defined as outlined in the data structure description. A problem to “rank” instances of integers within a multi-list structure is used to test the data structure implementation. Parallelism is implemented using Pthreads. DISCLAIMER: This code is provided by the author as a submitted contest entry, and is intended for educational use only. The code is not guaranteed to solve all instances of the input data sets and may require modifications to work in your own specific environment. | ||
Recommended Audience: | Advanced programmers, Graduate students, Undergraduate students | |
Language: | English | |
Keywords: | Multilist, data structure, thread safe, parallel algorithm, Threading Challenge Contest, Pthreads | |
Parallel implementation of Multi-List data structure (Vyukov)
Material Type: | Coding example, Article / White paper |
|
Technical Format: | text file, Word document, zip archive | |
Location: | Go to materials | |
Date Added: | 12/22/2010 | |
Date Modified: | 12/22/2010 | |
Author: | Dmitry Vyukov, Moscow, Russia | |
| Description: The included code and white paper provides details for the implementation of a thread-safe data structure that creates and manages multiple ordered lists as a single data structure. Lists within the structure are indexed starting at 0 and proceed up to one less than the number of lists created. A set of API functions to interact with the multi-list structure are defined as outlined in the data structure description. A problem to “rank” instances of integers within a multi-list structure is used to test the data structure implementation. Parallelism is implemented with Pthreads. DISCLAIMER: This code is provided by the author as a submitted contest entry, and is intended for educational use only. The code is not guaranteed to solve all instances of the input data sets and may require modifications to work in your own specific environment. | ||
Recommended Audience: | Advanced programmers, Graduate students, Undergraduate students | |
Language: | English | |
Keywords: | Multilist, data structure, thread safe, parallel algorithm, Threading Challenge Contest, Pthreads | |
Parallel implementation of Multi-List data structure (akki)
Material Type: | Coding example, Article / White paper |
|
Technical Format: | text file, zip archive, PDF document | |
Location: | Go to materials | |
Date Added: | 12/22/2010 | |
Date Modified: | 12/22/2010 | |
Author: | Akshay Singh, Pune, India | |
| Description: The included code and white paper provides details for the implementation of a thread-safe data structure that creates and manages multiple ordered lists as a single data structure. Lists within the structure are indexed starting at 0 and proceed up to one less than the number of lists created. A set of API functions to interact with the multi-list structure are defined as outlined in the data structure description. A problem to “rank” instances of integers within a multi-list structure is used to test the data structure implementation. The parallel solution has been implemented using akkithreads – a C++ wrapper over the Pthreads library with additional features such as JobQueues (Static / Dynamic) and a ThreadPool implementation. DISCLAIMER: This code is provided by the author as a submitted contest entry, and is intended for educational use only. The code is not guaranteed to solve all instances of the input data sets and may require modifications to work in your own specific environment.
| ||
Recommended Audience: | Advanced programmers, Graduate students, Undergraduate students | |
Language: | English | |
Keywords: | Multilist, data structure, parallel algorithm, Threading Challenge Contest, Pthreads, thread safe | |
Parallel solution to Skip List data structure and QuARI game Problem (mdma)
Material Type: | Coding example, Article / White paper |
|
Technical Format: | text file, .odt, zip archive | |
Location: | Go to materials | |
Date Added: | 12/21/2010 | |
Date Modified: | 12/21/2010 | |
Author: | Matthew Mcgowan, Gvarv, Norway | |
| Description: The included code and white paper provides a parallel implementation of a thread-safe Skip List data structure and an application for a two-player strategy board game, called QuARI. The skip list is used to build an endgame database for given starting positions of QuARI. The operations required for the skip list structure and the rules of the game are described in the included problem description text files. Parallelism is achieved using Java and Java Threads. DISCLAIMER: This code is provided by the author as a submitted contest entry, and is intended for educational use only. The code is not guaranteed to solve all instances of the input data sets and may require modifications to work in your own specific environment. | ||
Recommended Audience: | Advanced programmers, Graduate students, Undergraduate students | |
Language: | English | |
Keywords: | Skip list, list, search, data structure, game, strategy, board game, database, parallel algorithm, thread safe, Threading Challenge Contest, java, java threads | |
Parallel solution to Skip List data structure and QuARI game Problem (Vyukov)
Material Type: | Coding example, Article / White paper |
|
Technical Format: | text file, zip archive, Word document | |
Location: | Go to materials | |
Date Added: | 12/21/2010 | |
Date Modified: | 12/21/2010 | |
Author: | Dmitry Vyukov, Moscow, Russia | |
| Description: The included code and white paper provides a parallel implementation of a thread-safe Skip List data structure and an application for a two-player strategy board game, called QuARI. The skip list is used to build an endgame database for given starting positions of QuARI. The operations required for the skip list structure and the rules of the game are described in the included problem description text files. A lock-free implementation of the skip list structure is described and implemented. DISCLAIMER: This code is provided by the author as a submitted contest entry, and is intended for educational use only. The code is not guaranteed to solve all instances of the input data sets and may require modifications to work in your own specific environment. | ||
Recommended Audience: | Advanced programmers, Graduate students, Undergraduate students | |
Language: | English | |
Keywords: | Skip list, list, search, data structure, game, strategy, board game, database, parallel algorithm, thread safe, Threading Challenge Contest | |