@phdthesis {phd:2014:daniele.bonetta,
	title = {A Parallel Programming Model and Runtime System for Safe Event-based Parallel Programming},
	year = {2014},
	month = {September},
	pages = {179},
	school = {USI},
	type = {PhD},
	address = {Lugano, Switzerland},
	abstract = {Recent trends in programming models for server-side development have shown an increasing popularity of event-based single-threaded programming models based on the combination of dynamic languages such as JavaScript and event-based runtime systems for asynchronous I/O management such as Node.JS. Reasons for the success of such models are the simplicity of the single-threaded event-based programming model as well as the growing popularity of the Cloud as a deployment platform for Web applications. Unfortunately, the popularity of single-threaded models comes at the price of performance and scalability, as single-threaded event-based models present limitations when parallel processing is needed, and traditional approaches to concurrency such as threads and locks don{\textquoteright}t play well with event-based systems.

This Dissertation proposes a programming model and a runtime system to overcome such limitations by enabling single-threaded event-based applications with support for speculative parallel execution.
The model, called Parallel event loop, has the goal of bringing parallel execution to the domain of single-threaded event-based programming without relaxing the main characteristics of the single-threaded model, and therefore providing developers with the impression of a safe, single-threaded, runtime. Rather than supporting only pure single-threaded programming, however, the parallel event loop can also be used to derive safe, high-level, parallel programming models characterized by a strong compatibility with single-threaded runtimes. We describe three distinct implementations of speculative runtimes enabling the parallel execution of event-based applications. The first implementation we describe is a pessimistic runtime system based on locks to implement speculative parallelization. The second and the third implementations are based on two distinct optimistic runtimes using software transactional memory. Each of the implementations supports the parallelization of applications written using an asynchronous single-threaded programming style, and each of them enables applications to benefit from parallel execution.},
	keywords = {Parallel JavaScript},
	author = {Daniele Bonetta}
}
@conference {pjs:2014:ppopp,
	title = {TigerQuoll: parallel event-based JavaScript},
	booktitle = {Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming (PPoPP {\textquoteright}13)},
	year = {2013},
	month = {February},
	pages = {251{\textendash}260},
	publisher = {ACM},
	organization = {ACM},
	address = {Shenzhen, China},
	abstract = {JavaScript, the most popular language on the Web, is rapidly moving to the server-side, becoming even more pervasive. Still, JavaScript lacks support for shared memory parallelism, making it challenging for developers to exploit multicores present in both servers and clients. In this paper we present TigerQuoll, a novel API and runtime for parallel programming in JavaScript. TigerQuoll features an event-based API and a parallel runtime allowing applications to exploit a mutable shared memory space. The programming model of TigerQuoll features automatic consistency and concurrency management, such that developers do not have to deal with shared-data synchronization. TigerQuoll supports an innovative transaction model that allows for eventual consistency to speed up high-contention workloads. Experiments show that TigerQuoll applications scale well, allowing one to implement common parallelism patterns in JavaScript.},
	keywords = {JavaScript, Parallel JavaScript, TigerQuoll},
	isbn = {978-1-4503-1922-5},
	doi = {http://doi.acm.org/10.1145/2442516.2442541},
	author = {Daniele Bonetta and Walter Binder and Cesare Pautasso}
}
