DocumentCode
1153401
Title
Data Exchange Optimization in Reconfigurable
Author
Trees ; Kartashev ; Kartashev
Author_Institution
Dynamic Computer Architecture Incorporated
Issue
3
fYear
1986
fDate
3/1/1986 12:00:00 AM
Firstpage
257
Lastpage
273
Abstract
The objective of this paper is to develop fast techniques of data exchange optimization with the use of reconfigurable binary trees.
Keywords
Fast performance reconfigurable tree databases; path duration; path´s concurrency; performance optimization; reconfigurable binary tree; upper bound of process complexity; Binary trees; Computer networks; Concurrent computing; Databases; Multiprocessor interconnection networks; Neodymium; Optimization; Timing; Tree data structures; Upper bound; Fast performance reconfigurable tree databases; path duration; path´s concurrency; performance optimization; reconfigurable binary tree; upper bound of process complexity;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1986.1676749
Filename
1676749
Link To Document