We discuss communication algorithms relevant for neural network modeling on distributed memory concurrent computers with a hypercube topology. Full, intermediate (medium range) and sparse network connectivities are analyzed. We point out that the ...

We discuss optimal communication and decomposition algorithms for a class of regular problems on concurrent computers with a hypercube topology, using a general technique we call the method of cube geodesics.

We address the calculation of various ...

We have developed a mechanism for reducing the communication costs (total communication time) of a class of parallel real time simulation algorithms for execution on a hypercube parallel processing computer. The mechanism involves bundling together ...

This paper describes how Crystal—a language based on familiar mathematical notation and the lambda calculus—addresses the issues of programmability and performance for parallel machines. What is new about Crystal (or how it is different from existing ...

This paper addresses the issue of fault tolerance in hypercube architectures. Most of the recently proposed schemes of fault tolerance in parallel architectures address mainly the issue of reconfiguration of a parallel architecture once a faulty ...

We introduce a string or world line formalism that provides a general description of time dependent complex systems. We show that it can be applied to mapping general problems onto both sequential and parallel computers. In principle it unifies the ...

Hopfield and Tank have introduced the use of neural networks for the solution of optimization problems such as the traveling salesman problem. Here we show how to generalize this method to decompose loosely synchronous problems onto parallel machines ...