The partitioning problem on VLSI arrays: I/O and local memory complexity

The space/time costs of implementing the nonlocal communication of partitioned algorithms are studied. In addition, the author looks at the often-neglected issue of I/O complexity for partitioned algorithms. He illustrates the design method and tradeoffs with an example in DSP, the fixed-point multi...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Burleson, W.P.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Computer architecture Costs Digital signal processing Partitioning algorithms Processor scheduling Signal design Signal mapping Signal processing algorithms Vectors Very large scale integration
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!