关键词：布局引擎；树的遍历；并行算法
摘 要：At the most practical level, this thesis examines how to parallelize a language for laying out visualizations. By specifying important subsets of layout languages with a restricted form of constraints over trees, we find we can abstract the problem to automatically parallelizing systems of constraints. Our solution combines language design, program synthesis, and highperformance algorithms. We introduce innovatations in each of these areas in order to build our end-to-end system.This thesis introduces techniques for parallel computing over trees and applies them to generating layout engines.