Abstract A Note on Implementing Combining Networks (2008)
In shared-memory multiprocessors, combining networks serve to eliminate hot spots due to concurrent access to the same memory location. Examples are the NYU Ultracomputer, the IBM RP3 and the Fluent...
Abstract HPP: A High Performance PRAM (2008)
Arno Formella, Jorg Keller, Thomas Walle, Arno Formella, Jorg Keller, Thomas Walle
We present a fast shared memory multiprocessor with uniform memory access time. A rst prototype (SB{PRAM) is running with 4 processors, a 128 processor version is under construction. A second...
1 Reduction of Network Cost and Wiring in Ranade's Butterfly Routing (2007)
D. Cross, R. Drefenstedt, J. Keller, David Cross, Reinhard Drefenstedt, Jorg Keller
The class of n--input butterfly networks is very important for the design of scalable parallel machines because of constant node degree, depth log n and the existence of routing algorithms capable of...
1 Regular Layouts of Butterfly Networks in Three Dimensions (2007)
M. L. Kersten, F. Kwakkel, Jorg Keller
Physical arrangements of butterfly networks impose severe problems because of wire length. The problem gets even harder if standard technology like printed circuit boards, racks, and cabinets, must...
2000. Meta-analysis: From data characterisation for meta-learning to meta-regression (2007)
Christian Kopf, Charles Taylor, Jorg Keller
Abstract. An extended Meta-Analysis fertilizes a Meta-Learning, which is applied to support the user with an automated guidance in model selection and data-transformation. Two major application elds...
Evaluation of Machine-learning Algorithm Ranking Advisors (2000)
Helmut Berrer, Iain Paterson, Jorg Keller
Abstract. Selecting the best-suited machine-learning classi cation algorithms for data-mining tasks is a meta-learning activity of the METAL project. Two alternative approaches for providing a user...
Video-on-Demand on the SB-PRAM (1996)
Jorg Friedrich, Thomas Grun, Jorg Keller
We investigate the use of random striping to store movies on the SB--PRAM, a massively parallel multiprocessor. Our simulations show that the SB--PRAM provides enough bandwidth between disks and...
HPP: A High Performance PRAM (1996)
Arno Formella, Arno Formella, Jörg Keller, Jorg Keller, Thomas Walle, Thomas Walle
We present a fast shared memory multiprocessor with uniform memory access time. A first prototype (SB--PRAM) is running with 4 processors, a 128 processor version is under construction. A second...
HPP: A High Performance PRAM (1996)
Arno Formella Jorg, Arno Formella, Jorg Keller, Thomas Walle
. We present a fast shared memory multiprocessor with uniform memory access time. A first prototype (SB-PRAM) is running with 4 processors, a 128 processor version is under construction. A second...
Parallel Software Caches (1996)
Arno Formella, Arno Formella, Jörg Keller, Jorg Keller
We investigate the construction and application of parallel software caches in shared memory multiprocessors. In contrast to maintaining a private cache for each thread, a parallel cache allows the...
Parallel software caches (1996)
Arno Formella, Arno Formella, Jorg Keller, Jorg Keller
We investigate the construction and application of parallel software caches in shared memory multiprocessors. In contrast to maintaining a private cache for each thread, a parallel cache allows the...
Fast Parallel Permutation Algorithms (1995)
We investigate the problem of permuting n data items, each covering D global memory cells, on an EREW PRAM with n = log n processors and less than Dn additional storage. We present a family of...
Fast Parallel Permutation Algorithms (1995)
We investigate the problem of permuting n data items on an EREW PRAM with p processors using little additional storage. We present a simple algorithm with run time O((n=p) log n) and an improved...
Hashing and Rehashing in Emulated Shared Memory (1992)
The PRAM model is widely used to formulate parallel algorithms because of its shared memory and its synchronous behaviour. The model however bears little resemblance to real parallel machines. This...
Optimal sorting in linear arrays with minimum global control (1992)
F. Abolhassan, J. Keller, D. Scheerer, Ferri Abolhassan, Jorg Keller, Dieter Scheerer
We investigate linear sorting arrays with a single global control wire. We show that the lower bound on the necessary time to sort n numbers in such an array is 2n, in contrast to 3n in arrays...