A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Distributed computing with hierarchical master-worker paradigm for parallel branch and bound algorithm
2003
CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.
Preserved Fulltext
This paper proposes a parallel branch and bound algorithm to solve the BMI Eigenvalue Problem with the hierarchical master-worker paradigm. ...
This paper discusses the impact of the hierarchical master-worker paradigm on performance of an application program, which solves an optimization problem by a parallel branch and bound algorithm on a distributed ...
Parallel branch and bound algorithms with the masterworker paradigm are addressed in [6, 10, 13] . ...
doi:10.1109/ccgrid.2003.1199364
dblp:conf/ccgrid/AidaNF03
fatcat:5sare443gzbgzghyxle2alqiv4
Page 1644 of Mathematical Reviews Vol. , Issue 94c
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Then the possible sources of par- allelism in branch-and-bound paradigms and the implications of running such algorithms in parallel are presented. ...
Branch-and-bound appears to be well suited for parallel processing because packets of work which could be exe- cuted independently on different processors are generated during a branch-and-bound algorithm ...
An application of parallel virtual machine framework to film production problem
2000
Computers and Mathematics with Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In our study, we incorporate the concepts of the branch-and-bound method, multiprocess programming, and shared memory to design a parallel branch-and-bound algorithm to cope with the problem of minimizing ...
We conduct a series of computational experiments to measure the effectiveness of our parallelization scheme. The results reveal that the speedup baaed upon our parallel algorithm is significant. ...
A PARALLEL BRANCH-AND-BOUND ALGORITHM IN THE MASTER-CONTROL-AGENT PARADIGM OF PVM The parallel branch-and-bound algorithms in the master-control-agent paradigm from PVM are proposed as follows. ...
doi:10.1016/s0898-1221(00)00129-2
fatcat:liolqj4cjndbplvvfv627jclly
Parallel Branch and Bound Algorithm with the Hierarchical Master-Worker Paradigm on the Grid
2006
IPSJ Digital Courier
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper proposes a parallel branch and bound algorithm that efficiently runs on the Grid. ...
The proposed algorithm is parallelized with the hierarchical master-worker paradigm in order to efficiently compute fine-grain tasks on the Grid. ...
Acknowledgments The authors would like to thank members of the Ninf project for their insightful comments. ...
doi:10.2197/ipsjdc.2.584
fatcat:2kqsjx34ivgb7b3eudpafl66fe
A Parallel Branch and Bound Algorithm for Solving Large Scale Integer Programming Problems
2014
Applied Mathematics & Information Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Branch and Bound technique is commonly used for intelligent search in finding a set of integer solutions within a space of interest. ...
While the master-worker paradigm is successfully used in many parallel applications as a common framework to implement parallel applications, it has drawbacks when a large number of computing resources ...
Section 4 describes the method of the proposed parallel branch and bound algorithm used. Section 5 discusses Solving Integer Programming Problem by the Proposed Parallel Branch and Bound Algorithm. ...
doi:10.12785/amis/080425
fatcat:4ojmn74t65esreibmb6rmaoihu
An implementation of a parallel generalized branch and bound template
2007
Mathematical Modelling and Analysis
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Branch and bound (BnB) is a general algorithm to solve optimization problems. We present a template implementation of the BnB paradigm. ...
A paradigm of domain decomposition (data parallelization) is used to construct a parallel algorithm. ...
Acknowledgment This work was supported by the Lithuanian State Science and Studies Foundation within the project on B-03/2007 "Global optimization of complex systems using high performance computing and ...
doi:10.3846/1392-6292.2007.12.277-289
fatcat:5pmlrxipffahzi6xcoeupymarq
Parallelization of the Branch-and-Bound Algorithm in Transportation Discrete Network Design
2016
Scientia Iranica. International Journal of Science and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
First, we show that the Branch-and-Bound (B&B) algorithm, proposed by LeBlanc, is well adapted to a parallel design with synchronized Master-Slave (MS) paradigm. ...
KEYWORDS Transportation discrete network design; Parallel computing; Parallel branch-andbound algorithm; Master-slave paradigm. Abstract. ...
Authors also gratefully thank two anonymous referees and the editorial o ce of Scientia Iranica for providing constructive comments on this paper. ...
doi:10.24200/sci.2016.2127
fatcat:tpg5ggv2bjaaljgswthsvruoba
Parallel algorithm design for workstation clusters
1991
Software, Practice & Experience
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
The paper describes a parallel programming paradigm called supervisor-worker, suitable for the workstation environment, which can be used to speed up the execution of a large class of existing sequential ...
The combined processing power of these clusters is rarely exploited owing to the lack of suitable parallel algorithms. ...
ACKNOWLEDGEMENT We would like to thank Kevin Twidle for his suggestion and subsequent development of the Mandelbrot example. ...
doi:10.1002/spe.4380210302
fatcat:nerayabkxjc7xguwaajvlossk4
Optimal Design of Multi-product Batch Plants Using a Parallel Branch-and-Bound Method
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We describe two parallelization strategies -for systems with shared-memory and distributed-memory -based on the branchand-bound paradigm and implement them using OpenMP (Open Multi-Processing) and MPI ...
In this paper we develop and implement a parallel algorithm for a real-world application: finding optimal designs for multi-product batch plants. ...
Acknowledgement This work was supported by the DAAD (German Academic Exchange Service) and by the Ministry of Education and Science of the Russian Federation under "Mikhail Lomonosov II"-Programme. ...
doi:10.1007/978-3-642-23178-0_36
fatcat:uoeqrsejafa3tbgxhezi7anhse
Parallel skeletons for divide-and-conquer and branch-and-bound techniques
2003
Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003. Proceedings.
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This article describes the parallel implementation of skeletons for the Divide-and-Conquer and Branch-and-Bound techniques. ...
The user has to choose a paradigm and has to specify for it the type of the problem, the type of the solution and the specific characteristics of the technique using the C ++ programming language. ...
HPRI-CT-1999-00026 (TRACS Program at EPCC-Edinburgh Parallel Computing Centre). We also would like to thank the CIEMAT for allowing us the access to their computers. ...
doi:10.1109/empdp.2003.1183602
dblp:conf/pdp/DortaLRR03
fatcat:whsa5mnarfg5hcxqq2sj4vfw4q
PARALLEL MPI-IMPLEMENTATION OF THE BRANCH-AND-BOUND ALGORITHM FOR OPTIMAL SELECTION OF PRODUCTION EQUIPMENT
Применение параллельной реализации алгоритма ветвей и границ с использованием MPI для оптимального выбора технологического оборудования
2016
Vestnik Tambovskogo gosudarstvennogo tehnicheskogo universiteta
Применение параллельной реализации алгоритма ветвей и границ с использованием MPI для оптимального выбора технологического оборудования
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Keywords: combinatorial optimization; master-worker paradigm; MPI; multiproduct batch plant; optimal equipment selection; parallel branch-and-bound. ...
We employ parallel branch-and-bound to accelerate a real-world example application: optimal selection of production equipment for multi-product batch plants. ...
Distributed-memory parallel branch-and-bound. ...
doi:10.17277/vestnik.2016.03.pp.350-357
fatcat:pfyytijijjc4fpvyco32ykah5u
Parallel branch-and-bound algorithm for constructing evolutionary trees from distance matrix
2005
Eighth International Conference on High-Performance Computing in Asia-Pacific Region (HPCASIA'05)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present an efficient parallel branch and bound algorithm to construct a minimum ultrametric tree with less cost. ...
The experimental results show that our proposed algorithm can discover optimal solutions for 38 species within reasonable time with 16 computing nodes. ...
The parallel branch-and-bound algorithm in the master-slave paradigm is presented as follows.
Table 1 Parallel Branch-and-Bound with 3-3 Relationship Input: An n x n distance matrix M. ...
doi:10.1109/hpcasia.2005.65
fatcat:adexj3gjx5ak5e4msrtvkawgl4
A hierarchical distributed-shared memory parallel Branch&Bound application with PVM and OpenMP for multiprocessor clusters
2005
Parallel Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We described how both the shared memory and the distributed memory programming models can be applied to implement the same algorithm for the inter-nodes and intra-node parallelization. ...
In this paper we show how the combined use of PVM and OpenMP libraries can be a promising approach to exploit the intrinsic parallel nature of this class of application and to obtain efficient code for ...
Russo, Paradigms for the parallelization of Branch&Bound algorithms, PARA, 1995. [2] D.E. Culler, J.P. Singh, A. ...
doi:10.1016/j.parco.2005.03.010
fatcat:pvit4elsqfebdlsihxitvy44q4
Solving large quadratic assignment problems on computational grids
2002
Mathematical programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this article we describe a novel approach to solve QAPs using a state-of-the-art branch-and-bound algorithm running on a federation of geographically distributed resources known as a computational grid ...
Quadratic assignment problem -branch and bound -computational grid -metacomputing ...
We are foremost very grateful to Steve Wright of Argonne National Lab and Miron Livny of the University of Wisconsin for their support of this research, under the auspices of the metaNEOS project. ...
doi:10.1007/s101070100255
fatcat:3qslwu7uvza4blt2pug3a7i25y
Load Balancing Strategies to Solve Flowshop Scheduling on Parallel Computing
[article]
2008
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This paper first presents a parallel solution for the Flowshop Scheduling Problem in parallel environment, and then proposes a novel load balancing strategy. ...
We also show that the combination of both the Proportional Fairness Strategy and the proposed data transferring strategy achieves additional 13~15% improvement in efficiency of parallelism. ...
The paradigms used in parallel branch and bound algorithm have been proposed in many literatures, like [2] [4] . ...
arXiv:0809.3285v1
fatcat:k6fsinzo6ngqpbgskduacnf3ti
« Previous
Showing results 1 — 15 out of 30,022 results