Invasive Algorithms and Architectures Invasive Algorithmen und Architekturen
Jürgen Teich · it - Information Technology · 2008
Abstract In this seminal paper, we introduce the notion of invasive algorithms and corresponding parallel computing architectures also called invasive. The main idea of invasion is to add to a given single-processor program the ability to explore neighbor processors and to copy itself to such processors in a phase of invasion, and then to execute the given problem in parallel based on the available (invasible) region on a given multi-processor architecture. After this parallel execution, the program may perform a retreat and resume execution again sequentially on the single processor. In order to support invasion, new architectural concepts as well as means to support invasion on reconfigurable MPSoCs are provided. We do believe that invasion will become an important step towards self-organizing behavior which will be needed in the massively parallel MPSoC area beyond the year 2020 with unrivaled performance and resource efficiency numbers as one of the main challenges for MPSoCs apart from their programming. In case of invasion, an algorithm is able to spread itself for parallel execution based on availability of processing resources.