Geodesic
Investigation of algorithms for parallel computations in knapsack-type discrete optimization problems
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 45 (2005) no. 10, pp. 1801-1809 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Efficient parallel implementation of the branch-and-bound method in discrete optimization problems is considered. A description of particular algorithms and of their implementation is given. Based on experimental data, conclusions concerning the efficiency of those algorithms are drawn and factors affecting their performance are investigated. 
@article{ZVMMF_2005_45_10_a4,
     author = {M. A. Posypkin and I. Kh. Sigal},
     title = {Investigation of algorithms for parallel computations in knapsack-type discrete optimization problems},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1801--1809},
     year = {2005},
     volume = {45},
     number = {10},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2005_45_10_a4/}
}
TY  - JOUR
AU  - M. A. Posypkin
AU  - I. Kh. Sigal
TI  - Investigation of algorithms for parallel computations in knapsack-type discrete optimization problems
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2005
SP  - 1801
EP  - 1809
VL  - 45
IS  - 10
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2005_45_10_a4/
LA  - ru
ID  - ZVMMF_2005_45_10_a4
ER  - 
%0 Journal Article
%A M. A. Posypkin
%A I. Kh. Sigal
%T Investigation of algorithms for parallel computations in knapsack-type discrete optimization problems
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2005
%P 1801-1809
%V 45
%N 10
%U http://geodesic.mathdoc.fr/item/ZVMMF_2005_45_10_a4/
%G ru
%F ZVMMF_2005_45_10_a4
M. A. Posypkin; I. Kh. Sigal. Investigation of algorithms for parallel computations in knapsack-type discrete optimization problems. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 45 (2005) no. 10, pp. 1801-1809. http://geodesic.mathdoc.fr/item/ZVMMF_2005_45_10_a4/

[1] Finkelshtein Yu. Yu., Priblizhennye metody i prikladnye zadachi diskretnogo programmirovaniya, Nauka, M., 1976

[2] Sigal I. Kh., Ivanova A. P., Vvedenie v prikladnoe diskretnoe programmirovanie, Fizmatlit, M., 2002

[3] Khachaturov V. R., Veselovskii V. E., Zlotov A. V. i dr., Kombinatornye metody i algoritmy resheniya zadach diskretnoi optimizatsii bolshoi razmernosti, Nauka, M.–SPb., 2000 | MR | Zbl

[4] Voevodin V. V., Voevodin Vl. V., Parallelnye vychisleniya, BKhV-Peterburg, 2002

[5] Timoshevskaya N. E., “Parallelnye metody obkhoda dereva”, Matem. modelirovanie, 16:4 (2004), 105–114 | MR | Zbl

[6] Robert R. D., Leiserson C. E., “Scheduling multithreaded computations by work stealing”, Proc. FOCS'94, 1994

[7] Rob R. V., Kielmann T., Bal H. E., “Efficient load balancing for wide-area divide-and-conquer applications”, Proc. PPOPP'01, 2001

[8] Aida K., Natsume W., Futakata Y., “Distributed computing with hierachical master-worker paradigm for parallel branch and bound algorithm”, CCGRID'03, Proc. 3rd IEEE/ACM Internat. Simp. Cluster Comput. and Grid, 2003

[9] I-Chen Wu, Kung H. T., “Communication complexity for parallel divide-and-conquer”, FOCS'91, Proc. $32^{\textrm{nd}}$ Ann. Symp. Foundations of Computer Sci. (San-Juan, Puerto Rico), 1991, 151–162 | MR

[10] Grama A., Gupta A., Karypis G., Kumar V., Introduction to parallel computing, Addison-Wesley, Harbou etc., 2003

[11] Aida K., Futakata Y., Hara S., “High-performance parallel and distributed computing for the BMI eigenvalue problem”, Proc. $16^{\textrm{th}}$ IEEE Parallel and Distributed Proc. Symp., 2002

[12] Shrivarti N. G., Krueger P., Singhal M., “Load distributing for locally distributed systems”, IEEE Comput., 25:12 (1992), 33–41

[13] Toporkov V. V., Problemy raspredelennykh vychislenii, Fizmatlit, M., 2004 | Zbl

[14] Snir M., Otto S., Huss-Lederman S. et al., MPI: The complete reference, MIT Press, Cambridge, MA, 1996

[15] http://www.jscc.ru

[16] Problemy vychislenii v raspredelennoi srede, Tr. ISA RAN, ROKhOS, M., 2004