Mapping of task graphs to manycore architectures

The job is available immediately . Contact: Staff of the department, room 0328.

Manycore systems are chips that contain many (several dozen to several hundred) networked processors. The processors often have a very simple structure. Networking takes place via a specialized on-chip network. Software is usually divided into tasks and distributed to several or many processors, sometimes statically in advance, often also dynamically at runtime. Communication between the tasks of a program takes place via the connection network. The problem here is the optimal allocation of tasks to processors without a central coordinator normally being available, i.e. it should be decentralized.

The aim of this work is the modeling of such a system and the investigation of a task mapping algorithm which, similar to navigation systems with traffic jam warning (TMC), attempts to plan task placements and shifts as well as the planning of data traffic based on local feedback.