Efficient Implementation of Branch-and-bound Method on Desktop Grids | Zendy

Tian Bo | Zendy; Mikhail Posypkin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Efficient Implementation of Branch-and-bound Method on Desktop Grids

Author(s) -

Tian Bo,

Mikhail Posypkin

Publication year - 2014

Publication title -

computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.145

H-Index - 5

eISSN - 2300-7036

pISSN - 1508-2806

DOI - 10.7494/csci.2014.15.3.239

Subject(s) - computer science , branch and bound , grid , traverse , middleware (distributed applications) , distributed computing , upper and lower bounds , tree (set theory) , parallel computing , theoretical computer science , operating system , algorithm , mathematics , mathematical analysis , geometry , geodesy , geography

The Berkeley Open Infrastructure for Network Computing (BOINC) is an opensource middleware system for volunteer and desktop grid computing. In this paper we propose BNBTEST, a BOINC version of distributed branch and bound method. The crucial issues of distributed branch-and-bound method are traversing the search tree and loading balance. We developed subtaskspackaging method and three dierent subtasks' distribution strategies to solve these

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research