Parallel interval-Newton using message passing dynamic load balancing strategies
Branch-and-prune and branch-and-bound techniques are commonly used for intelligent search in finding all solutions, or the optimal solution, within a space of interest. The corresponding binary tree structure provides a natural parallelism allowing concurrent evaluation of subproblems using parallel...
Uloženo v:
| Vydáno v: | Proceedings of the 2001 ACM/IEEE Conference on Supercomputing s. 23 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
New York, NY, USA
ACM
10.11.2001
|
| Edice: | ACM Conferences |
| Témata: | |
| ISBN: | 9781581132939, 158113293X |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Branch-and-prune and branch-and-bound techniques are commonly used for intelligent search in finding all solutions, or the optimal solution, within a space of interest. The corresponding binary tree structure provides a natural parallelism allowing concurrent evaluation of subproblems using parallel computing technology. Of special interest here are techniques derived from interval analysis, in particular an interval-Newton/generalized-bisection procedure. In this context, we discuss issues of load balancing and work scheduling that arise in the implementation of parallel interval-Newton on a cluster of workstations using message passing, and describe and analyze techniques for this purpose. Results using an asynchronous diffusive load balancing strategy show that a consistently high efficiency can be achieved in solving nonlinear equations, providing excellent scalability, especially with the use of a two-dimensional torus virtual network. The effectiveness of the approach used, especially in connection with a novel stack management scheme, is also demonstrated in the consistent superlinear speedups observed in performing global optimization. |
|---|---|
| AbstractList | Branch-and-prune and branch-and-bound techniques are commonly used for intelligent search in finding all solutions, or the optimal solution, within a space of interest. The corresponding binary tree structure provides a natural parallelism allowing concurrent evaluation of subproblems using parallel computing technology. Of special interest here are techniques derived from interval analysis, in particular an interval-Newton/generalized-bisection procedure. In this context, we discuss issues of load balancing and work scheduling that arise in the implementation of parallel interval-Newton on a cluster of workstations using message passing, and describe and analyze techniques for this purpose. Results using an asynchronous diffusive load balancing strategy show that a consistently high efficiency can be achieved in solving nonlinear equations, providing excellent scalability, especially with the use of a two-dimensional torus virtual network. The effectiveness of the approach used, especially in connection with a novel stack management scheme, is also demonstrated in the consistent superlinear speedups observed in performing global optimization. |
| Author | Stadtherr, Mark A. Gau, Chao-Yang |
| Author_xml | – sequence: 1 givenname: Chao-Yang surname: Gau fullname: Gau, Chao-Yang organization: University of Notre Dame, Notre Dame – sequence: 2 givenname: Mark A. surname: Stadtherr fullname: Stadtherr, Mark A. organization: University of Notre Dame, Notre Dame |
| BookMark | eNqFkDtLxEAURgdUUNeU9qmsTJybyZ1HKYsvWNRC6-FmMlmis8maSfTva4hgafXxweEU55Qddn3nGTsHngOUeIW64KLM50F1wBKjNKAGEIUR5pglMb5xzn--QlWcsPyZBgrBh7TtRj98Usge_dfYd-kU226b7nyMtPXpnuL8z9hRQyH65HdX7PX25mV9n22e7h7W15uMQJoxE-igcgQCULkSK2wkqQak5Mh1oamui4ZQa42KjJSNVrUn7crK6RoMSbFiF4t3P_Qfk4-j3bXR-RCo8_0UrYBSSoMzeLmA5Ha26vv3aIHbuYRdStilhK2G1jd_3n9w8Q0_Nl8Z |
| ContentType | Conference Proceeding |
| Copyright | 2001 ACM |
| Copyright_xml | – notice: 2001 ACM |
| DBID | 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1145/582034.582057 |
| DatabaseName | Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EndPage | 23 |
| Genre | Conference Paper |
| GroupedDBID | 6IE 6IK 6IL AAJGR AAVQY ACM ADPZR ALMA_UNASSIGNED_HOLDINGS APO BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK GUFHI IERZE OCL RIB RIC RIE RIL 7SC 8FD AAWTH JQ2 L7M LHSKQ L~C L~D |
| ID | FETCH-LOGICAL-a169t-35c1bca13157c45b5f6a7f166050828add2fa588857a966f87dea8c4bc8d19a63 |
| ISBN | 9781581132939 158113293X |
| IngestDate | Fri Jul 11 12:26:23 EDT 2025 Wed Jan 31 06:39:50 EST 2024 Wed Jan 31 06:50:28 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Keywords | nonlinear equations branch-and-bound interval analysis parallel computing branch-and-prune global optimization |
| Language | English |
| License | Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org |
| LinkModel | OpenURL |
| MeetingName | SC '01: International Conference for High Performance Computing, Networking, Storage and Analysis |
| MergedId | FETCHMERGED-LOGICAL-a169t-35c1bca13157c45b5f6a7f166050828add2fa588857a966f87dea8c4bc8d19a63 |
| Notes | SourceType-Conference Papers & Proceedings-1 ObjectType-Conference Paper-1 content type line 25 |
| PQID | 31466956 |
| PQPubID | 23500 |
| PageCount | 1 |
| ParticipantIDs | acm_books_10_1145_582034_582057_brief acm_books_10_1145_582034_582057 proquest_miscellaneous_31466956 |
| PublicationCentury | 2000 |
| PublicationDate | 20011110 20011101 |
| PublicationDateYYYYMMDD | 2001-11-10 2001-11-01 |
| PublicationDate_xml | – month: 11 year: 2001 text: 20011110 day: 10 |
| PublicationDecade | 2000 |
| PublicationPlace | New York, NY, USA |
| PublicationPlace_xml | – name: New York, NY, USA |
| PublicationSeriesTitle | ACM Conferences |
| PublicationTitle | Proceedings of the 2001 ACM/IEEE Conference on Supercomputing |
| PublicationYear | 2001 |
| Publisher | ACM |
| Publisher_xml | – name: ACM |
| SSID | ssj0001137572 |
| Score | 1.3110217 |
| Snippet | Branch-and-prune and branch-and-bound techniques are commonly used for intelligent search in finding all solutions, or the optimal solution, within a space of... |
| SourceID | proquest acm |
| SourceType | Aggregation Database Publisher |
| StartPage | 23 |
| SubjectTerms | Computing methodologies -- Artificial intelligence -- Search methodologies Computing methodologies -- Artificial intelligence -- Search methodologies -- Discrete space search Computing methodologies -- Artificial intelligence -- Search methodologies -- Game tree search Mathematics of computing -- Mathematical analysis -- Functional analysis -- Approximation Mathematics of computing -- Mathematical analysis -- Mathematical optimization Mathematics of computing -- Mathematical analysis -- Nonlinear equations Theory of computation -- Design and analysis of algorithms -- Approximation algorithms analysis Theory of computation -- Design and analysis of algorithms -- Mathematical optimization |
| Subtitle | dynamic load balancing strategies |
| Title | Parallel interval-Newton using message passing |
| URI | https://www.proquest.com/docview/31466956 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELZoxYETryJaXj4Al1Wg3tixww1VrTiUZSW20nKKHMdBldrskmxQfz4zfiTbFqniwCW7a0WO5S87nvF4vo-Qt-UU_GJd50ltjcY0o0lKw6dJLcBcgj9S5bxyYhNyNlPLZT4PhAqdkxOQTaOurvL1f4Ua2gBsLJ39B7iHTqEBvgPocAXY4XrDI_7r4jMfGruY_8cDTZPPR1-hT4zttqr8MFXwvV_b1jhxh9hTeIXmukWllQvHKdHCGBMwiUjD0bsNhktUT_lpJ2vwv33ZdOXl7ScXKw1-LR6aNH67IvJRDKd9dB9y_avkh45PdZrGFXqkbSwjClutcVuChfq87eiUCeV07D1bUbSQ6dZa63_ctuIcCS8EOCcp_4AfnsP6Olv27FtxcnZ6WiyOl4v3618JColhwj2oquyQHSkPfUHfuOnGUikkRufD2AIL0zjWSMTKxcdrI0D3xVzeWrKdH7J4RPZG7OiI9GNyzzZPyMMo0UGDxX5K5hFDegND6jCkAUMaMPwUEKSIIB0QpCOCe-Ts5Hhx9CUJIhqJZlm-SVJhWGk0S5mQhotS1JmWNcsgjEX2QljeprUWSikhNYS-tZKV1crw0qiK5TpLn5HdZtXY54Ryk4J_V1dSVSlXh1ZpZgQvrVQl8v7l--QNzFCB_4Wu8AXvovBzWPg53Cfv7rijKNtzW0NPcZYLMHeYw9KNXfVdkcLKnkFMf3DnHS_Ig_G9fEl2N21vX5H75vfmvGtfu_fiDx6mcGY |
| linkProvider | IEEE |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+2001+ACM%2FIEEE+Conference+on+Supercomputing&rft.atitle=Parallel+interval-Newton+using+message+passing%3Adynamic+load+balancing+strategies&rft.au=Gau%2C+Chao-Yang&rft.au=Stadtherr%2C+Mark+A&rft.date=2001-11-01&rft.isbn=9781581132939&rft.spage=23&rft.epage=23&rft_id=info:doi/10.1145%2F582034.582057&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781581132939/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781581132939/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781581132939/sc.gif&client=summon&freeimage=true |