Message Passing or Shared Memory: Evaluating the Delegation Abstraction for Multicores
, Oracle Labs
Date: Friday, December 06, 2013
Time: 1:00 PM to 2:30 PM Note: all times are in the Eastern Time Zone
Refreshments: 12:45 PM
Location: G-882 (Hewlett)
Host: Nir Shavit + Jeremy Kepner (CRIBB), CIS, TOC, CSAIL, MIT
Contact: Linda Lynch, 617 715 2459, firstname.lastname@example.org
Speaker URL: None
email@example.com, firstname.lastname@example.org, email@example.com, firstname.lastname@example.org
TALK: Message Passing or Shared Memory: Evaluating the Delegation Abstraction for Multicores
Even for small multi-core systems, it has become harder and harder to support a simple shared memory abstraction. Processors access some memory regions more quickly than others, which is a phenomenon called "non-uniform memory access" (NUMA). These trends have prompted researchers to investigate alternative programming abstractions based on message passing rather than cache-coherent shared memory. To advance a pragmatic understanding of these models' strengths and weaknesses, we have explored a range of different message passing and shared memory designs, for a variety of concurrent data structures, running on different multi-core architectures. Our goal was to evaluate which combinations perform best and where simple software or hardware optimizations might have the most impact. We observe that different approaches perform best in different circumstances, and that the communication overhead of message passing can often outweigh its benefits. Nonetheless, we discuss ways in which this balance may shift in the future. Overall, we conclude that, by emphasizing high-level shared data abstractions, software should be designed to be largely independent of the choice of low-level communication mechanism.
Created by Linda Lynch at Tuesday, November 26, 2013 at 11:44 AM.