Title	Test and Set in Optimal Space
Creator	Higham, Lisa
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2016-12-01T11:00
Description	Several new and existing components and techniques are used to achieve two new results. - A obstruction-free implementation of test&set from O(log n) registers, thus establishing that the existing lower bound is asymptotically tight. - A randomized wait-free implementation of test and set from O(log n) registers and having O(log*n) solo step complexity under the oblivious adversary. I will describe these techniques, present details of 3 of them, and show how they are combined to provide these two algorithms.
Extent	48 minutes
Subject	Mathematics; Computer science; Theoretical computer science
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of Calgary
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2017-06-22
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0348416
URI	http://hdl.handle.net/2429/62096
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos