CS267 / Eng233 / IDS267 Applications of Parallel Computers
Lecture20: Distributed Data Structures
Abstract
This lecture begins by describing some of the general ideas behind
distributed data structures, attempting to place them in the context
of the standard data structures taught in basic undergraduate data
structure classes. The lecture then examines some of the correctness
and performance issues that come into play when actually trying to
implement a distributed data structure, using the building of quad
trees as the main example. Various potential implementations are
considered, the one
that seems more efficient is then studied in further detail. Several
potential problems are pointed out.