Parallel algorithms for combinatorial search problems:
Abstract: "This thesis is a theoretical study of parallel algorithms for combinatorial search problems. In this thesis we present parallel algorithms for backtrack search, branch-and-bound computation and game-tree search. Our model of parallel computation is a network of processors communicati...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berkeley, Calif.
1989
|
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This thesis is a theoretical study of parallel algorithms for combinatorial search problems. In this thesis we present parallel algorithms for backtrack search, branch-and-bound computation and game-tree search. Our model of parallel computation is a network of processors communicating via messages. Our primary interest in a parallel algorithm is its speed-up over the sequential ones. Our goal is to design parallel algorithms that achieve a speed-up proportional to the number of processors used. We first study backtrack search that enumerates all solutions to a combinatorial problem. We propose a simple randomized method for parallelizing sequential backtrack search algorithms for solving enumeration problems We show that, uniformly on all instances, this method is likely to achieve a nearly best possible speed-up. We then study the branch-and-bound method for solving combinatorial optimization problems. We present a randomized method called Local Best-First Search for parallelizing sequential branch-and-bound algorithms. We show that, uniformly on all instances, the execution time of this method is unlikely to exceed a certain inherent lower bound by more than a constant factor. In the rest of this thesis we study the problem of evaluation of game trees in parallel. We present a class of parallel algorithms that parallelize the 'left-to-right' algorithm for evaluating AND/OR trees and the [alpha]-[beta] pruning algorithm for evaluating MIN/MAX trees We prove that the algorithm achieves a linear speed-up over the left-to-right algorithm on uniform AND/OR trees when the number of processors used is close to the height of the input tree. We conjecture that the same conclusion holds for the speed-up of the algorithm over the [alpha]-[beta] pruning algorithm. |
| Beschreibung: | Berkeley, Calif., Univ., Diss. |
| Beschreibung: | IV, 107 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV004160048 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 901119s1989 m||| 00||| eng d | ||
| 035 | |a (OCoLC)21991835 | ||
| 035 | |a (DE-599)BVBBV004160048 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 084 | |a DAT 537d |2 stub | ||
| 088 | |a UCB CSD 89 543 | ||
| 100 | 1 | |a Zhang, Yanjun |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Parallel algorithms for combinatorial search problems |
| 246 | 1 | 3 | |a UCB CSD 89 543 |
| 264 | 1 | |a Berkeley, Calif. |c 1989 | |
| 300 | |a IV, 107 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Berkeley, Calif., Univ., Diss. | ||
| 520 | 3 | |a Abstract: "This thesis is a theoretical study of parallel algorithms for combinatorial search problems. In this thesis we present parallel algorithms for backtrack search, branch-and-bound computation and game-tree search. Our model of parallel computation is a network of processors communicating via messages. Our primary interest in a parallel algorithm is its speed-up over the sequential ones. Our goal is to design parallel algorithms that achieve a speed-up proportional to the number of processors used. We first study backtrack search that enumerates all solutions to a combinatorial problem. We propose a simple randomized method for parallelizing sequential backtrack search algorithms for solving enumeration problems | |
| 520 | 3 | |a We show that, uniformly on all instances, this method is likely to achieve a nearly best possible speed-up. We then study the branch-and-bound method for solving combinatorial optimization problems. We present a randomized method called Local Best-First Search for parallelizing sequential branch-and-bound algorithms. We show that, uniformly on all instances, the execution time of this method is unlikely to exceed a certain inherent lower bound by more than a constant factor. In the rest of this thesis we study the problem of evaluation of game trees in parallel. We present a class of parallel algorithms that parallelize the 'left-to-right' algorithm for evaluating AND/OR trees and the [alpha]-[beta] pruning algorithm for evaluating MIN/MAX trees | |
| 520 | 3 | |a We prove that the algorithm achieves a linear speed-up over the left-to-right algorithm on uniform AND/OR trees when the number of processors used is close to the height of the input tree. We conjecture that the same conclusion holds for the speed-up of the algorithm over the [alpha]-[beta] pruning algorithm. | |
| 650 | 4 | |a Branch and bound algorithms | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-002594273 | ||
Datensatz im Suchindex
| _version_ | 1804118371632939008 |
|---|---|
| any_adam_object | |
| author | Zhang, Yanjun |
| author_facet | Zhang, Yanjun |
| author_role | aut |
| author_sort | Zhang, Yanjun |
| author_variant | y z yz |
| building | Verbundindex |
| bvnumber | BV004160048 |
| classification_tum | DAT 537d |
| ctrlnum | (OCoLC)21991835 (DE-599)BVBBV004160048 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02712nam a2200337 c 4500</leader><controlfield tag="001">BV004160048</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">901119s1989 m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)21991835</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004160048</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">UCB CSD 89 543</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zhang, Yanjun</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallel algorithms for combinatorial search problems</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">UCB CSD 89 543</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berkeley, Calif.</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IV, 107 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Berkeley, Calif., Univ., Diss.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This thesis is a theoretical study of parallel algorithms for combinatorial search problems. In this thesis we present parallel algorithms for backtrack search, branch-and-bound computation and game-tree search. Our model of parallel computation is a network of processors communicating via messages. Our primary interest in a parallel algorithm is its speed-up over the sequential ones. Our goal is to design parallel algorithms that achieve a speed-up proportional to the number of processors used. We first study backtrack search that enumerates all solutions to a combinatorial problem. We propose a simple randomized method for parallelizing sequential backtrack search algorithms for solving enumeration problems</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We show that, uniformly on all instances, this method is likely to achieve a nearly best possible speed-up. We then study the branch-and-bound method for solving combinatorial optimization problems. We present a randomized method called Local Best-First Search for parallelizing sequential branch-and-bound algorithms. We show that, uniformly on all instances, the execution time of this method is unlikely to exceed a certain inherent lower bound by more than a constant factor. In the rest of this thesis we study the problem of evaluation of game trees in parallel. We present a class of parallel algorithms that parallelize the 'left-to-right' algorithm for evaluating AND/OR trees and the [alpha]-[beta] pruning algorithm for evaluating MIN/MAX trees</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We prove that the algorithm achieves a linear speed-up over the left-to-right algorithm on uniform AND/OR trees when the number of processors used is close to the height of the input tree. We conjecture that the same conclusion holds for the speed-up of the algorithm over the [alpha]-[beta] pruning algorithm.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Branch and bound algorithms</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002594273</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV004160048 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T16:09:14Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002594273 |
| oclc_num | 21991835 |
| open_access_boolean | |
| physical | IV, 107 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| spelling | Zhang, Yanjun Verfasser aut Parallel algorithms for combinatorial search problems UCB CSD 89 543 Berkeley, Calif. 1989 IV, 107 S. txt rdacontent n rdamedia nc rdacarrier Berkeley, Calif., Univ., Diss. Abstract: "This thesis is a theoretical study of parallel algorithms for combinatorial search problems. In this thesis we present parallel algorithms for backtrack search, branch-and-bound computation and game-tree search. Our model of parallel computation is a network of processors communicating via messages. Our primary interest in a parallel algorithm is its speed-up over the sequential ones. Our goal is to design parallel algorithms that achieve a speed-up proportional to the number of processors used. We first study backtrack search that enumerates all solutions to a combinatorial problem. We propose a simple randomized method for parallelizing sequential backtrack search algorithms for solving enumeration problems We show that, uniformly on all instances, this method is likely to achieve a nearly best possible speed-up. We then study the branch-and-bound method for solving combinatorial optimization problems. We present a randomized method called Local Best-First Search for parallelizing sequential branch-and-bound algorithms. We show that, uniformly on all instances, the execution time of this method is unlikely to exceed a certain inherent lower bound by more than a constant factor. In the rest of this thesis we study the problem of evaluation of game trees in parallel. We present a class of parallel algorithms that parallelize the 'left-to-right' algorithm for evaluating AND/OR trees and the [alpha]-[beta] pruning algorithm for evaluating MIN/MAX trees We prove that the algorithm achieves a linear speed-up over the left-to-right algorithm on uniform AND/OR trees when the number of processors used is close to the height of the input tree. We conjecture that the same conclusion holds for the speed-up of the algorithm over the [alpha]-[beta] pruning algorithm. Branch and bound algorithms (DE-588)4113937-9 Hochschulschrift gnd-content |
| spellingShingle | Zhang, Yanjun Parallel algorithms for combinatorial search problems Branch and bound algorithms |
| subject_GND | (DE-588)4113937-9 |
| title | Parallel algorithms for combinatorial search problems |
| title_alt | UCB CSD 89 543 |
| title_auth | Parallel algorithms for combinatorial search problems |
| title_exact_search | Parallel algorithms for combinatorial search problems |
| title_full | Parallel algorithms for combinatorial search problems |
| title_fullStr | Parallel algorithms for combinatorial search problems |
| title_full_unstemmed | Parallel algorithms for combinatorial search problems |
| title_short | Parallel algorithms for combinatorial search problems |
| title_sort | parallel algorithms for combinatorial search problems |
| topic | Branch and bound algorithms |
| topic_facet | Branch and bound algorithms Hochschulschrift |
| work_keys_str_mv | AT zhangyanjun parallelalgorithmsforcombinatorialsearchproblems AT zhangyanjun ucbcsd89543 |