Filters








41,828 Hits in 8.3 sec

A Simulation Tool for the Performance Evaluation of Parallel Branch and Bound Algorithms [chapter]

H. W. J. M. Trienekens
1988 Operations Research Proceedings  
Theoretical analysis of such a parallel branch and bound algorithm is very hard and empirical analysis is not straightforward because the performance of a parallel algorithm cannot be evaluated simply  ...  We will describe a way to simulate the execution of parallel branch and bound algorithms on arbitrary parallel systems in such a way that the memory and cpu requirements are very reasonable.  ...  Acknowledgment The authors would like to thank Hans Kraamer and Wim Pijls for being a stimulating first audience for these simulation plans.  ... 
doi:10.1007/978-3-642-73778-7_169 fatcat:ctbwbpj5jrcbxhf325sc6bdzqy

A simulation tool for the performance evaluation of parallel branch and bound algorithms

Arie de Bruin, Alexander H. G. Rinnooy Kan, Harry W. J. M. Trienekens
1988 Mathematical programming  
Theoretical analysis of such a parallel branch and bound algorithm is very hard and empirical analysis is not straightforward because the performance of a parallel algorithm cannot be evaluated simply  ...  We will describe a way to simulate the execution of parallel branch and bound algorithms on arbitrary parallel systems in such a way that the memory and cpu requirements are very reasonable.  ...  Acknowledgment The authors would like to thank Hans Kraamer and Wim Pijls for being a stimulating first audience for these simulation plans.  ... 
doi:10.1007/bf01589406 fatcat:ia4pq2qxt5dwpje7lffqqkgmni

A tool for simulating parallel branch-and-bound methods

Yana Golubeva, Yury Orlov, Mikhail Posypkin
2016 Open Engineering  
This paper presents a tool for simulating parallel Branchand-Bound method.  ...  The major difficulty in parallel B&B method is the need for dynamic load redistribution. Therefore design and study of load balancing algorithms is a separate and very important research topic.  ...  Conclusions The paper discussed the simulator of parallel Branch-and-Bound method that can be used for a deep study and comparison of load balancing algorithms.  ... 
doi:10.1515/eng-2016-0031 fatcat:vlrdrzsha5d57oez6svernz5xy

Tool for Simulating Branch and Bound Computations

Andrei Ignatov, Andrei Gorchakov
2020 Open Computer Science  
AbstractThe paper describes a simulator of parallel Branch and Bound (BnB) method.  ...  An algorithm of artificial tree generation is formulated according to this criterion. The process of simulator modeling is described, several computational experiments are conducted.  ...  Acknowledgement: Partially supported by Program 2 of Presidium of RAS "Mechanisms for ensuring fault tolerance in modern high-performance and highly reliable computing".  ... 
doi:10.1515/comp-2020-0115 fatcat:kpgl53xm2jezzmluhih67hfn44

Author index

2013 20th Annual International Conference on High Performance Computing  
Xavier A Branch-and-Bound algorithm using multiple GPU-based LP solvers Mills, Richard Large Scale Subsurface Simulator Mishra, Debadatta Share-o-meter: An empirical analysis of KSM based memory  ...  A Dynamic Schema to increase performance in Many-core Architectures through Percolation operations Palekar, Udatta Parallel Branch-and-Bound for Two-Stage Stochastic Integer Optimization Palwe,  ... 
doi:10.1109/hipc.2013.6799145 fatcat:jnmign7535ep5jvhn65xp4aqqe

Page 6489 of Mathematical Reviews Vol. , Issue 89K [page]

1989 Mathematical Reviews  
(NL-ROTT) A simulation tool for the performance evaluation of parallel branch and bound algorithms. Math. Programming 42 (1988), no. 2 (Ser. B), 245-271.  ...  Theoretical analy- sis of such a parallel branch and bound algorithm is very hard and empirical analysis is not straightforward because the performance of a parallel algorithm cannot be evaluated simply  ... 

HyP-DESPOT: A Hybrid Parallel Algorithm for Online Planning under Uncertainty

Panpan Cai, Yuanfu Luo, David Hsu, Wee Sun Lee
2018 Robotics: Science and Systems XIV  
State-of-the-art online search algorithms, such as DESPOT, have vastly improved the computational efficiency of planning under uncertainty and made it a valuable tool for robotics in practice.  ...  It performs parallel DESPOT tree search by simultaneously traversing multiple independent paths using multi-core CPUs and performs parallel Monte-Carlo simulations at the leaf nodes of the search tree  ...  ACKNOWLEDGMENT We thank the anonymous reviewers for their comments and suggestions that have helped to improve the paper.  ... 
doi:10.15607/rss.2018.xiv.004 dblp:conf/rss/CaiLHL18 fatcat:22zexxik2zcafegqbpdiqtjynq

A technology-independent methodology of placement generation for analog circuit

Wai-Chee Wong, P.C.H. Chan, Wai-On Law
1999 Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198)  
A novel optimization approach based on circuit partitioning, simulated annealing and branch-and-bound algorithm is proposed to solve the placement problem.  ...  The move set used to generate perturbations for annealing is capable of arriving at any topological placement. The branch-and-bound is modified to take circuit performance into consideration.  ...  Acknowledgment The first author is supported by Motorola postgraduate internship. The second author is supported by RGE Earmarked Grants HKUST 547/94E and HKUST 6025/97E.  ... 
doi:10.1109/aspdac.1999.759980 dblp:conf/aspdac/WongCL99 fatcat:7lsd22cimjbjppssjxjjfd3umi

HyP-DESPOT: A Hybrid Parallel Algorithm for Online Planning under Uncertainty [article]

Panpan Cai, Yuanfu Luo, David Hsu, Wee Sun Lee
2018 arXiv   pre-print
State-of-the-art online search algorithms, such as DESPOT, have vastly improved the computational efficiency of planning under uncertainty and made it a valuable tool for robotics in practice.  ...  It performs parallel DESPOT tree search by simultaneously traversing multiple independent paths using multi-core CPUs and performs parallel Monte-Carlo simulations at the leaf nodes of the search tree  ...  It then initializes the upper and lower bounds for the new nodes, by performing a large number of Monte Carlo simulations. 3) Backup: After creating the new nodes, the algorithm traverses the path all  ... 
arXiv:1802.06215v1 fatcat:iezz7mvkh5a65in42c4kwj2t24

Parallel Branch and Bound Algorithm for Product Testing Job Scheduling Problems using MapReduce

Yu Yu, Institute of Ocean Instruments and Metrology, Qilu University of Technology (Shandong Academy of Sciences), Qingdao, China
2020 International Journal of Machine Learning and Computing  
This algorithm is a novel job shop scheduling parallelization breadth-first branch and bound algorithm.  ...  Further, the branch and bound search algorithm of job shop scheduling problem is studied. The MR-WFBB algorithm based on cloud computing MapReduce computing model is proposed.  ...  CONFLICT OF INTEREST The authors declare no conflict of interest. AUTHOR CONTRIBUTIONS YuYu conducted the research, analyzed the data, wrote the paper and had approved the final version.  ... 
doi:10.18178/ijmlc.2020.10.2.934 fatcat:2zujcxi2angzrnidnjxpusrfbi

Code generation and analysis for the functional verification of micro processors

Anoosh Hosseini, Dimitrios Mavroidis, Pavlos Konas
1996 Proceedings of the 33rd annual conference on Design automation conference - DAC '96  
An environment combining the code generation tools with the analysis tools has been developed, and it has provided excellent functional coverage for several generations of high-performance microprocessors  ...  A collection of code generation tools which assist designers in the functional verification of high performance microprocessors is presented.  ...  Other parallel applications including chaotic algorithms and branch-and-bound algorithms are currently being ported. Incorporating a new application into the MPAV environment is simple.  ... 
doi:10.1145/240518.240574 dblp:conf/dac/HosseiniMK96 fatcat:io3q4c7t5fd6naewtvvccr5xni

Optimization Approaches For A Complex Dairy Farm Simulation Model

Jagannath Aryal, Don Kulasiri, Dishi Liu
2008 Zenodo  
This paper describes the optimization of a complex dairy farm simulation model using two quite different methods of optimization, the Genetic algorithm (GA) and the Lipschitz Branch-and-Bound (LBB) algorithm  ...  Each evaluation of the objective function, a composite 'Farm Performance Index (FPI)', requires simulation of at least a one-year period of farm operation with a daily time-step, and is therefore computationally  ...  A. Sherlock and Ms E. Post for their valuable advice in this project.  ... 
doi:10.5281/zenodo.1329346 fatcat:vk7w7toy2rf3xaeuquj2kjzjky

Performance Analysis of Sequence Alignment Applications

Friman Sanchez, Esther Salami, Alex Ramirez, Mateo Valero
2006 2006 IEEE International Symposium on Workload Characterization  
parallel implementations of the Smith-Waterman algorithm that use the Altivec SIMD extension to speed-up the performance.  ...  We have found that the memory subsystem is the component with more impact in the performance of the BLAST heuristic, the branch predictor is responsible for the major performance loss for FASTA and SSEARCH34  ...  For the parallel implementations of the SW algorithm, we were interested in the evaluation of the impact of SIMD alternatives on performance improvement.  ... 
doi:10.1109/iiswc.2006.302729 dblp:conf/iiswc/SanchezSRV06 fatcat:nanlgx7eivce7gvfnmrymqj6xy

Exploring the diversity of multimedia systems

Johnson Kin, Chunho Lee, W.H. Mangione-Smith, M. Potkonjak
2001 IEEE Transactions on Very Large Scale Integration (vlsi) Systems  
constraint, and the number of branch units and issue width.  ...  Following the tradition of the CAD community, we develop an accurate chip area estimate and a set of aggressive hardware optimization algorithms.  ...  The branch-and-bound algorithm consists of two major components: branching and evaluation.  ... 
doi:10.1109/92.929581 fatcat:iibo77aeazat3kuc7t32ghp5cm

A Comparative Evaluation of High-Level Hardware Synthesis Using Reed–Solomon Decoder

Abhinav Agarwal, Man Cheuk Ng, Arvind
2010 IEEE Embedded Systems Letters  
We present an implementation in Bluespec, a high-level HDL, and show a 7.8 improvement in performance while using only 0.45 area of a C-based implementation.  ...  Due to the presence of run-time dependencies, sometimes it is not clear how the C code can be restructured so that a synthesis tool can infer the desired hardware structure.  ...  ACKNOWLEDGMENT The authors are thankful to J. Hicks and G. Raghavan at Nokia for their assistance.  ... 
doi:10.1109/les.2010.2055231 fatcat:riaqukwobjgzjoccfe4c7wqwqi
« Previous Showing results 1 — 15 out of 41,828 results