My Account Log in

1 option

Strong memory consistency for parallel programming / Christian DeLozier.

LIBRA QA003 2018 .D362
Loading location information...

Available from offsite location This item is stored in our repository but can be checked out.

Log in to request item
Format:
Book
Manuscript
Thesis/Dissertation
Author/Creator:
DeLozier, Christian, author.
Contributor:
Devietti, Joseph, degree supervisor.
Zdancewic, Steve, degree supervisor.
Loo, Boon Thau, degree committee member.
Lucia, Brandon, degree committee member.
Smith, Jonathan M., degree committee member.
University of Pennsylvania. Department of Computer and Information Science, degree granting institution.
Language:
English
Subjects (All):
Penn dissertations--Computer and information science.
Computer and information science--Penn dissertations.
Local Subjects:
Penn dissertations--Computer and information science.
Computer and information science--Penn dissertations.
Physical Description:
xiii, 113 leaves : illustrations ; 29 cm
Production:
[Philadelphia, Pennsylvania] : University of Pennsylvania, 2018.
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:
Ph. D. University of Pennsylvania 2018.
Department: Computer and Information Science.
Supervisors: Joseph Devietti; Steve Zdancewic.
Includes bibliographical references.
OCLC:
1334673484

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.

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Library Catalog Using Articles+ Library Account