- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- Data Structures of the Future: Concurrent, Optimistic,...
Open Collections
BIRS Workshop Lecture Videos
BIRS Workshop Lecture Videos
Data Structures of the Future: Concurrent, Optimistic, and Relaxed Alistarh, Dan
Description
A central computing trend over the last decade has been the need to process increasingly larger amounts of data as efficiently as possible. This development is challenging both software and hardware design, and is altering the way data structures and algorithms are constructed, implemented, and deployed. In this talk, I will present some examples of such new data structure design ideas and implementations. In particular, I will discuss some inherent limitations of parallelizing classic data structures, and then focus on approaches to circumvent these limitations. The first approach is to relax the software semantics, to allow for approximation, randomization, or both. The second is to modify the underlying hardware architecture to unlock more parallelism. Time permitting, I will also cover results showing that both approaches can improve real-world performance, and touch upon some of the major open questions in the area.
Item Metadata
Title |
Data Structures of the Future: Concurrent, Optimistic, and Relaxed
|
Creator | |
Publisher |
Banff International Research Station for Mathematical Innovation and Discovery
|
Date Issued |
2016-11-28T09:00
|
Description |
A central computing trend over the last decade has been the need to
process increasingly larger amounts of data as efficiently as possible.
This development is challenging both software and hardware design, and
is altering the way data structures and algorithms are constructed,
implemented, and deployed.
In this talk, I will present some examples of such new data structure
design ideas and implementations. In particular, I will discuss some
inherent limitations of parallelizing classic data structures, and then
focus on approaches to circumvent these limitations. The first approach
is to relax the software semantics, to allow for approximation,
randomization, or both. The second is to modify the underlying hardware
architecture to unlock more parallelism. Time permitting, I will also
cover results showing that both approaches can improve real-world
performance, and touch upon some of the major open questions in the
area.
|
Extent |
69 minutes
|
Subject | |
Type | |
File Format |
video/mp4
|
Language |
eng
|
Notes |
Author affiliation: Microsoft Research
|
Series | |
Date Available |
2017-06-21
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0348370
|
URI | |
Affiliation | |
Peer Review Status |
Unreviewed
|
Scholarly Level |
Other
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International