Lecture

Two-Phase Construction: Arrays & Hash Tables

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.

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.