DocumentCode
2706824
Title
Interconnect optimisation for multiprocessor architectures
Author
Stok, L.
Author_Institution
Dept. of Electr. Eng., Eindhoven Univ. of Technol., Netherlands
fYear
1990
fDate
8-10 May 1990
Firstpage
461
Lastpage
465
Abstract
In the design of multiprocessor architecture for high-speed applications the number of busses and local interconnection links often becomes a bottleneck. The problem is solved here by determining only the number of processors and the number of register files in the early stages of the architectural synthesis. The actual assignment of operations to processors and of variables to register files is postponed to the interconnect allocation phase. The extra freedom can be used advantageously to reduce the number of interconnections. A simulated annealing algorithm is described which optimizes the interconnections in a register transfer design using this extra freedom provided by the architectural synthesis. Several benchmark results are shown to illustrate the reduction in interconnect
Keywords
minimisation of switching nets; multiprocessor interconnection networks; parallel architectures; simulated annealing; architectural synthesis; busses; high-speed applications; interconnect allocation phase; local interconnection links; multiprocessor architectures; register files; register transfer design; simulated annealing algorithm; Algorithm design and analysis; Design optimization; Flow graphs; Merging; Network synthesis; Processor scheduling; Registers; Simulated annealing; Telephony; Timing;
fLanguage
English
Publisher
ieee
Conference_Titel
CompEuro '90. Proceedings of the 1990 IEEE International Conference on Computer Systems and Software Engineering
Conference_Location
Tel-Aviv
Print_ISBN
0-8186-2041-2
Type
conf
DOI
10.1109/CMPEUR.1990.113658
Filename
113658
Link To Document