Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

HPCC
2005
Springer

favoriteEmaildiscussreport

57views Distributed And Parallel Com...» more HPCC 2005»

Parallel Branch and Bound Algorithms on Internet Connected Workstations

13 years 10 months ago

Parallel Branch and Bound Algorithms on Internet Connected Workstations

Download folk.uib.no

By the use of the GRIBB software for distributed computing across the Internet, we are investigating the obstacles and the potential for eﬃcient parallelization of Branch and Bound algorithms. Experiments have been carried out using two diﬀerent applications, i.e. the Quadratic Assignment Problem (QAP) and the Traveling Salesman Problem (TSP). The results conﬁrm the potential of the approach, and underline the requirements of the problem, algorithm and architecture for the approach to be successful.

Randi Moe, Tor Sørevik

Real-time Traffic

Distributed Computing | HPCC 2005 | Quadratic Assignment Problem | Traveling Salesman Problem |

claim paper

Related Content

» Improving peer connectivity in widearea overlays of virtual workstations

» A Case Study in Running a Parallel Branch and Bound Application on the Grid

» P2P Streaming Capacity under Node Degree Bound

» A Powerful Direct Mechanism for Optimal WWW Content Replication

» Asynchronous resource discovery

» Efficient Distributed QoS Routing Protocol for MPLS Networks

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	HPCC
Authors	Randi Moe, Tor Sørevik

Comments (0)