Relativistic Causal Ordering A Memory Model for Scalable Concurrent Data Structures

Relativistic Causal Ordering A Memory Model for Scalable Concurrent Data Structures

High-performance programs and systems require concurrency to take full advantage of available hardware. However, the available concurrent programming models force a difficult choice, between simple models such as mutual exclusion that produce little to no concurrency, or complex models such as Read-...

Full description

Bibliographic Details
Main Author: Triplett, Josh
Format: Others
Published: PDXScholar 2012
Subjects:
Concurrency
Read-copy update
Scalability
Data structures
Multicore
High performance computing
Parallel processing (Electronic computers)
Functional programming (Computer science)
Electronic data processing > Distributed processing
Online Access:https://pdxscholar.library.pdx.edu/open_access_etds/497
https://pdxscholar.library.pdx.edu/cgi/viewcontent.cgi?article=1496&context=open_access_etds

Internet

https://pdxscholar.library.pdx.edu/open_access_etds/497
https://pdxscholar.library.pdx.edu/cgi/viewcontent.cgi?article=1496&context=open_access_etds

Similar Items