Logo des Repositoriums

Auflistung nach Autor:in "Halbach, Mathias"

1 - 3 von 3
  • Konferenzbeitrag
    FPGA implementation of cellular automata compared to software implementation
    (ARCS 2004 – Organic and pervasive computing, 2004) Halbach, Mathias; Hoffmann, Rolf; Röder, Patrick
    In order to optimize applications in the Cellular Automata model we have searched for a performant platform to run billions of simulations. The question was how much speed-up could be gained by using the FPGA technology compared to optimized software. As an example we implemented two cellular automata rules in software on a PC and also in FPGA logic. On our low end experimental platform we reached a speed-up of 19 for a medium complex rule and 14 for a complex rule. If we would use the latest high end FPGA technology, speed-ups up to many thousand are realistic. A cluster of thousands of workstations would be necessary to reach the same performance which is much more costly than a FPGA solution.
  • Konferenzbeitrag
    How efficient are creatures with time-shuffled behaviors?
    (9th workshop on parallel systems and algorithms – workshop of the GI/ITG special interest groups PARS and PARVA, 2008) Ediger, Patrick; Hoffmann, Rolf; Halbach, Mathias
    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.
  • Konferenzbeitrag
    Minimising the hardware resources for a cellular automaton with moving creatures
    (ARCS'06, 19th International Conference on Architecture of Computing Systems, 2006) Halbach, Mathias; Hoffmann, Rolf