Pico: An Object-Oriented Framework for Parallel Branch and Bound

作者: Jonathan Eckstein , Cynthia A. Phillips , William E. Hart

DOI: 10.1016/S1570-579X(01)80014-8

关键词:

摘要: This paper describes the design of PICO, a C++ framework for implementing general parallel branch-and-bound algorithms. The PICO provides mechanism efficient implementation wide range methods on an equally computing platforms. We first discuss basic architecture including application class hierarchy and package's serial layers. next describe layer, its central notion manipulating subproblem states. Then, we which includes flexible processor clustering levels communication rates, various load balancing mechanisms, non-preemptive task scheduler running each processor. close by describing package to simple method mixed integer programming, along with computational results ASCI Red massively computer.

参考文章(32)
Jeffrey Todd Linderoth, Martin W. Savelsberg, Topics in parallel integer optimization Georgia Institute of Technology. ,(1998)
M.W.P. Savelsbergh, R.E. Bixby, S. Ceria, C.M. McZeal, An Updated Mixed Integer Programming Library: MIPLIB 3.0 ,(1998)
George Karypis, Ananth Grama, Vipin Kumar, Anshul Gupta, Introduction to parallel computing: design and analysis of algorithms Benjamin-Cummings Publishing Co., Inc.. ,(1994)
Carl A Waldspurger, William E Weihl, Stride Scheduling: Deterministic Proportional- Share Resource Management Massachusetts Institute of Technology. ,(1995)
Mohamed Benaïchouche, Van-Dat Cung, Salah Dowaji, Bertrand Le Cun, Thierry Mautor, Catherine Roucairol, Building a parallel branch and bound library Solving Combinatorial Optimization Problems in Parallel - Methods and Techniques. pp. 201- 231 ,(1996) , 10.1007/BFB0027123
Al Geist, Adam Beguelin, Jack Dongarra, Weicheng Jiang, Robert Manchek, Vaidy Sunderam, Mark Novotny, Susan McKay, Wolfgang Christian, PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing Computers in Physics. ,vol. 9, pp. 607- 607 ,(1995) , 10.1063/1.4823450
E.M.L. Beale, Branch and Bound Methods for Mathematical Programming Systems Annals of discrete mathematics. ,vol. 5, pp. 201- 219 ,(1979) , 10.1016/S0167-5060(08)70351-0
Jonathan Eckstein, Distributed versus Centralized Storage and Control forParallel Branch and Bound: Mixed Integer Programming on the CM-5 Computational Optimization and Applications. ,vol. 7, pp. 199- 220 ,(1997) , 10.1023/A:1008699010646