 |
|
 | |
 | |
| |||||
| ||||||||||||
Parallele/Verteilte Verfahren und Architekturen |
Veröffentlichungen |
Zeitschriften |
S. Lange, M. Middendorf:
Hyperreconfigurable Architectures and the Partition into
Hypercontexts Problem
Journal of Parallel and Distributed Computing, 65(6): 743-754, 2005.
S. Lange, M. Middendorf:
Multi Task Hyperreconfigurable Architectures: Models and Reconfiguration Problems
Accepted for International Journal of Embedded Systems.
D. Merkle, M. Middendorf, A. Scheidler:
Decentralized Packet Clustering
in Router-based Networks
Accepted for International Journal of
Foundations of Computer Science
Preliminary version in: Proc. International Parallel and Distributed Processing Symposium (IPDPS-2004), Sixth International Workshop on
Nature Inspired Distributed Computing (NIDISC'04), IEEE-CS Press, Santa Fe, 9 pp., 2004.
S. Janson, D. Merkle, M. Middendorf, H. ElGindy, H. Schmeck:
On Enforced Convergence of ACO and its Implementation on the Reconfigurable Mesh Architecture Using Size Reduction Tasks
Journal of Supercomputing, 26(3): 221-238, 2003.
Preliminary version in: Proceedings of the Second International Conference
on Engineering of Reconfigurable Systems and Algorithms (ERSA'02), Las Vegas, CSREA Press, 2002, 3-9.
M. Middendorf, B. Scheuermann, H. Schmeck, H. ElGindy:
An Evolutionary Approach to Dynamic Task Scheduling on
FPGAs
Journal of Parallel and Distributed Computing,
62(9): 1407-1420, September 2002.
Preliminary version in:
R.W. Hartenstein, H. Grünbacher (Eds.), Field Programmable Logic and
Applications, 10th International Conference FPL 2000, Villach,
Austria, August 28-30, 2000, Springer Verlag, LNCS 1896 (2000)
379-388.
D. Merkle and M. Middendorf:
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Genetic Programming and Evolvable Machines, 3(4): 345-361, 2002.
Preliminary version in: Proceedings of the 8th Reconfigurable Architectures Workshop 2001 (RAW 2001), San Francisco,
2001.
M. Middendorf and V. Timkovsky:
On scheduling cycle shops: classification, complexity and approximation
Journal of Scheduling, 5(2): 135-169, 2002.
M. Middendorf, F. Reischle, and H. Schmeck:
Multi Colony Ant Algorithms
Journal of Heuristics (special issue on Parallel Metaheuristics), 8(3): 305-320, 2002.
O. Diessel, H. ElGindy, M. Middendorf, B. Schmidt, and H. Schmeck:
Dynamic scheduling of tasks on partially reconfigurable FPGAs
IEE - Proceedings - Computer and Digital Techniques (Special Issue on Reconfigurable Systems), 147(3) (2000) 181-188.
M. Middendorf, H. Schmeck, H. Schröder, and G. Turner:
Multiplication of matrices with different sparseness properties on dynamically reconfigurable meshes
VLSI Design 9 (1999) 69-81.
M. Middendorf, W. Löwe, and W. Zimmermann:
Scheduling inverse trees under the commuication model of the LogP-machine
Theoretical Computer Science 215 (1999) 137-168
M. Middendorf and H. ElGindy:
Matrix Multiplication on processor arrays with optical buses
Informatica 22 (1998) 255-262 (Special Issue on Computing on Bus-Based Architectures).
M. Middendorf:
Shortest common superstrings and scheduling with coordinated starting times
Theoret. Comp. Sci. 191 (1998) 205-214.
M. Middendorf:
Manhattan Channel Routing is NP-complete under truly restricted settings
Chicago Jounal of Theoretical Computer Science 2 (1996) 1-19.
M. Middendorf, H. Schmeck, and G. Turner:
Sparse matrix multiplication on a reconfigurable mesh
The Australian Computer Journal 27 (1995) 37-40.
H. Schmeck, H. Schröder, J. Straunstrup, and M. Middendorf:
Problem Heaps and their Evaluation
Parallel Processing Letters 3 (1993) 147-155.
Buchbeiträge |
E. Petzold, A. von Haeseler, D. Merkle, M. Middendorf, and H.A. Schmidt:
Phylogenetic Parameter
Estimation on COWs
in A. Zomaya (Ed.), Parallel Computing in Bioinformatics and Computational
Biology, Wiley, to appear
S. Janson, D. Merkle, M. Middendorf:
Parallel Ant Algorithms
in E. Alba (Ed.), Parallel Metaheuristics, Wiley Book Series on Parallel and Distributed
Computing, to appear
Konferenzbeiträge |
S. Lange, M. Middendorf:
The Partition into Hypercontexts Problem for Hyperreconfigurable Architectures
Accepted for The International Conference on Field Programmable Logic and Applications (FPL 2004),
Antwerp, Belgium, 2004
B. Scheuermann, M. Guntsch, M. Middendorf, H. Schmeck:
Time-Scattered Heuristic Guidance
for a Hardware Implementation of ACO
Accepted for Fourth International Workshop
ANTS 2004, Brussels, Belgium, 2004
S. Lange, M. Middendorf:
Hyperreconfigurable Architectures for Fast Runtime Reconfiguration
Accepted for 2004 IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM´04),
Napa Valley, USA, 2004
S. Lange, M. Middendorf:
Hyperreconfigurable Architectures as Flexible Control Systems
ARCS 2004 Workshop "Dynamically Reconfigurable Systems",
Lecture Notes in Informatics, Vol. P-41, 175-184, 2004.
S. Lange, M. Middendorf:
Models and Reconfiguration Problems for Multi Task Hyperreconfigurable Architectures
Proc. International Parallel and Distributed Processing Symposium (IPDPS-2004), Reconfigurable Architectures
Workshop (RAW-2004), IEEE-CS Press, 8 pp., 2004.
S. Janson, D. Merkle, M. Middendorf, H. ElGindy, H. Schmeck:
On Enforced Convergence of ACO and its Implementation on the Reconfigurable Mesh Architecture Using Size Reduction Tasks
Proceedings of the Second International
Conference on Engineering of Reconfigurable Systems and Algorithms
(ERSA'02), Las Vegas, CSREA Press, 2002, 3-9.
M. Middendorf and V. Timkovsky:
On Scheduling Cycle Shops
In: Extended Abstracts of 7th International Workshop on Project Management and Scheduling, Osnabrück, April 2000,
Faculty of Mathematics, (2000) 214-216.
M. Middendorf:
Bit-summation on the reconfigurable mesh
In: J. Rolim et al. (Eds.) Parallel and Distributed Computing, Proceedings of the 11 IPPS/SPDP`99 Workshops, 6th
Reconfigurable Architectures Workshop RAW-99, Springer Verlag, LNCS 1586 (1999) 625-633.
W. Zimmermann, M. Middendorf, and W. Löwe;
On optimal k-linear scheduling of tree-like task graphs for LogP-machines
In: D. Pritchard, J. Reeve (Eds.), Euro-Par"98 Parallel Processing, Springer Verlag, LNCS 1470 (1998) 328-336.
C. Steckel, M. Middendorf, H. ElGindy, and H. Schmeck:
A simulator for the reconfigurable mesh architecture
In: J. Rolim (Ed.) Parallel and Distributed Computing, Proceedings of the 10 IPPS/SPDP`98 Workshops, 5th Reconfigurable
Architectures Workshop RAW-98, Springer Verlag, LNCS 1388 (1998) 99-104.
M. Middendorf and H. Schmeck:
A local and dynamic algorithm for reconfiguring a faulty processor array into a maximal fault-free subarray
In: N. Sharda, A. Tam (Eds.), Proceedings of the 4th Australasian Conference on Parallel and Real-Time Systems (PART '97),
Springer Verlag, Singapore (1997) 191-201.
N. Kuck, M. Middendorf, and H. Schmeck:
Generic branch-and-bound on a network of transputers
In: R. Grebe, J. Hector, S.C. Hilton, M.R. Jane, P.H. Welch (Eds.), Transputer Applications and Systems `93, IOS Press (1993)
306-314.
Diplomarbeiten |
Ekkard Petzold:
Parallelized Parameter Estimation for Molecular Phylogenetics
Co-Betreuer Prof. von Haeseler (Bioinformatik, Uni Düsseldorf)
18.6.2003
Stefan Janson:
A Reconfigurable mesh Algorithm Utilizing Local Convergence of Ant Colony Optimization.
29.5.2002
Frank Reischle:(Aixonix GmbH, Aachen)
Parallelisierung von Ameisenalgorithmen
17.8.1999
Carsten Steckel:
A Simulator for Reconfigurable Meshes.
8.8.1999
Bernd Schmidt:
FPGA Task Arrangement with Genetic Algorithms (Plazierung von Tasks auf FPGAs mit Genetischen Algorithmen).
31.7.1999
Frederik Ramm:
Ein transparentes Client-/Server-Informationssytem mit flexibler Serverplazierung am Beispiel der Fahrplanauskunft "HAFAS" (mit Fa. HaCon, Hannover).
15.5.1998
Christoph Schlenker:
Entwicklung eines Werkzeugs zur Optimierung von Nachbarschaftsstrukturen in Spielerpopulationen.
15.10.1997
Kerstin Karle:
Skelettberechnungen auf befehlssystolischen und rekonfigurierbaren Prozessorfeldern.
17.4.1997
Marc Fleischmann:(Pixelworks, Oregon)
Design and Inplementation of a Distributed Shared Memory for the HP-UX Kernel (mit Hewlett-Packard Laboratories, Palo Alto,
USA).
18.10.1995
Edmund Krieg:
Algorithmen für Matrixoperationen auf Prozessorfeldern mit rekonfigurierbaren Bussen.
17.7.1995
Frank Mühlenkamp:
Entwurf und Analyse von Algorithmen zur Rekonfiguration eines fehlertoleranten Prozessorfeldes.
1.2.1994
Norbert Kuck:
Generisches Branch-and-Bound auf einem Transputer-Netzwerk.
8.6.1993