loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
23rd EUROMICRO Conference '97 New Frontiers of Information Technology
Optimal data allocation for processor-tree architectures
Budapest, HUNGARY
September 01-September 04
ISBN: 0-8186-8129-2
ASCII Text
x 
 
F. Ancona, R. Zunino, "Optimal data allocation for processor-tree architectures," EUROMICRO Conference, pp. 351, 23rd EUROMICRO Conference '97 New Frontiers of Information Technology, 1997.
 
 
BibTex
x
 
@article{ 10.1109/EURMIC.1997.617312,
author = {F. Ancona and R. Zunino},
title = {Optimal data allocation for processor-tree architectures},
journal ={EUROMICRO Conference},
volume = {0},
year = {1997},
issn = {1089-6503},
pages = {351},
doi = {http://doi.ieeecomputersociety.org/10.1109/EURMIC.1997.617312},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - EUROMICRO Conference
TI - Optimal data allocation for processor-tree architectures
SN - 1089-6503
SP
EP
A1 - F. Ancona,
A1 - R. Zunino,
PY - 1997
KW - resource allocation; optimal data allocation; processor-tree architectures; slice-based data-allocation strategy; theoretical analysis; data-distribution procedure; high-dimensional data processing; neural network modeling; noise-like coding model; associative memory
VL - 0
JA - EUROMICRO Conference
ER -
 
F. Ancona, Genoa Univ., Italy
R. Zunino, Genoa Univ., Italy
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.
Index Terms:
resource allocation; optimal data allocation; processor-tree architectures; slice-based data-allocation strategy; theoretical analysis; data-distribution procedure; high-dimensional data processing; neural network modeling; noise-like coding model; associative memory
Citation:
F. Ancona, R. Zunino, "Optimal data allocation for processor-tree architectures," euromicro, pp.351, 23rd EUROMICRO Conference '97 New Frontiers of Information Technology, 1997
Usage of this product signifies your acceptance of the Terms of Use.