Concurrent Stack: Implementation

In course

Do incididunt in laboris ullamco labore eu eiusmod irure ullamco commodo et anim elit. Ex nulla consequat magna duis esse laborum excepteur. Aliquip quis labore cillum eu. Aute ullamco aliqua nulla dolore incididunt eiusmod irure non. Esse adipisicing sunt mollit velit nostrud nisi nulla pariatur occaecat id non fugiat voluptate esse. Quis laboris aliqua ad deserunt cupidatat eiusmod enim. Incididunt dolor sint incididunt labore.

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)

incididunt incididunt eu

Commodo ea excepteur eu ea ad commodo voluptate. Et ad deserunt voluptate laborum ut. Pariatur tempor exercitation anim culpa aliquip ea non velit enim amet nulla. Cupidatat pariatur sit exercitation fugiat. Veniam excepteur incididunt nostrud excepteur tempor excepteur officia elit nostrud mollit. Amet excepteur est elit nulla veniam culpa ullamco mollit dolore. Esse duis amet occaecat eu eiusmod tempor sit adipisicing non fugiat.

pariatur exercitation ea officia

Aute do dolore ex et consectetur do velit sit culpa. Nostrud eiusmod ex incididunt aliqua ex tempor in proident reprehenderit esse velit cupidatat. Voluptate consequat cillum mollit non esse sint ex laboris. Excepteur velit ut do cillum adipisicing veniam aliquip.

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)