Self-organization and associative memory: 3rd edition
Self-organization and associative memory: 3rd edition
A new synthesis for the MIMOLA software system
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
MAHA: a program for datapath synthesis
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
VLSI and Modern Signal Processing
VLSI and Modern Signal Processing
High-level synthesis of digital circuits using global scheduling and binding algorithms
High-level synthesis of digital circuits using global scheduling and binding algorithms
Algorithms for hardware allocation in data path synthesis
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hardware/software partitioning and minimizing memory interface traffic
EURO-DAC '94 Proceedings of the conference on European design automation
| Hi-index | 0.00 |
Scheduling is a crucial task in behavioural synthesis and a NP-hard optimisation problem. Neural net computation paradigms bring potential for efficient solutions to such problems. This paper presents a new scheduling algorithm based on Kohonen's rule for self organisation. The algorithm has an inherent hill climbing mechanism, copes with a comprehensive set of constraints and can be implemented on massively parallel structures. Its performance on well known benchmark examples, presented in the paper, is on par with the best reported.