DocumentCode :
3249096
Title :
Parallel implementations of a branch-and-bound algorithm for the optimization of distributed database computer networks
Author :
Pennnington, R.J. ; Bosworth, K. ; Wheeler, P. ; Stiles, G.S. ; Raghuram, A.
Author_Institution :
Utah State Univ., Logan, UT, USA
fYear :
1988
fDate :
21-23 March 1988
Firstpage :
240
Lastpage :
244
Abstract :
The arrival of parallel processing architectures has generated considerable interest in mapping conventional sequential jobs onto the new machines (multiprocessor arrays). The problem is in finding and exploiting the parallelism in a given task. The authors outline some important findings on a branch-and-bound algorithm and how it was modified to run on a multiprocessor network of Transputers.<>
Keywords :
computer networks; distributed databases; microprocessor chips; parallel algorithms; Transputers; branch-and-bound algorithm; distributed database computer networks; multiprocessor arrays; multiprocessor network; parallel processing; Computer architecture; Computer network management; Computer networks; Costs; Delay; Design optimization; Distributed databases; Parallel processing; Telecommunication traffic; Transaction databases;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
IEEE Region 5 Conference, 1988: 'Spanning the Peaks of Electrotechnology'
Conference_Location :
Colorado Springs, CO, USA
Type :
conf
DOI :
10.1109/REG5.1988.15939
Filename :
15939
Link To Document :
بازگشت