21 March 1989 Parallaxis: A Flexible Parallel Programming Environment For AI Applications
Author Affiliations +
Abstract
A parallel language has to match or reflect the hardware underneath to use these resources efficiently. Though every parallel language has to have some kind of parallel machine model, no existing language states this explicitly. The Parallaxis parallel programming environment introduces a different approach. The system comprises the specification of the parallel algorithm and the parallel hardware as well. Parallaxis has been designed for single instruction, multiple data (SIMD) system architectures, consisting of identical processing elements (PEs) with local memory. Data exchange is handled by message passing through a local network. In Parallaxis, the hardware structure is specified in the beginning of each program to establish the environment for coding the parallel algorithm. This is necessary for actually arranging this topology using a reconfigurable system, but it is also profitable for performing a simulation, or just stating the used topology. Parallelizable AI applications that demonstrate Parallaxis' usefulness include computer vision, productions systems, neural networks and robot control.
© (1989) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Thomas Braunl, "Parallaxis: A Flexible Parallel Programming Environment For AI Applications", Proc. SPIE 1095, Applications of Artificial Intelligence VII, (21 March 1989); doi: 10.1117/12.969278; https://doi.org/10.1117/12.969278
PROCEEDINGS
11 PAGES


SHARE
RELATED CONTENT

Use of dynamical networks for pattern recognition
Proceedings of SPIE (March 01 1992)
Knowledge-based system using a neural network
Proceedings of SPIE (March 01 1991)
Evolving neural network pattern classifiers
Proceedings of SPIE (October 29 1993)
Evolutionary algorithms for training neural networks
Proceedings of SPIE (May 20 2006)

Back to Top