@techreport{18145,
  abstract     = {{Preis für den Beitrag "Multimediale Entdeckungsreisen unserer Welt mit dem Internet"}},
  author       = {{Ziegler, Martin and Fischer, Matthias and Lukovszki, Tamás}},
  title        = {{{Multimediale Entdeckungsreisen unserer Welt mit dem Internet}}},
  year         = {{1998}},
}

@inproceedings{16568,
  abstract     = {{We present a data structure problem which describes the requirements of a simple variant of fully dynamic walk-through animation: We assume the scene to consist of unit size balls in R2 or higher dimensions. The scene may be arbitrarily large and has to be stored in secondary memory (discs) with relatively slow access. We allow a visitor to walk in the scene, and a modeler to update the scene by insertions and deletions of balls. We focus on the realtime requirement of animation systems: For some t (specified by the computation power of (the rendering hardware of) the graphic workstation) the data structure has to guarantee that the balls within distance t of the current visitor's position are presented to the rendering hardware, 20 times per second. Insertions and deletions should also be available to the visitor with small delay, independent of the size of the scene. We present a data structure that fulfills the above task in realtime. Its runtime is output-sensitive, i.e. linear in a quantity close to the output size of the query. We further present (preliminary) experimental results indicating that our structure is efficient in practice.
}},
  author       = {{Fischer, Matthias and Meyer auf der Heide, Friedhelm and Strothmann, Willy-Bernhard}},
  booktitle    = {{5th Annual European Symposium on Algorithms (ESA '97)}},
  isbn         = {{9783540633976}},
  issn         = {{0302-9743}},
  pages        = {{157--170}},
  publisher    = {{Springer}},
  title        = {{{Dynamic data structures for realtime management of large geometric scenes}}},
  doi          = {{10.1007/3-540-63397-9_13}},
  volume       = {{1284}},
  year         = {{1997}},
}

@inproceedings{17483,
  abstract     = {{In this paper we develop a model for communication time on parallel computers consisting of processors and a service network, i.e., a network performing services like broadcast, synchronization, and global variables. The implementation of the service network is done on a free configurable Transputer network.
Our cost model describes the communication time of accesses to global variables and consists of a multi-linear function. The cost model includes the parameters packet size, send hot spot, and the number of processors accessing global variables. These parameters influence the communication time in a high degree and capture important parameters like contention.
We implement a Bitonic Sort and a Connected Components algorithm (among others) and we show that our model is able to predict the communication time within a 10% error if indirect service networks are used. The applications show that it is easy for a programmer to determine the parameter values for our model and that our new cost model precisely predicts the communication time of parallel algorithms.
Furthermore, we minimize the communication time of accesses to global variables by finding a balance between the number of messages in the network and their size. Our model predicts the optimal values for these parameters which we validate by experiments. A modified implementation of our routing which determines on-line the optimal parameter values for an access to a global variable achieves good speed ups.}},
  author       = {{Fischer, Matthias and Rethmann, Jochen and Wachsmann, Alf}},
  booktitle    = {{3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW '96)}},
  isbn         = {{905199267X}},
  pages        = {{13–27}},
  publisher    = {{IOS Press}},
  title        = {{{A Realistic Cost Model for the Communication Time in Parallel Programs}}},
  year         = {{1996}},
}

@techreport{18352,
  abstract     = {{In this report, we develop a cost model for the communication time on parallel computers consisting of processors and a service network, i.e., a network performing services like broadcast, synchronization, and global variables. Because we do not have a parallel computer at our disposal that is equipped with a service network, we emulate the service network on a reconfigurable Transputer network.
Our cost model describes the communication time of accesses to global variables and consists of a multi­linear function. The cost model includes the parameters packet size, send hot spot (the number of messages sent out by one processor), and number of processors accessing global variables. We show that these parameters influence the communication time in a high degree and capture important parameters like network contention.
We implement a Bitonic Sort, Sample Sort, Matrix Multiplication, and Connected Components algorithm, and we show that our model is able to predict the communication time within a 10% error if indirect service networks are used. The applications show that it is easy for a programer to determine the parameter values for our model and that our new cost model precisely predicts the communication time of parallel algorithms.
We explore the interaction of hot spots and asynchrony and show that the influence of hot spots to the communication time is not as high as one would expect from theoretical considerations in a synchronous model. Therefore, we do not apprehend the hot spot in our cost model.
Furthermore, we minimize the communication time of accesses to global variables by finding a balance between the number of messages in the network and their size. Our model predicts the optimal values for these parameters which we validate by experiments. A modified implementation of our routing which determines on­line the optimal parameter values for an access to a global variable achieves good speed ups.
}},
  author       = {{Fischer, Matthias and Rethmann, Jochen and Wachsmann, Alf}},
  title        = {{{A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware}}},
  year         = {{1996}},
}