@article{scico2012-scheduling,
	title = {Multicore scheduling for lightweight communicating processes},
	author = {Carl G. Ritson and Adam T. Sampson and Frederick R. M. Barnes},
	journal = {Science of Computer Programming},
	volume = 77,
	number = 6,
	pages = {727--740},
	day = 1,
	month = jun,
	year = 2012,
	url = {http://offog.org/publications/scico2012-scheduling.pdf},
	abstract = {Process-oriented programming is a design methodology in which software applications are constructed from communicating concurrent processes. A typical process-oriented design involves the composition of a large number of small isolated component processes. These concurrent components allow 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. The runtime's scheduler, implemented using lock-free algorithms, automatically executes concurrent components in parallel on multicore systems. 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 execute with an efficiency approaching that of optimised sequential and coarse-grain threaded designs.},
}