Date: Thursday 21 March 2013
Time: 11:00 - 12:30
Location / Room: Les Bans

Chair:
Oliver Bringmann, University of Tuebingen, DE

Co-Chair:
Sébastien Le Beux, Lyon Institute of Nanotechnology, FR

This session deals with parallel programming models and scheduling. The first paper employs game theory to decentralized task migration for execution speed-up and fault tolerance. The other three papers propose parallel-programming models and scheduling approaches for software pipelines, fine-grained OpenMP, and asynchronous joining of forked tasks, respectively.

Time	Label	Presentation Title Authors
11:00	10.7.1	(Best Paper Award Candidate) GAME-THEORETIC ANALYSIS OF DECENTRALIZED CORE ALLOCATION SCHEMES ON MANY-CORE SYSTEMS Authors: Stefan Wildermann, Tobias Ziermann and Jürgen Teich, University of Erlangen-Nuremberg, DE Abstract
11:30	10.7.2	ENABLING FINE-GRAINED OPENMP TASKING ON TIGHTLY-COUPLED SHARED MEMORY CLUSTERS Authors: Paolo Burgio, Giuseppe Tagliavini, Andrea Marongiu and Luca Benini, University of Bologna, IT Abstract
12:00	10.7.3	ARTM: A LIGHTWEIGHT FORK-JOIN FRAMEWORK FOR MANYCORE EMBEDDED SYSTEMS Authors: Maroun Ojail, Raphaël David, Yves Lhuillier and Alexandre Guerre, CEA LIST, FR Abstract
12:15	10.7.4	PIPELETS: SELF-ORGANIZING SOFTWARE PIPELINES FOR MANY CORE ARCHITECTURES Authors: Janmartin Jahn and Jörg Henkel, Karlsruhe Institute of Technology, DE Abstract
12:30	IP5-10, 406	AN INTEGRATED APPROACH FOR MANAGING THE LIFETIME OF FLASH-BASED SSDS Authors: Sungjin Lee, Taejin Kim, Ji-Sung Park and Jihong Kim, Seoul National University, KR Abstract
12:30		End of session Lunch Break in Ecrins Buffet lunch (Eat early for Smart Cities and Communities Keynote - Room Oisans at 1330; http://www.date-conference.com/conference/session/11.0)