상세정보
Export to Refworks부가기능
Prove Once, Run Efficiently Anywhere: Tools for Lock-free Concurrent Algorithms
상세 프로파일
| 자료유형 | 학위논문 |
|---|---|
| 서명/저자사항 | Prove Once, Run Efficiently Anywhere: Tools for Lock-free Concurrent Algorithms. |
| 개인저자 | Bender, John Matthew. |
| 단체저자명 | University of California, Los Angeles. Computer Science 0201. |
| 발행사항 | [S.l.]: University of California, Los Angeles., 2019. |
| 발행사항 | Ann Arbor: ProQuest Dissertations & Theses, 2019. |
| 형태사항 | 160 p. |
| 기본자료 저록 | Dissertations Abstracts International 81-04B. Dissertation Abstract International |
| ISBN | 9781088324912 |
| 학위논문주기 | Thesis (Ph.D.)--University of California, Los Angeles, 2019. |
| 일반주기 |
Source: Dissertations Abstracts International, Volume: 81-04, Section: B.
Advisor: Palsberg, Jens. |
| 이용제한사항 | This item must not be sold to any third party vendors. |
| 요약 | The multi-core revolution has pushed programmers and algorithm designers to build algorithms that leverage concurrency. This notoriously difficult task is futher complicated by the existence of weak architecture and language memory models. The presence of many such memory models has traditionally forced correctness proofs for lock-free concurrent algorithms to be performed on a per-model basis, resulting in a significant duplication of effort. We demonstrate that the correctness of lock-free concurrent algorithms can be proved once for implementations that can be compiled to run correctly and efficiently on all mainstream memory models. |
| 일반주제명 | Computer science. |
| 언어 | 영어 |
| 바로가기 | 
: 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
