SnapQueue: Lock-Free Queue with Constant Time Snapshots Aleksandar Prokopec École Polytechnique Fédérale de Lausanne, Switzerland Abstract

First Page		Document Content
Date: 2016-08-13 13:11:44 Abstract data types Computing Data structures Software engineering Computer science Queue Double-ended queue Amortized analysis Persistent data structure Rope Conc-Tree list		SnapQueue: Lock-Free Queue with Constant Time Snapshots Aleksandar Prokopec École Polytechnique Fédérale de Lausanne, Switzerland Abstract Add to Reading List Source URL: axel22.github.io Download Document from Source Website File Size: 319,14 KB Share Document on Facebook

	Understanding the heap by breaking it A case study of the heap as a persistent data structure through nontraditional exploitation techniques Abstract: Traditional exploitation techniques of overwriting heap metadata has DocID: 1tkGE - View Document
	The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology Jean-Daniel Boissonnat & Tamal Dey & Cl´ement Maria JGA 2013 DocID: 1sG7U - View Document
	SnapQueue: Lock-Free Queue with Constant Time Snapshots Aleksandar Prokopec École Polytechnique Fédérale de Lausanne, Switzerland Abstract DocID: 1qv6G - View Document
	THE OBSERVABLE STRUCTURE OF PERSISTENCE MODULES ´ ERIC ´ FRED CHAZAL, WILLIAM CRAWLEY-BOEVEY, AND VIN DE SILVA Abstract. In persistent topology, q-tame modules appear as a natural and large class DocID: 1qubA - View Document
	Alexander Kiel University Leipzig HAL8 PaperD AT O M I C - A F U N C T I O N A L D ATA B A S E DocID: 1pqGe - View Document