Open Advanced Search

Log in
Enterprise Plans
Free Trial

Log in
Free Trial
Enterprise Plans
Browse
Features
Pricing

DeepDyve

Advanced Search

show/hide query preview

With all of the words or DOIs:

DeepDyve's default query mode: search by keyword or DOI.

With the exact phrase:

Require these words, in this exact order. Do not surround your terms in double-quotes ("") in this field.

With at least one of the words:

Find any of these words, separated by spaces

Without the words:

Exclude each of these words, separated by spaces

With words in the article title:

Search for these terms only in the title of an article

Published between the years:

With the following authors:

Most effective as: LastName, First Name or Lastname, FN

With words in the journal name:

Search for articles published in journals where these words are in the journal name

Reset filters

Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

DeepDyve requires Javascript to function. Please enable Javascript on your browser to continue.

Shared-Memory Synchronization

Part of the Synthesis Lectures on Computer Architecture Book Series

DOI: 10.1007/978-3-031-01740-7

ISBN: 978-3-031-00612-8

Publisher: Springer International Publishing - Springer Journals

Jan 1, 2013

1 - 9 of 9 Chapters

Available

Introduction

Scott, Michael L.

Pages: 1 –8

[In computer science, as in real life, concurrency makes it much more difficult to reason about events. In a linear sequence, if E1 occurs before E2, which occurs before E3, and so on, we can reason about each event individually: Ei begins with the state of the world (or the program) after Ei−1,...
Available

Architectural Background

Scott, Michael L.

Pages: 9 –26

[The correctness and performance of synchronization algorithms depend crucially on architectural details of multicore and multiprocessor machines. This chapter provides an overview of these details. It can be skimmed by those already familiar with the subject, but should probably not be skipped...
Available

Essential Theory

Scott, Michael L.

Pages: 27 –48

[Concurrent algorithms and synchronization techniques have a long and very rich history of formalization—far too much to even survey adequately here. Arguably the most accessible resource for practitioners is the text of Herlihy and Shavit [2008]. Deeper, more mathematical coverage can be found...
Available

Practical Spin Locks

Scott, Michael L.

Pages: 49 –70

[The mutual exclusion problem was first identified in the early 1960s. Dijkstra attributes the first 2-thread solution to Theodorus Dekker [Dijkstra, 1968b]. Dijkstra himself published an n-thread solution in 1965 [CACM]. The problem has been intensely studied ever since. Taubenfeld [2008]...
Available

Busy-wait Synchronization with Conditions

Scott, Michael L.

Pages: 71 –85

[In Chapter 1 we suggested that almost all synchronization serves to achieve either atomicity or condition synchronization. Chapter 4 considered spin-based atomicity. The current chapter considers spin-based condition synchronization—flags and barriers in particular. In many cases, spins can be...
Available

Read-mostly Atomicity

Scott, Michael L.

Pages: 87 –101

[In Chapter 4 we considered the topic of busy-wait mutual exclusion, which achieves atomicity by allowing only one thread at a time to execute a critical section. While mutual exclusion is sufficient to ensure atomicity, it is by no means necessary. Any mechanism that satisfies the ordering...
Available

Synchronization and Scheduling

Scott, Michael L.

Pages: 103 –121

[So far in this lecture, we have emphasized busy-wait synchronization. In the current chapter we turn to mechanisms built on top of a scheduler, which multiplexes some collection of cores among a (typically larger) set of threads, switching among them from time to time and—in particular—when the...
Available

Nonblocking Algorithms

Scott, Michael L.

Pages: 123 –143

[When devising a concurrent data structure, we typically want to arrange for methods to be atomic—most often linearizable (Section 3.1.2). Most concurrent algorithms achieve atomicity by means of mutual exclusion, implemented using locks. Locks are blocking, however, in the formal sense of the...
Available

Transactional Memory

Scott, Michael L.

Pages: 145 –172

[Transactional memory (TM) is among the most active areas of recent synchronization research, with literally hundreds of papers published over the past ten years. The current chapter attempts to outline the shape of the TM design space, the current state of the art, and the major open questions....

results per page

Browse All eBooks

Features

Search and discover articles on DeepDyve, PubMed, and Google Scholar
Read the full-text of open access and premium content
Organize articles with folders and bookmarks
Collaborate on and share articles and folders

Info

Pricing
Enterprise Plans
Browse Journals & Topics
About DeepDyve

Help

Help
Publishers
Contact Us

Sign up for your 14-Day Free Trial Now!

Read and print from thousands of top scholarly journals.

System error. Please try again!

Continue with Facebook

By signing up, you agree to DeepDyve’s Terms of Service and Privacy Policy.

Already have an account? Log in

Save Article to Bookmarks

Bookmark this article. You can see your Bookmarks on your DeepDyve Library.

To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.

Subscribe to Journal Email Alerts

To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.

Follow a Journal

To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.

Our policy towards the use of cookies

All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.

cookie policy