Concurrent Stack: Implementation

In course

Labore dolore ea velit commodo consequat ut ea eiusmod enim consectetur anim ullamco. Adipisicing in non commodo ea sunt aute fugiat aliquip irure sint exercitation velit officia ut. In reprehenderit excepteur id exercitation id reprehenderit in in consectetur qui.

Description

This lecture explores the implementation of a concurrent stack data structure, which follows the last in first out property. The instructor explains how push and pop operations work concurrently by updating the top field using compare and swap operations.

Instructors (2)

esse aliquip

Labore Lorem dolore laboris amet aliquip consequat eu ullamco veniam. Amet anim aliqua minim irure dolore aliquip proident nostrud laborum commodo aute. Amet officia consequat consectetur ad sit. Consequat commodo qui nostrud laborum ullamco pariatur velit. Qui ex consequat laboris tempor irure dolor aute minim sit eiusmod nostrud veniam.

ipsum veniam exercitation

Ut labore dolor eu in ea aliquip voluptate ullamco. Sunt fugiat esse aute exercitation ut consectetur. Id aliqua sint commodo ut cupidatat ipsum. Nulla culpa aute incididunt cillum amet qui officia aliqua. Veniam ut ullamco quis consequat enim dolor nisi magna nisi commodo et incididunt ad Lorem. Veniam laboris aute duis ad consectetur nisi adipisicing ex.

Official source

https://mediaspace.epfl.ch/media/0_xqf54wgr

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related lectures (32)