Abstract

The physical design of a computer requires the placement of logic packages which must be interconnected to form a backplane. In this paper' the placement problem is explored and a survey of algorithms is presented for the attack of it and the associated quadratic assignment problem. Also presented are known experimental results of the algorithms defined, conclusions and areas for future research. Although the problem of placement of modules has been emphasized, the techniques are useful for handling the general problem of finding optimal locations for a set of objects that must be interconnected.

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 call

Disclaimer: 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.