Networking

Phoenix Rebirth: Scalable MapReduce on a Large-Scale Shared-Memory System

Free registration required

Executive Summary

Dynamic runtimes can simplify parallel programming by automatically managing concurrency and locality without further burdening the programmer. Nevertheless, implementing such runtime systems for large-scale, shared-memory systems can be challenging. This paper optimizes Phoenix, a MapReduce runtime for shared-memory multi-cores and multiprocessors, on a quad-chip, 32-core, 256-thread UltraSPARC T2+ system with NUMA characteristics. The authors show how a multi-layered approach that comprises optimizations on the algorithm, implementation, and OS interaction leads to significant speedup improvements with 256 threads (average of 2.5? higher speedup, maximum of 19?).

  • Format: PDF
  • Size: 153.2 KB