Shared-Memory Parallelism Can Be Simple, Fast, and Scalable

Writing efficient and scalable parallel programs is notoriously difficult, and often requires significant expertise. To address this challenge, it is crucial to provide programmers with high-level tools to enable them to develop solutions. This thesis addresses this challenge, and provides evidence that shared-memory programs can be simple, fast, and scalable.