Extending Relativistic Programming to Multiple Writers
For software to take advantage of modern multicore processors, it must be safely concurrent and it must scale. Many techniques that allow safe concurrency do so at the expense of scalability. Coarse grain locking allows multiple threads to access common data safely, but not at the same time. Non-Blo...
Main Author: | Howard, Philip William |
---|---|
Format: | Others |
Published: |
PDXScholar
2012
|
Subjects: | |
Online Access: | https://pdxscholar.library.pdx.edu/open_access_etds/114 https://pdxscholar.library.pdx.edu/cgi/viewcontent.cgi?article=1113&context=open_access_etds |
Similar Items
-
Optimistic semantic synchronization
by: Sreeram, Jaswanth
Published: (2012) -
Parallelism in Node.js applications : Data flow analysis of concurrent scripts
by: Jansson, Linda
Published: (2017) -
Providing Support for the Movidius Myriad1 Platform in the SkePU Skeleton Programming Framework
by: Cuello, Rosandra
Published: (2014) -
Investigating tools and techniques for improving software performance on multiprocessor computer systems
by: Tristram, Waide Barrington
Published: (2012) -
Relativistic Causal Ordering A Memory Model for Scalable Concurrent Data Structures
by: Triplett, Josh
Published: (2012)