veyepar: High-Performance and Scalable Updates: The Issaquah Challenge

Hi user

Admin Login:

Name: High-Performance and Scalable Updates: The Issaquah Challenge
--client lca --show lca_2015 --room Case_Room_3 9473 --force
Prev: 12 How to get one of those Open Source jobs
Next: 12 Surrounded by Graphs - a short introduction to Graph Databases and Neo4j

show more...

Author(s):	Paul McKenney
Location	Case Room 3
Date	jan Fri 16	Days Raw Files
Start	11:35	First Raw Start	11:27
Duration	0:45:00	Offset	0:07:18
End	12:20	Last Raw End	12:26
Chapters	00:00
Total cuts_time	48 min.

http://lca2015.linux.org.au/schedule/30142/view_talk
raw-playlist raw-mp4-playlist encoded-files-playlist host public tweet mp4 svg png

final audio

assets release.pdf HighPerformance_and_Scalable_Updates_The_Issaquah_Challenge.json
logs
Admin: episode episode list cut list raw files day marks day marks day image_files

State:
Locked:	clear this to unlock
Locked by:	user/process that locked.
Start:	initially scheduled time from master, adjusted to match reality
Duration:	length in hh:mm:ss
Name:	Video Title (shows in video search results)
Emails:	email(s) of the presenter(s)
Released:	has someone authorised pubication
Normalise:
Channelcopy:	m=mono, 01=copy left to right, 10=right to left, 00=ignore.
Thumbnail:	filename.png
Description:	Highly performant and scalable techniques such as RCU have been quite successful in read-mostly situations. However, there do come times when updates are necessary. It would be convenient if there was some general update-side counterpart to RCU, but sadly there is not yet any such thing. Nevertheless, there are a number of specialized update-side techniques whose performance and scalability rival that of RCU. This talk will discuss several of them and provide an outlook into the future of low-overhead scalable updates. One technique is the solution to the Issaquah Challenge, which was put forward at the C++ standards committee meeting in early 2014 at Issaquah, WA, USA. This challenge requires a performant and scalable technique to atomically move elements back and forth between a pair of search trees, but without using transactional memory. This talk will give an overview of a solution to a more general problem, that of atomically moving groups of elements among a group of several different types of linked data structures, while still permitting lockless searches before, during, and after this atomic move. markdown
Comment:	production notes

recording sheet

recording sheet

2015-01-16/11_27_42.dv Apply: 11:27:42 - 11:37:51 ( 00:10:09 ) S: 11:27:42 - E: 11:37:51 D: 00:10:09 show more...

vlc ~/Videos/veyepar/lca/lca_2015/dv/Case_Room_3/2015-01-16/11_27_42.dv :start-time=00.0 --audio-desync=0

	Raw File	Cut List
	11:27:42		seconds: 0.0 Wall: 11:27:42
Duration	00:10:09
	11:37:51		seconds: 0.0 Wall: 11:27:42
Comments:
mp4 mp4.m3u	dv.m3u	Split: Sequence:: delete

audio viz

2015-01-16/11_37_52.dv Apply: 11:37:52 - 12:26:13 ( 00:48:21 ) S: 11:37:52 - E: 12:26:13 D: 00:48:21 show more...

vlc ~/Videos/veyepar/lca/lca_2015/dv/Case_Room_3/2015-01-16/11_37_52.dv :start-time=00.0 --audio-desync=0

	Raw File	Cut List
	11:37:52		seconds: 0.0 Wall: 11:37:52
Duration	00:48:21
	12:26:13		seconds: 0.0 Wall: 11:37:52
Comments:
mp4 mp4.m3u	dv.m3u	Split: Sequence:: delete

audio viz

Rf filename:	root is .../show/dv/location/, example: 2013-03-13/13:13:30.dv
Sequence:
get this:	check and save to add this

2015-01-16/11_27_42.dv
audio viz

audio viz

2015-01-16/11_37_52.dv
audio viz

audio viz

Veyepar Video Eyeball Processor and Review