Reactive Concurrent Data Structures and Algorithms for Synchronization
Doktorsavhandling, 2006
non-blocking
reactive
multi-word atomic primitives
online algorithms
shared memory
concurrent data structures
distributed data structures
randomization
online financial problems
synchronization
spin-locks
Författare
Phuong Ha
Chalmers, Data- och informationsteknik, Datavetenskap
Efficient Multi-Word Locking Using Randomization
Proceedings of the 24th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC '05),;(2005)p. 249 - 257
Paper i proceeding
Reactive multi-word synchronization for multiprocessors
Proceedings of the 12th IEEE/ACM International Conference on Parallel Architectures and Compilation Techniques (PACT'03),;(2003)p. 184-193
Paper i proceeding
Reactive Spin-locks: A Self-tuning Approach
The 8th International Symposium on Parallel Architectures, Algorithms and Networks, IEEE press,;(2005)p. 33-38
Paper i proceeding
Self-tuning Reactive Distributed Trees for Counting and Balancing
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),;Vol. 3544(2004)p. 140-157
Artikel i vetenskaplig tidskrift
Reactive multi-word synchronization for multiprocessors
The Journal of Instruction-Level Parallelism,;Vol. 6(2004)
Artikel i vetenskaplig tidskrift
Ämneskategorier (SSIF 2011)
Datavetenskap (datalogi)
ISBN
91-7291-780-6
Technical report D - Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University: 17D
Doktorsavhandlingar vid Chalmers tekniska högskola. Ny serie: 2462
10.00 Hall EA, Rännvägen 6B, Chalmers
Opponent: Prof. Michael L. Scott, University of Rochester, USA.