Papers by Ulf-peter Schroeder
This article focuses on principles for the design of efficient parallel algorithms for distribute... more This article focuses on principles for the design of efficient parallel algorithms for distributed memory computing systems. We describe the general trend in the development of architectural properties and evaluate the state-of-the-art in a number of basic primitives like graph embedding, partitioning, dynamic load distribution, and communication which are used, to some extent, within all parallel applications. We discuss possible directions for future work on the design of universal basic primitives, able to perform efficiently on a broad range of parallel systems and applications, and we also give certain examples of specific applications which demand specialized basic primitives in order to obtain efficient parallel implementations. Finally, we show that programming frames can offer a convenient way to encapsulate algorithmic know-how on applications and basic primitives and to offer this knowledge to non-specialist users in a very effective way. 1 Introduction Parallel processin...
Bookmarks Related papers MentionsView impact
Mathematical Foundations of Computer Science 1998, 1998
Page 1. Embedding of Hypercubes into Grids * SL Bezrukov 1, JD Chavez 2, LHHarper 3, M. Rbttger 1... more Page 1. Embedding of Hypercubes into Grids * SL Bezrukov 1, JD Chavez 2, LHHarper 3, M. Rbttger 1, and U.-P. Schroeder I 1 Department of Math. and ... [3,8] for d = 2) Theorem 1 V/•< lim ~ < -- ~ w ~ . ~ a -- Vn ~ d=o(n) Moreover ...
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
International Series in Operations Research & Management Science, 2008
Bookmarks Related papers MentionsView impact
Theory of Computing Systems
Bookmarks Related papers MentionsView impact
28.66> k) = rH n a (k) for the graph H n a . The paper is organized as follows. In the next se... more 28.66> k) = rH n a (k) for the graph H n a . The paper is organized as follows. In the next section we present some known facts and auxiliary results used throughout the paper. In Section 3 we get lower and upper bounds for r(n; a; k) for general values of k. Section 4 and 5 are devoted to the asymptotic of r(n; a; k) in the case of a fixed n and growing a and fixed a and growing n respectively. In both cases we assume that k is a constant. Some extended results for related graphs and possible directions for further research conclude the paper in Section 6. References
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 1994
ABSTRACT The hypercube is a particularly versatile network for parallel computing. It is wellknow... more ABSTRACT The hypercube is a particularly versatile network for parallel computing. It is wellknown that 2-dimensional grid machines can be simulated on a hypercube with a small constant communication overhead. We introduce new easily computable functions which embed many 3-dimensional grids into their optimal hypercubes with dilation 2. Moreover, we show that one can reduce the open problem to recognize whether it is possible to embed every 3-dimensional grid into its optimal hypercube with dilation at most 2 by constructing embeddings for a particular class of grids. We embed some of these grids, and thus for the first time one can guarantee that every 3-dimensional grid with at most 2 9 Gamma 18 nodes is embeddable into its optimal hypercube with dilation 2. Key words: embedding, hypercubes, 3-dimensional grids, dilation, GrayCode 1 Introduction Within the last decade parallel computing has received considerable attention in computer science. The main reasons for the growing interest are...
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 1995
ABSTRACT This paper describes the mapping kernel of the virtual topology library for the commerci... more ABSTRACT This paper describes the mapping kernel of the virtual topology library for the commercial run-time system PARIX 3. The mapping kernel is composed of a collection of injective embedding functions for special interconnection structures of process graphs (virtual topologies) onto a 2-dimensional grid architecture of parallel machines of the MIMD type. Each of these functions realizes a concrete virtual topology by placing each process on a different processor and establishing the communication channels as virtual links with communication primitives of PARIX. The implemented functions were selected under the criteria of fast distributed computation, universal applicability, and small dilation, awell-known cost measure for graph embedding. The virtual topology library supports the implementation of parallel applications and leads to a portable programming and an efficient usage of MIMD-systems.
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 1995
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 1995
ABSTRACT . A hardware independent method of programming a massively parallel machine #MPP# can be... more ABSTRACT . A hardware independent method of programming a massively parallel machine #MPP# can best be supported byawell-designed run-time environment. An important problem in this design is the ability of e#ciently simulating networks di#erent from the hardware topology. We will describe the mapping kernel of the virtual processors library for the commercial run-time system PARIX 3 . This kernel contains description classes for several topologies #so-called virtual topologies# and implementations of respectiveembeddings which map given instances of virtual topologies onto others or onto the hardware. Using these functions, PARIX is able to establish concrete virtual topologies with corresponding communication channels. The implemented functions were selected with respect to the well-known criteria for graph embeddings: equal load and small dilation. Additionally,we focus on fast distributed computation and universal applicability. As an example, we will show new methods for e#ciently embedd...
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2009
Bookmarks Related papers MentionsView impact
… of Computer Science …, 1998
Bookmarks Related papers MentionsView impact
Parallel Processing Letters, 1998
Bookmarks Related papers MentionsView impact
Discrete Mathematics, 2000
Bookmarks Related papers MentionsView impact
Discrete Applied Mathematics, 1999
Bookmarks Related papers MentionsView impact
Discrete Applied Mathematics, 1998
Bookmarks Related papers MentionsView impact
Discrete Applied Mathematics, 2001
Bookmarks Related papers MentionsView impact
... BibTeX | Add To MetaCart. @MISC{Römke95efficientmapping, author = {Thomas Römke and Markus Rö... more ... BibTeX | Add To MetaCart. @MISC{Römke95efficientmapping, author = {Thomas Römke and Markus Röttger and Ulf-Peter Schroeder and Jens Simon}, title = {Efficient Mapping Library for PARIX}, year = {1995} }. ... 13, Kropf: A fast distributed Mapping Algorithm Boillat, G - 1990. ...
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Uploads
Papers by Ulf-peter Schroeder