First Page | Document Content | |
---|---|---|
![]() Date: 2001-05-18 16:44:10Data management Spinlock Compare-and-swap Test-and-set Lock Mutual exclusion Linearizability Non-blocking algorithm Busy waiting Concurrency control Computing Concurrency | Source URL: ftp.cs.rochester.eduDownload Document from Source WebsiteFile Size: 198,10 KBShare Document on Facebook |
![]() | Administrivia Design of Parallel and High-Performance ComputingDocID: 1rqkH - View Document |
![]() | Administrivia Design of Parallel and High-Performance ComputingDocID: 1rnNM - View Document |
![]() | Aaron Turon Research Statement My research lies broadly in the areas of programming languages and verification, with the goal of building reliable software systems. I am drawn to software components that are usually chaDocID: 1rnbf - View Document |
![]() | Reagents: Expressing and Composing Fine-grained Concurrency Aaron Turon Northeastern UniversityDocID: 1rk2P - View Document |
![]() | Brief Announcement: Selfishness in Transactional Memory Raphael Eidenbenz Roger Wattenhofer Computer Engineering and Networks LabDocID: 1qKkF - View Document |