Title	Analysing the Average Time Complexity of Lock-Free Data Structures
Creator	Ruppert, Eric
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2016-12-01T16:30
Description	Lock-free implementations of shared data structures guarantee that some operation eventually completes. However, individual operations may not complete, as long as other operations continue to be completed. Thus, worst-case time complexity of individual operations may not be defined. Thus, an amortized analysis of the time complexity is more suitable. This talk will survey some results and techniques used to analyse the average time required to perform operations on lock-free implementations in shared-memory systems.
Extent	36 minutes
Subject	Mathematics; Computer science; Theoretical computer science
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: York University
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2017-06-23
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0348588
URI	http://hdl.handle.net/2429/62105
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