My Account Log in

2 options

Strong Memory Consistency for Parallel Programming / Christian DeLozier.

Online

Available online

View online

Dissertations & Theses @ University of Pennsylvania Available online

View online
Format:
Book
Thesis/Dissertation
Author/Creator:
DeLozier, Christian, author.
Contributor:
Devietti, Joseph, degree supervisor.
Zdancewic, Steve, degree supervisor.
University of Pennsylvania. Computer and Information Science, degree granting institution.
Language:
English
Subjects (All):
Computer engineering.
Computer science.
Computer and Information Science--Penn dissertations.
Penn dissertations--Computer and Information Science.
Local Subjects:
Computer engineering.
Computer science.
Computer and Information Science--Penn dissertations.
Penn dissertations--Computer and Information Science.
Genre:
Academic theses.
Physical Description:
1 online resource (127 pages)
Contained In:
Dissertation Abstracts International 80-02B(E).
Place of Publication:
[Philadelphia, Pennsylvania] : University of Pennsylvania ; Ann Arbor : ProQuest Dissertations & Theses, 2018.
Language Note:
English
System Details:
Mode of access: World Wide Web.
text file
Summary:
Correctly synchronizing multithreaded programs is challenging, and errors can lead to program failures (e.g., atomicity violations). Existing memory consistency models rule out some possible failures, but are limited by depending on subtle programmer-defined locking code and by providing unintuitive semantics for incorrectly synchronized code. Stronger memory consistency models assist programmers by providing them with easier-to-understand semantics with regard to memory access interleavings in parallel code. This dissertation proposes a new strong memory consistency model based on ordering-free regions (OFRs), which are spans of dynamic instructions between consecutive ordering constructs (e.g. barriers). Atomicity over ordering-free regions provides stronger atomicity than existing strong memory consistency models with competitive performance. Ordering-free regions also simplify programmer reasoning by limiting the potential for atomicity violations to fewer points in the program's execution. This dissertation explores both software-only and hardware-supported systems that provide OFR serializability.
Notes:
Source: Dissertation Abstracts International, Volume: 80-02(E), Section: B.
Advisors: Joseph Devietti; Steve Zdancewic; Committee members: Boon Thau Loo; Brandon Lucia; Jonathan M. Smith.
Department: Computer and Information Science.
Ph.D. University of Pennsylvania 2018.
Local Notes:
School code: 0175
ISBN:
9780438421844
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account