Massively parallel computation: algorithms and applications
This monograph provides the reader with an accessible introduction to the most important tools of a framework used for the design of new algorithms deployed in systems using massively parallel computation.
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Boston ; Delft
Now Publishers
2023
|
| Schriftenreihe: | Foundations and trends in optimization
Vol. 5, no. 4 |
| Online-Zugang: | DE-91 |
| Zusammenfassung: | This monograph provides the reader with an accessible introduction to the most important tools of a framework used for the design of new algorithms deployed in systems using massively parallel computation. Intro -- Introduction -- Purpose of This Monograph -- Prerequisites -- The MPC Model -- Formal Definition -- Example: Word Frequencies in Two Rounds -- Other Related Models -- Section Notes -- Partitioning and Coresets -- Overview -- Application: Minimum Spanning Tree -- Application: k-Center Clustering -- Coresets -- Application: k-Center Clustering in Euclidean Space -- Problems -- Section Notes -- Sample and Prune -- Overview -- Application: Top k Selection -- Application: k-Center Clustering -- Application: Monotone Submodular Maximization Subject to a Cardinality Constraint -- Section Notes -- Dynamic Programming -- Overview -- Warm-up: Knapsack -- Interval Selection in MPC -- Approximate Dynamic Programs -- Section Notes -- Round Reduction via Sampling -- k-core Decomposition and a Sequential Algorithm -- Parallelizing the Sequential Algorithm: O(n) Rounds -- Round Compression via Random Vertex Partitioning: O(n) Rounds -- Section Notes -- Round Reduction via Graph Exponentiation -- Approximate Core Decomposition -- Connected Components -- Section Notes -- Lower Bounds -- Connectivity in MPC -- Unconditional Lower Bounds -- Conditional Lower Bounds -- Section Notes -- Conclusions -- References. |
| Beschreibung: | Description based on publisher supplied metadata and other sources |
| Beschreibung: | 1 online resource (86 pages) |
| ISBN: | 9781638282174 |
Internformat
MARC
| LEADER | 00000nmm a22000001cb4500 | ||
|---|---|---|---|
| 001 | BV049673098 | ||
| 003 | DE-604 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 240502s2023 |||| o||u| ||||||eng d | ||
| 020 | |a 9781638282174 |9 978-1-63828-217-4 | ||
| 024 | 7 | |a 10.1561/2400000025 |2 doi | |
| 035 | |a (OCoLC)1437836834 | ||
| 035 | |a (DE-599)KEP096653728 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 | ||
| 100 | 1 | |a Im, Sungjin |e Verfasser |0 (DE-588)1135195226 |4 aut | |
| 245 | 1 | 0 | |a Massively parallel computation |b algorithms and applications |c Sungjin Im [und 4 weitere] |
| 264 | 1 | |a Boston ; Delft |b Now Publishers |c 2023 | |
| 300 | |a 1 online resource (86 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Foundations and trends in optimization |v Vol. 5, no. 4 | |
| 500 | |a Description based on publisher supplied metadata and other sources | ||
| 520 | 3 | |a This monograph provides the reader with an accessible introduction to the most important tools of a framework used for the design of new algorithms deployed in systems using massively parallel computation. | |
| 520 | 3 | |a Intro -- Introduction -- Purpose of This Monograph -- Prerequisites -- The MPC Model -- Formal Definition -- Example: Word Frequencies in Two Rounds -- Other Related Models -- Section Notes -- Partitioning and Coresets -- Overview -- Application: Minimum Spanning Tree -- Application: k-Center Clustering -- Coresets -- Application: k-Center Clustering in Euclidean Space -- Problems -- Section Notes -- Sample and Prune -- Overview -- Application: Top k Selection -- Application: k-Center Clustering -- Application: Monotone Submodular Maximization Subject to a Cardinality Constraint -- Section Notes -- Dynamic Programming -- Overview -- Warm-up: Knapsack -- Interval Selection in MPC -- Approximate Dynamic Programs -- Section Notes -- Round Reduction via Sampling -- k-core Decomposition and a Sequential Algorithm -- Parallelizing the Sequential Algorithm: O(n) Rounds -- Round Compression via Random Vertex Partitioning: O(n) Rounds -- Section Notes -- Round Reduction via Graph Exponentiation -- Approximate Core Decomposition -- Connected Components -- Section Notes -- Lower Bounds -- Connectivity in MPC -- Unconditional Lower Bounds -- Conditional Lower Bounds -- Section Notes -- Conclusions -- References. | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-1-63828-216-7 |
| 830 | 0 | |a Foundations and trends in optimization |v Vol. 5, no. 4 |w (DE-604)BV047879910 |9 5,4 | |
| 912 | |a ebook | ||
| 966 | e | |u https://www.nowpublishers.com/article/Download/OPT-025 |l DE-91 |p ebook |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1805082272004571136 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Im, Sungjin |
| author_GND | (DE-588)1135195226 |
| author_facet | Im, Sungjin |
| author_role | aut |
| author_sort | Im, Sungjin |
| author_variant | s i si |
| building | Verbundindex |
| bvnumber | BV049673098 |
| collection | ebook |
| ctrlnum | (OCoLC)1437836834 (DE-599)KEP096653728 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nmm a22000001cb4500</leader><controlfield tag="001">BV049673098</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">240502s2023 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781638282174</subfield><subfield code="9">978-1-63828-217-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1561/2400000025</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1437836834</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KEP096653728</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Im, Sungjin</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1135195226</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Massively parallel computation</subfield><subfield code="b">algorithms and applications</subfield><subfield code="c">Sungjin Im [und 4 weitere]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston ; Delft</subfield><subfield code="b">Now Publishers</subfield><subfield code="c">2023</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (86 pages)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Foundations and trends in optimization</subfield><subfield code="v">Vol. 5, no. 4</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Description based on publisher supplied metadata and other sources</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This monograph provides the reader with an accessible introduction to the most important tools of a framework used for the design of new algorithms deployed in systems using massively parallel computation.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Intro -- Introduction -- Purpose of This Monograph -- Prerequisites -- The MPC Model -- Formal Definition -- Example: Word Frequencies in Two Rounds -- Other Related Models -- Section Notes -- Partitioning and Coresets -- Overview -- Application: Minimum Spanning Tree -- Application: k-Center Clustering -- Coresets -- Application: k-Center Clustering in Euclidean Space -- Problems -- Section Notes -- Sample and Prune -- Overview -- Application: Top k Selection -- Application: k-Center Clustering -- Application: Monotone Submodular Maximization Subject to a Cardinality Constraint -- Section Notes -- Dynamic Programming -- Overview -- Warm-up: Knapsack -- Interval Selection in MPC -- Approximate Dynamic Programs -- Section Notes -- Round Reduction via Sampling -- k-core Decomposition and a Sequential Algorithm -- Parallelizing the Sequential Algorithm: O(n) Rounds -- Round Compression via Random Vertex Partitioning: O(n) Rounds -- Section Notes -- Round Reduction via Graph Exponentiation -- Approximate Core Decomposition -- Connected Components -- Section Notes -- Lower Bounds -- Connectivity in MPC -- Unconditional Lower Bounds -- Conditional Lower Bounds -- Section Notes -- Conclusions -- References.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-1-63828-216-7</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Foundations and trends in optimization</subfield><subfield code="v">Vol. 5, no. 4</subfield><subfield code="w">(DE-604)BV047879910</subfield><subfield code="9">5,4</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://www.nowpublishers.com/article/Download/OPT-025</subfield><subfield code="l">DE-91</subfield><subfield code="p">ebook</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV049673098 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-20T07:30:01Z |
| institution | BVB |
| isbn | 9781638282174 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-035016055 |
| oclc_num | 1437836834 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 online resource (86 pages) |
| psigel | ebook |
| publishDate | 2023 |
| publishDateSearch | 2023 |
| publishDateSort | 2023 |
| publisher | Now Publishers |
| record_format | marc |
| series | Foundations and trends in optimization |
| series2 | Foundations and trends in optimization |
| spelling | Im, Sungjin Verfasser (DE-588)1135195226 aut Massively parallel computation algorithms and applications Sungjin Im [und 4 weitere] Boston ; Delft Now Publishers 2023 1 online resource (86 pages) txt rdacontent c rdamedia cr rdacarrier Foundations and trends in optimization Vol. 5, no. 4 Description based on publisher supplied metadata and other sources This monograph provides the reader with an accessible introduction to the most important tools of a framework used for the design of new algorithms deployed in systems using massively parallel computation. Intro -- Introduction -- Purpose of This Monograph -- Prerequisites -- The MPC Model -- Formal Definition -- Example: Word Frequencies in Two Rounds -- Other Related Models -- Section Notes -- Partitioning and Coresets -- Overview -- Application: Minimum Spanning Tree -- Application: k-Center Clustering -- Coresets -- Application: k-Center Clustering in Euclidean Space -- Problems -- Section Notes -- Sample and Prune -- Overview -- Application: Top k Selection -- Application: k-Center Clustering -- Application: Monotone Submodular Maximization Subject to a Cardinality Constraint -- Section Notes -- Dynamic Programming -- Overview -- Warm-up: Knapsack -- Interval Selection in MPC -- Approximate Dynamic Programs -- Section Notes -- Round Reduction via Sampling -- k-core Decomposition and a Sequential Algorithm -- Parallelizing the Sequential Algorithm: O(n) Rounds -- Round Compression via Random Vertex Partitioning: O(n) Rounds -- Section Notes -- Round Reduction via Graph Exponentiation -- Approximate Core Decomposition -- Connected Components -- Section Notes -- Lower Bounds -- Connectivity in MPC -- Unconditional Lower Bounds -- Conditional Lower Bounds -- Section Notes -- Conclusions -- References. Erscheint auch als Druck-Ausgabe 978-1-63828-216-7 Foundations and trends in optimization Vol. 5, no. 4 (DE-604)BV047879910 5,4 |
| spellingShingle | Im, Sungjin Massively parallel computation algorithms and applications Foundations and trends in optimization |
| title | Massively parallel computation algorithms and applications |
| title_auth | Massively parallel computation algorithms and applications |
| title_exact_search | Massively parallel computation algorithms and applications |
| title_full | Massively parallel computation algorithms and applications Sungjin Im [und 4 weitere] |
| title_fullStr | Massively parallel computation algorithms and applications Sungjin Im [und 4 weitere] |
| title_full_unstemmed | Massively parallel computation algorithms and applications Sungjin Im [und 4 weitere] |
| title_short | Massively parallel computation |
| title_sort | massively parallel computation algorithms and applications |
| title_sub | algorithms and applications |
| volume_link | (DE-604)BV047879910 |
| work_keys_str_mv | AT imsungjin massivelyparallelcomputationalgorithmsandapplications |