Efficient Implementation of Branch-and-Bound Method on Desktop Grids
نویسندگان
چکیده
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 the distributed branch-andbound method. The crucial issues of the distributed branch-and-bound method are traversing the search tree and loading the balance. We developed a subtask packaging method and three different subtask distribution strategies to solve these.
منابع مشابه
Optimizing the number of multigrid cycles in the full multigrid algorithm
Multigrid methods are among the most efficient and widespread methods for solving large linear systems of equations that arise, for example, from the discretization of partial differential equations. In this paper we introduce a new approach for optimizing the computational cost of the full multigrid method to achieve a given accuracy by determining the number of multigrid cycles on each level....
متن کاملE2DR: Energy Efficient Data Replication in Data Grid
Abstract— Data grids are an important branch of gird computing which provide mechanisms for the management of large volumes of distributed data. Energy efficiency has recently emerged as a hot topic in large distributed systems. The development of computing systems is traditionally focused on performance improvements driven by the demand of client's applications in scientific and business domai...
متن کاملA Branch and Bound Method for Finding Flow Path Designing of Agv Systems (RESEARCH NOTE)
One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...
متن کاملMW: A Software Framework for Combinatorial Optimization on Computational Grids
Branch and bound is the backbone of many algorithms for solving combinatorial optimization problems, dating at least as far back as the work of Little, Murty, Sweeney, and Karel in solving the traveling salesman problem [18]. Branch and bound and similar tree-search techniques have been implemented on a variety of parallel computing platforms dating back to the advent of multiprocessor machines...
متن کاملA Self-Organising Federation of Alchemi Desktop Grids
Desktop grids presents a next generation platform for aggregating the idle processing cycles of desktop computers. However, in order to efficiently harness the power of millions of desktop computers, the systems or middlewares that can support high level of efficiency, scalability, robustness and manageability are required. In this paper, we propose a scalable and self-organising desktop grid s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Science (AGH)
دوره 15 شماره
صفحات -
تاریخ انتشار 2014