Abstract
A network of transputers, consisting of one master transputer and a number of slave transputers whose topology can be flexibly configured, is described in this paper. On this system, a linear speedup can be achieved for solving Linear Programming problems using the simplex algorithm, in case the number of variables and constraints of a problem to be solved is much greater than the number of transputers in the network. Some performance simulation figures for solving mid-sized linear programming problems show that an efficiency of around 85% can be obtained. Further research includes mapping of some well-known and successful algorithms to the multiprocessor system, extending application areas and improving the system hardware.
Sign-in/Register to access full text options 
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.
