The DATIS-P parallel machine

Summarizes results of a project which was conducted over the last 3 years at the University of Saarbrucken. Goal of the project was to construct a fault tolerant parallel machine for scientific applications and for running APL programs. The machine is supposed to tolerate failures of single slave processors, single disks and single routing chips in the interconnection network. After failure the machine reconfigures itself and continues work at the original speed.<<ETX>>

[1]  Leslie G. Valiant,et al.  A fast parallel algorithm for routing in permutation networks , 1981, IEEE Transactions on Computers.

[2]  J. Sauermann.  APL on the DATIS-P Parrallel Machine , 1990, Proceedings of the Fifth Distributed Memory Computing Conference, 1990..

[3]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[4]  Abraham Waksman,et al.  A Permutation Network , 1968, JACM.

[5]  C. Thomborson,et al.  Area-time complexity for VLSI , 1979, STOC.

[6]  Wolfgang J. Paul,et al.  A special purpose parallel computer for molecular dynamics: motivation, design, implementation, and application , 1987 .

[7]  Wolfgang K. Giloi.  SUPRENUM: A trendsetter in modern supercomputer development , 1988, Parallel Comput..

[8]  Bjarne Stroustrup,et al.  C++ Programming Language , 1986, IEEE Softw..

[9]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[10]  Jügen Sauermann.  A parallel APL machine , 1990 .

[11]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[12]  Silvia M. Müller,et al.  A method to parallelize tridiagonal solvers , 1991, Parallel Comput..

[13]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[14]  Zvi Weiss,et al.  An Empirical Study of APL Programs , 1977, Comput. Lang..