http://dl.gi.de/handle/20.500.12116/22267 Tue, 21 Jul 2026 13:20:06 GMT 2026-07-21T13:20:06Z http://dl.gi.de/handle/20.500.12116/22277 A Generic Tool Supporting Cache Design and Optimisation on Shared Memory Systems Schindewolf, Martin; Tao, Jie; Karl, Wolfgang; Cintra, Marcelo Nagel, Wolfgang E.; Hoffmann, Rolf; Koch, Andreas For multi-core architectures, improving the cache performance is crucial for the overall system performance. In contrast to the common approach to design caches with the best trade-off between performance and costs, this work favours an application specific cache design. Therefore, an analysis tool capable of exhibiting the reason of cache misses has been developed. The results of the analysis can be used by system developers to improve cache architectures or can help programmers to improve the data locality behaviour of their programs. The SPLASH-2 benchmark suite is used to demonstrate the abilities of the analysis model. Tue, 01 Jan 2008 00:00:00 GMT http://dl.gi.de/handle/20.500.12116/22277 2008-01-01T00:00:00Z http://dl.gi.de/handle/20.500.12116/22279 How efficient are creatures with time-shuffled behaviors? Ediger, Patrick; Hoffmann, Rolf; Halbach, Mathias Nagel, Wolfgang E.; Hoffmann, Rolf; Koch, Andreas The task of the creatures in the “creatures’ exploration problem” is to visit all empty cells in an environment with a minimum number of steps. We have analyzed this multi agent problem with time-shuffled algorithms (behaviors) in the cellular automata model. Ten different “uniform” (non-time-shuffled) algorithms with good performance from former investigations were used alternating in time. We designed three time-shuffling types differing in the way how the algorithms are interweaved. New metrics were defined for such a multi agent system, like the absolute and relative efficiency. The efficiency relates the work of an agent system to the work of a reference system. A reference system is such a system that can solve the problem with the lowest number of creatures with uniform or time-shuffled algorithms. Some time-shuffled systems reached high efficiency rates, but the most efficient system was a uniform one with 32 creatures. Among the most efficient successful systems the uniform ones are dominant. Shuffling algorithms resulted in better success rates for one creature. But this is not always the case for more than one creature. Tue, 01 Jan 2008 00:00:00 GMT http://dl.gi.de/handle/20.500.12116/22279 2008-01-01T00:00:00Z http://dl.gi.de/handle/20.500.12116/22278 Parallel derivative computation using ADOL-C Kowarz, Andreas; Walther, Andrea Nagel, Wolfgang E.; Hoffmann, Rolf; Koch, Andreas Derivative computation using Automatic Differentiation (AD) is often considered to operate purely serial. Performing the differentiation task in parallel may require the applied AD-tool to extract parallelization information from the user function, transform it, and apply this new strategy in the differentiation process. Furthermore, when using the reverse mode of AD, it must be ensured that no data races are introduced due to the reversed data access scheme. Considering an operator overloading based AD-tool, an additional challenge is to be met: Parallelization statements are typically not recognized. In this paper, we present and discuss the parallelization approach that we have integrated into ADOL-C, an operator overloading based AD-tool for the differentiation of C/C++ programs. The advantages of the approach are clarified by means of the parallel differentiation of a function that handles the time evolution of a 1D-quantum plasma. Tue, 01 Jan 2008 00:00:00 GMT http://dl.gi.de/handle/20.500.12116/22278 2008-01-01T00:00:00Z http://dl.gi.de/handle/20.500.12116/22276 Adaptive Cache Infrastructure: Supporting dynamic Program Changes following dynamic Program Behavior Nowak, Fabian; Buchty, Rainer; Karl, Wolfgang Nagel, Wolfgang E.; Hoffmann, Rolf; Koch, Andreas Recent examinations of program behavior at run-time revealed distinct phases. Thus, it is evident that a framework for supporting hardware adaptation to phase behavior is needed. With the memory access behavior being most important and cache accesses being a very big subset of them, we herein propose an infrastructure for fitting cache accesses to a program’s requirements for a distinct phase. Tue, 01 Jan 2008 00:00:00 GMT http://dl.gi.de/handle/20.500.12116/22276 2008-01-01T00:00:00Z