Title :
Optimal data allocation for processor-tree architectures
Author :
Ancona, Fabio ; Zunino, Rodolfo
Author_Institution :
Genoa Univ., Italy
Abstract :
The paper describes a slice-based data-allocation strategy for tree-based topologies. The approach is supported by a theoretical analysis demonstrating the optimality of the data-distribution procedure. According to its basic principle of operation, data is split in such a way that at run time no processor ever stands idle. The benefits of this approach are quite important in several practical applications, including high-dimensional data processing and neural network modeling. Experimental results obtained from a noise-like coding model of associative memory confirm the validity of the overall approach.
Keywords :
content-addressable storage; parallel architectures; processor scheduling; resource allocation; synchronisation; associative memory; data-distribution procedure; high-dimensional data processing; neural network modeling; noise-like coding model; optimal data allocation; processor-tree architectures; slice-based data-allocation strategy; theoretical analysis; Associative memory; Bandwidth; Computer architecture; Data processing; Hardware; Image coding; Image processing; Machinery; Network topology; Neural networks;
Conference_Titel :
EUROMICRO 97. New Frontiers of Information Technology., Proceedings of the 23rd EUROMICRO Conference
Conference_Location :
Budapest, Hungary
Print_ISBN :
0-8186-8129-2
DOI :
10.1109/EURMIC.1997.617312
