Implementation of the prodigy parallel AI machine and performance evaluation of communication
β Scribed by Noboru Tanabe; Sadao Nakamura; Takashi Suzuoka; Shigeru Oyanagi
- Publisher
- John Wiley and Sons
- Year
- 1992
- Tongue
- English
- Weight
- 935 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0882-1666
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
At present, the binary nβcube is considered to be interesting as an interconnection network for the highly parallel computers. Most of those networks, however, use the serial communication channel, which prevents the realization of satisfactory communication performance. From such a viewpoint, it is desired to construct an interconnection network with higher speed, higher versatility, and the easy implementation.
The authors have already proposed the baseβm nβcube as the interconnection network for the parallel AI machine Prodigy. This paper shows that the baseβm nβcube is better than the binary nβcube in versatility and easy implementation. Furthermore, the authors developed Prodigy which utilizes the forementioned excellent property to connect 512 processors by the 8βbit width full duplex baseβ8 3βcube with a handshake. Two kinds of gate arrays are used in the implementation. It is shown as a result that the interconnection network can be constructed with the highest speed in the presently known cubeβtype highly parallel computers. It is verified by an actual measurement that the transfer performance is deteriorated only slightly by the collision in the random communication.
π SIMILAR VOLUMES
## Abstract Various techniques that improve performance on SMP clusters have been studied. Most of them use special hardware and nonstandard protocols, tending to raise their total cost and to spoil flexibility. We propose the CPU\_NIC method, which improves parallel performance on smallβway SMP PC