Multicore Scheduling for Lightweight Communicating Processes

Abstract. Process-oriented programming is a design methodology in which software applications are constructed from communicating concur-rent processes. A process-oriented design is typically composed of a large number of small isolated concurrent components. These components al-low for the scalable parallel execution of the resulting application on both shared-memory and distributed-memory architectures. In this paper we present a runtime designed to support process-oriented programming by providing lightweight processes and communication primitives. Our run-time scheduler, implemented using lock-free algorithms, automatically executes concurrent components in parallel on multicore systems. Run-time heuristics dynamically group processes into cache-affine work units based on communication patterns. Work units are then distributed via wait-free work-stealing. Initial performance analysis shows that, using the algorithms presented in this paper, process-oriented software can ex-ecute with an efficiency approaching that of optimised sequential and coarse-grain threaded designs.