Sökning: "Linked-list"
Hittade 5 avhandlingar innehållade ordet Linked-list.
1. Lock-free Concurrent Search
Sammanfattning : The contemporary computers typically consist of multiple computing cores with high compute power. Such computers make excellent concurrent asynchronous shared memory system. LÄS MER
2. Efficient and Practical Non-Blocking Data Structures
Sammanfattning : This thesis deals with how to design and implement efficient, practical and reliable concurrent data structures. The design method using mutual exclusion incurs serious drawbacks, whereas the alternative non-blocking techniques avoid those problems and also admit improved parallelism. LÄS MER
3. Feature extraction based on a tensor image description
Sammanfattning : Feature extraction from a tensor based local image representation introduced by Knutsson in [37] is discussed. The tensor representation keeps statements of structure, certainty of statement and energy separate. LÄS MER
4. On Design and Applications of Practical Concurrent Data Structures
Sammanfattning : The proliferation of multicore processors is having an enormous impact on software design and development. In order to exploit parallelism available in multicores, there is a need to design and implement abstractions that programmers can use for general purpose applications development. LÄS MER
5. Efficient concurrent data structure access parallelism techniques for increasing scalability
Sammanfattning : Multi-core processors have revolutionised the way data structures are designed by bringing parallelism to mainstream computing. Key to exploiting hardware parallelism available in multi-core processors are concurrent data structures. LÄS MER