@inproceedings{39502,
  abstract     = {{The authors present a new approach to an interactive design and analysis environment for visual languages. The main components, i.e., editor animator and interpreter are introduced. Their interactions are being investigated emphasizing the interpreter-animator interaction and defining an interface supporting different levels of automation. The interpreter performs the executions on a logical level and triggers the animator. The interactive animation provides a very high degree of liveness since it is based on the tight integration of the animator and editor. The proposed architecture permits the distributed implementation of a system for real-time animation. Their concepts are validated by the implementation of a debugging environment for the complete visual programming language Pictorial Janus.}},
  author       = {{Dücker, M. and Lehrenfeld, Georg and Müller, Wolfgang and Tahedl, C.}},
  booktitle    = {{ Proceedings International Conference and Workshop on Engineering of Computer-Based Systems}},
  isbn         = {{0-8186-7889-5}},
  keywords     = {{Real time systems, Animation, Debugging, Automation, Computer languages, Timing, Environmental management, Programming environments, Visualization, Multimedia systems}},
  location     = {{Monterey, CA, USA }},
  title        = {{{A Generic System for Interactive Real--Time Animation}}},
  doi          = {{10.1109/ECBS.1997.581876}},
  year         = {{1997}},
}

@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}},
}

@inbook{19816,
  author       = {{Kleine Büning, Hans and Lettmann, Theodor}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783540618638}},
  issn         = {{0302-9743}},
  title        = {{{Learning a representation for optimizable formulas}}},
  doi          = {{10.1007/3-540-61863-5_33}},
  year         = {{1996}},
}

@article{19958,
  author       = {{Schwarze, Frank and Meyer auf der Heide, Friedhelm and Schröder, Klaus}},
  journal      = {{Euro-Par 1996}},
  pages        = {{299--306}},
  title        = {{{Routing on Networks of Optical Crossbars (Extended Abstract).}}},
  volume       = {{I}},
  year         = {{1996}},
}

@phdthesis{3260,
  author       = {{Wehrheim, Heike}},
  publisher    = {{University of Hildesheim, Germany}},
  title        = {{{Specifying reactive systems with action dependencies: modelling and hierarchical design}}},
  year         = {{1996}},
}

@article{3261,
  author       = {{Goltz, Ursula and Wehrheim, Heike}},
  journal      = {{Inf. Process. Lett.}},
  number       = {{4}},
  pages        = {{179----184}},
  title        = {{{Modelling Causality via Action Dependencies in Branching Time Semantics}}},
  doi          = {{10.1016/0020-0190(96)00111-1}},
  year         = {{1996}},
}

@inproceedings{3262,
  author       = {{Goltz, Ursula and Wehrheim, Heike}},
  booktitle    = {{Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings}},
  editor       = {{Penczek, Wojciech and Szalas, Andrzej}},
  pages        = {{394----406}},
  title        = {{{Causal Testing}}},
  doi          = {{10.1007/3-540-61550-4_165}},
  year         = {{1996}},
}

@techreport{17418,
  author       = {{Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}},
  title        = {{{Contention Resolution in Hashing Based Shared Memory Simulations}}},
  year         = {{1996}},
}

@inproceedings{17419,
  abstract     = {{We present a parallel algorithm for the rendering of complex three-dimensional scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting of a visualization-node, equipped with a powerful graphics adapter, and cluster nodes requiring weaker graphics capabilities only. The visualization-node renders a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes assist the visualization-node by asynchronous computing of Reliefboards, which are used to replace and render distant parts of the scene. Our algorithm is capable of gaining significant speedups if the cluster's nodes provide weak graphics adapters only. We trade the number of cluster nodes off the scene objects' image quality.}},
  author       = {{Grigoriev, Dima and Karpinski, Marek and Meyer auf der Heide, Friedhelm and Smolensky, Roman}},
  booktitle    = {{Proc. of 28th ACM-STOC}},
  pages        = {{612--621}},
  publisher    = {{Eurographics Symposium on Parallel Graphics and Visualization}},
  title        = {{{A lower bound for randomized algebraic decision trees}}},
  volume       = {{65453}},
  year         = {{1996}},
}

@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}},
}

@inbook{17564,
  author       = {{Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm and Rieping, Ingo}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783540616276}},
  issn         = {{0302-9743}},
  pages        = {{369--376}},
  title        = {{{Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model}}},
  doi          = {{10.1007/bfb0024725}},
  year         = {{1996}},
}

@inproceedings{1918,
  author       = {{Dreier, Bernd and Huber, Annja and Zahn, Markus  and Karl, Holger and Ungerer, Theo}},
  booktitle    = {{Proceedings Trends in Distributed Systems}},
  title        = {{{ReGTime - Rent Gigaflops someTimes}}},
  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}},
}

@phdthesis{2181,
  author       = {{Scheideler, Christian}},
  publisher    = {{University of Paderborn, Germany}},
  title        = {{{Universal routing strategies}}},
  year         = {{1996}},
}

@article{2182,
  author       = {{Meyer auf der Heide, Friedhelm and Scheideler, Christian and Stemann, Volker}},
  journal      = {{Theor. Comput. Sci.}},
  number       = {{2}},
  pages        = {{245----281}},
  title        = {{{Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations}}},
  doi          = {{10.1016/0304-3975(96)00032-1}},
  year         = {{1996}},
}

@inproceedings{2183,
  author       = {{Meyer auf der Heide, Friedhelm and Scheideler, Christian}},
  booktitle    = {{FOCS}},
  pages        = {{370----379}},
  title        = {{{Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols}}},
  year         = {{1996}},
}

@inproceedings{2184,
  author       = {{Meyer auf der Heide, Friedhelm and Scheideler, Christian}},
  booktitle    = {{SOFSEM}},
  pages        = {{16----33}},
  publisher    = {{Springer}},
  title        = {{{Communication in Parallel Systems}}},
  volume       = {{1175}},
  year         = {{1996}},
}

@inproceedings{2186,
  author       = {{Cypher, Robert and Meyer auf der Heide, Friedhelm and Scheideler, Christian and Vöcking, Berthold}},
  booktitle    = {{STOC}},
  pages        = {{356----365}},
  publisher    = {{ACM}},
  title        = {{{Universal Algorithms for Store-and-Forward and Wormhole Routing}}},
  year         = {{1996}},
}

@proceedings{7796,
  editor       = {{Engels, Gregor and Ehrig, Hartmut and Rozenberg, Grzegorz and Skowron, Andrzej}},
  number       = {{3-4}},
  publisher    = {{IOS Press}},
  title        = {{{Special Issue on Graph Transformations}}},
  volume       = {{26}},
  year         = {{1996}},
}

@inproceedings{7834,
  abstract     = {{The concept of views is used on two levels. First, so-called design views are developed for structuring specifications, that is, a system is modeled according to different views (e.g., representing the needs of different kinds of users) which have to be synchronized afterwards in order to build the whole system. Views can be specified by means of typed graph transformation systems, where the type graph determines the visible types and the productions describe the known operations of that view. The synchronization of views is done by the construction of cooperative parallel composition of graph transformation systems, developed by Leila Ribeiro and presented at the same seminar. If the specification is complete, a view may describe an observation of the system in operation. In this case we speak of a user view. It turns out that the semantics of such a view cannot be described by computations (i.e., graph transformations), but just by observations of computations of the global system. Such observations of computations cannot be represented by graph transformations in the usual sense because a local view may lack operations (productions) of the global system, so that state changes may be observed that do not have a cause in the local view. Therefore, the notion of graph transition is introduced as loose semantics for productions, where the production specifies only a lower bound to the activities that are to happen during application. Contrastingly, in the classical doublepushout approach to graph rewriting, productions are interpreted as complete descriptions of the transformations to be performed. For typed graph transformation systems a transition sequence semantics is developed, comprising all finite and infinite sequences of transitions in a system. Moreover, this semantics is shown to be compositional w.r.t. the synchronization of views.}},
  author       = {{Ehrig, Hartmut and Heckel, Reiko and Padberg, Julia and Taentzer, Gabriele and Wolter, Uwe and Corradini, Andrea and Engels, Gregor}},
  booktitle    = {{Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science}},
  number       = {{155}},
  pages        = {{11--12}},
  publisher    = {{Technical University of Berlin}},
  title        = {{{Synchronization of Views and Loose Semantics of Typed Graph Productions}}},
  year         = {{1996}},
}