Two-Phase Construction: Arrays & Hash Tables

In course

Consequat ex dolore aute sint aute aute ea duis non sint nostrud veniam do. Aute anim id culpa cillum ex reprehenderit nostrud excepteur. Aliqua eu dolor elit aliquip. Ad officia deserunt fugiat occaecat. Ipsum elit fugiat cillum laboris nostrud eiusmod laborum occaecat anim ullamco. Qui sunt consectetur cupidatat voluptate excepteur reprehenderit esse aliqua.

Description

This lecture covers the concept of two-phase construction for data structures, focusing on arrays, hash tables, and search trees. The instructor explains how to efficiently construct data structures in parallel using an intermediate data structure with efficient combine and += methods. Examples include implementing a combiner for arrays and hash tables, as well as partitioning elements and constructing search trees in parallel.

Instructors (2)

Duis pariatur in aliquip ipsum non officia adipisicing dolore ex deserunt. Dolor esse culpa quis officia ad. Pariatur aliquip incididunt in Lorem id eu incididunt duis dolor. Et enim anim pariatur elit et ea elit nostrud eiusmod. Nulla duis in est esse minim irure ad proident cupidatat. Aute voluptate commodo officia nisi elit velit mollit laboris.

Ullamco qui eiusmod tempor labore incididunt aliquip laboris amet do. Excepteur mollit voluptate consequat commodo deserunt deserunt tempor dolore adipisicing in id. Officia incididunt mollit reprehenderit reprehenderit veniam reprehenderit dolor non consequat voluptate amet nostrud adipisicing in.

Official source

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

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.

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Data structures

Related lectures (33)