Investigation of neural networks for the scheduling and allocation problem in high-level synthesis
| dc.contributor.advisor | Carothers, Jo Dale | en_US |
| dc.contributor.author | Glassen, David Wayne | |
| dc.creator | Glassen, David Wayne | en_US |
| dc.date.accessioned | 2013-04-03T13:19:57Z | |
| dc.date.available | 2013-04-03T13:19:57Z | |
| dc.date.issued | 1993 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10150/278303 | |
| dc.description.abstract | In recent years neural network have been shown to be quite effective in solving difficult combinatorial optimization problems. In this work a Hopfield neural network is used to schedule operations in a dataflow graph. This is an important step in behavioral synthesis systems. These operations must be assigned to a limited number of control steps, functional units, and busses. Also, there is an objective to minimize the lengths of data paths. Current methods which do this type of scheduling typically rely on heuristic algorithms. The neural network devised to solve this problem is one of the most complex to date. A special mechanism, "flag" neurons, was developed to enable the neural network to encode a bussing constraint. The neural network has been tested with problems from literature and problems randomly generated. The results have been consistently superior to those produced by a heuristic algorithm called ALAP. | |
| dc.language.iso | en_US | en_US |
| dc.publisher | The University of Arizona. | en_US |
| dc.rights | Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author. | en_US |
| dc.subject | Engineering, Electronics and Electrical. | en_US |
| dc.subject | Artificial Intelligence. | en_US |
| dc.title | Investigation of neural networks for the scheduling and allocation problem in high-level synthesis | en_US |
| dc.type | text | en_US |
| dc.type | Thesis-Reproduction (electronic) | en_US |
| thesis.degree.grantor | University of Arizona | en_US |
| thesis.degree.level | masters | en_US |
| dc.identifier.proquest | 1352364 | en_US |
| thesis.degree.discipline | Graduate College | en_US |
| thesis.degree.name | M.S. | en_US |
| dc.identifier.bibrecord | .b27051791 | en_US |
| refterms.dateFOA | 2018-06-23T07:48:39Z | |
| html.description.abstract | In recent years neural network have been shown to be quite effective in solving difficult combinatorial optimization problems. In this work a Hopfield neural network is used to schedule operations in a dataflow graph. This is an important step in behavioral synthesis systems. These operations must be assigned to a limited number of control steps, functional units, and busses. Also, there is an objective to minimize the lengths of data paths. Current methods which do this type of scheduling typically rely on heuristic algorithms. The neural network devised to solve this problem is one of the most complex to date. A special mechanism, "flag" neurons, was developed to enable the neural network to encode a bussing constraint. The neural network has been tested with problems from literature and problems randomly generated. The results have been consistently superior to those produced by a heuristic algorithm called ALAP. |
