Abstract
In the synthesis of hardware structures different design steps are solved by combinatorial optimization techniques. For one optimization step a scheduled flow graph is examined and it is determined, if operations can be assigned to the same professor. The search for a minimum number of processors is equivalent to the search for a minimum coloring of the corresponding incompatibility graph. For the general case and some special cases the graph classes of these incompatibility graphs are determined and for each class an optimal algorithm or an approximate heuristic is given.
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.
