Abstract
A systolic algorithm for solving the 0/1-knapsack problems with n items is presented. The computational model used is a tree structure which consists of 2" identical processing elements (PEs). Each PE executes the same program at any time step. The time complexity varies from n to 3n — 2 steps which includes all the input/output data communication time. The design process and the correctness verification of this algorithm are considered in detail.
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.
