Abstract Data Management in Networks: Experimental Evaluation of a Provably Good Strategy (2009)
Christof Krick, Friedhelm Meyer, Heide Harald, Räcke Berthold Vöcking, Matthias Westermann
This paper deals with data management for parallel and distributed systems in which the computing nodes are connected by a relatively sparse network. We present the DIVA (Distributed Variables)...
Caching in Networks (Extended Abstract) (2008)
Abstract We present a general framework for the development of on-line algorithms for data management in networks with limited memory capacities. These algorithms dynamically cre-ate and delete...
Richard Cole, Bruce M. Maggs, Friedhelm Meyer, Heide Michael Mitzenmacher, Andréa W. Richa, Klaus Schröder, ...
In this paper we study randomized algorithms for circuit switching on multistage networks related to the butterfly. We devise algorithms that route messages by constructing circuits (or paths) for...
supported by the DFG-Sonderforschungsbereich 376 and by (2008)
Friedhelm Meyer, Heide Christian, Schindelhauer Klaus Volbert
We investigate the problem of path selection in radio networks for a given set of sites in two-dimensional space. For some given static point-to-point communication demand we define measures for...
Richard Cole, Bruce M. Maggst, Friedhelm Meyer, Heides Michael Mitzenmacher, Andrea W. Richat, Klaus Schrijderq
In tbis paper we study randomized algorithms for circuit switching on multistage networks related to the butterfly. We devise algorithms that route messages by constructing circuits (or paths) for...
Richard Cole, Bruce M. Maggs, Friedhelm Meyer, Heide Michael Mitzenmacher, Andréa W. Richa, Klaus Schröder, ...
In this paper we study randomized algorithms for circuit switching on multistage networks related to the butterfly. We devise algorithms that route messages by constructing circuits (or paths) for...
M.: A holistic methodology for network processor design (2003)
Olaf Bonorden, Nikolaus Brüls, Uwe Kastens, Dinh Khoi Le, Friedhelm Meyer, Heide Jörg-christian, ...
The GigaNetIC project aims to develop high-speed components for networking applications based on massively parallel architectures. A central part of this project is the design, evaluation, and...
Olaf Bonorden, Friedhelm Meyer, Heide Rolf Wanka
We report on the results of an automatic configuration approach for implementing complex parallel BSP algorithms. For this approach, a parallel algorithm is described by a sequence of instructions...
Optimal broadcast on parallel locality models (2000)
Ben Juurlink, Petr Kolman, Friedhelm Meyer, Auf Der Heide
In this paper matching upper and lower bounds for broadcast on general purpose parallel computation models that exploit network locality are proven. These models try to capture both the general...
Die Paarbeziehungen ungewollt kinderloser Paare und das Erleben einer In-vitro-Fertilisation (1999)
In der vorliegenden Arbeit wurden die Paarbeziehungen ungewollt kinderloser Paare und der Zusammenhang zwischen ihnen und dem Erleben einerIvF-Behandlung untersucht. Ausgehend von verschiedenen...
Giessen, Univ., Diss., 1998.
Die Paarbeziehungen ungewollt kinderloser Paare und das Erleben einer In-vitro-Fertilisation (1998)
In der vorliegenden Arbeit wurden die Paarbeziehungen ungewollt kinderloser Paare und der Zusammenhang zwischen ihnen und dem Erleben einer IvF-Behandlung untersucht. Ausgehend von verschiedenen...
Giessen, Univ., Diss., 1998.
Richard Cole Bruce, Bruce M. Maggs, Friedhelm Meyer, Heide Michael Mitzenmacher, Andrea W. Richa, Klaus Schroder, ...
In this paper we study randomized algorithms for circuit switching on multistage networks related to the butterfly. We devise algorithms that route messages by constructing circuits (or paths) for...
Richard Cole, Bruce M. Maggs, Michael Mitzenmacher, Friedhelm Meyer, Heide Michael Mitzenmacher, ...
In this paper we study randomized algorithms for circuit switching on multistage networks related to the butterfly. We devise algorithms that route messages by constructing circuits (or paths) for...
Communication in Parallel Systems (1996)
Friedhelm Meyer, Christian Scheideler
. Efficient communication in networks is a prerequisite to exploit the performance of large parallel systems. For this reason much effort has been done in recent years to develop efficient...
Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols (1996)
Friedhelm Meyer, Christian Scheideler
In this paper we present a deterministic protocol for routing arbitrary permutations in arbitrary networks. The protocol is analyzed in terms of the size of the network and the routing number of the...
Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations (1996)
Friedhelm Meyer, Christian Scheideler, Volker Stemann
Assume that a set U of memory locations is distributed among n memory modules, using some number a of hash functions h1 ; : : : ; ha , randomly and independently drawn from a high performance...