Abstract
In this paper we present an efficient way to implement the Boltzmann machine for solving combinatorial optimization problems on a distributed-memory multiprocessor (DMM), especially on a network of transputers. In this scheme, the neurons in a Boltzmann machine are partitioned into p disjoint sets and mapped onto each processor, where p is the number of processors in a DMM. Some experimental speedups together with analyses are also presented to demonstrate the usefulness of our parallelizing and implementation schemes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
