A Decentralized Load Balancing Approach for Parallel Search-Tree Optimization

Current generation supercomputers have over one million cores awaiting highly demanding computations and applications. An area that could largely benefit from such processing capabilities is naturally that of exact algorithms for NP-hard problems. We propose a general implementation framework that t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings (International Symposium on Parallel and Distributed Computing) S. 173 - 178
Hauptverfasser: Abu-Khzam, F. N., Mouawad, A. E.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.12.2012
Schlagworte:
Dominating Set
Dynamic Load Balancing
Exact Algorithms
Heuristic algorithms
Load management
Network topology
Optimization
Parallel Algorithms
Recursive Backtracking
Scalability
Supercomputers
Topology
Vertex Cover
ISSN:2379-5352
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Current generation supercomputers have over one million cores awaiting highly demanding computations and applications. An area that could largely benefit from such processing capabilities is naturally that of exact algorithms for NP-hard problems. We propose a general implementation framework that targets highly scalable parallel exact algorithms for NP-hard graph problems. We tackle the problems of efficiency and scalability by combining a fully decentralized dynamic load balancing strategy with special implementation techniques for exact graph algorithms. As a case-study, we use our framework to implement parallel algorithms for the VERTEX COVER and DOMINATING SET problems. We present experimental results that show notable improved running times on all types of input instances.
AbstractList Current generation supercomputers have over one million cores awaiting highly demanding computations and applications. An area that could largely benefit from such processing capabilities is naturally that of exact algorithms for NP-hard problems. We propose a general implementation framework that targets highly scalable parallel exact algorithms for NP-hard graph problems. We tackle the problems of efficiency and scalability by combining a fully decentralized dynamic load balancing strategy with special implementation techniques for exact graph algorithms. As a case-study, we use our framework to implement parallel algorithms for the VERTEX COVER and DOMINATING SET problems. We present experimental results that show notable improved running times on all types of input instances.
Author Abu-Khzam, F. N.
Mouawad, A. E.
Author_xml – sequence: 1
  givenname: F. N.
  surname: Abu-Khzam
  fullname: Abu-Khzam, F. N.
  email: faisal.abukhzam@lau.edu.lb
  organization: Dept. of Comput. Sci. & Math., Lebanese American Univ., Beirut, Lebanon
– sequence: 2
  givenname: A. E.
  surname: Mouawad
  fullname: Mouawad, A. E.
  email: aabdomou@uwaterloo.ca
  organization: Sch. of Comput. Sci., Univ. of Waterloo, Waterloo, ON, Canada
BookMark eNotjstOg0AUQMekJra1S1du5gfAeTADd4nUV4JpE3HdXOCOHUOBDGzs19tEV2dzcnJWbNEPPTF2J0UspYCH_bbIq1gJqWJpr9hKpBZMkqWgFmypdAqR0UbdsM00fQshtMwyyGDJ3nO-pYb6OWDnz9TycsCWP2KHfeP7L56PYxiwOXI3BL7Hi9VRxz8IQ3OMqkDEd-PsT_6Msx_6W3btsJto8881-3x-qorXqNy9vBV5GXmZmjmqjQYnEoOmtk4lVJNuXG0vQ2lDzoGzttVKONAgFLSiVoYIbYqCssRJ0Gt2_9f1RHQYgz9h-DlYk4EyoH8BNelPUA
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/PDCAT.2012.16
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 0769548792
9780769548791
EndPage 178
ExternalDocumentID 6589259
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i175t-b539f045a5b6f24ebe3cfb69897ceff9f66d320f939029d0b25eea67a0e84f193
IEDL.DBID RIE
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000339119200028&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2379-5352
IngestDate Wed Aug 27 02:46:21 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-b539f045a5b6f24ebe3cfb69897ceff9f66d320f939029d0b25eea67a0e84f193
PageCount 6
ParticipantIDs ieee_primary_6589259
PublicationCentury 2000
PublicationDate 2012-Dec.
PublicationDateYYYYMMDD 2012-12-01
PublicationDate_xml – month: 12
  year: 2012
  text: 2012-Dec.
PublicationDecade 2010
PublicationTitle Proceedings (International Symposium on Parallel and Distributed Computing)
PublicationTitleAbbrev pdcat
PublicationYear 2012
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0003188989
Score 1.512406
Snippet Current generation supercomputers have over one million cores awaiting highly demanding computations and applications. An area that could largely benefit from...
SourceID ieee
SourceType Publisher
StartPage 173
SubjectTerms Dominating Set
Dynamic Load Balancing
Exact Algorithms
Heuristic algorithms
Load management
Network topology
Optimization
Parallel Algorithms
Recursive Backtracking
Scalability
Supercomputers
Topology
Vertex Cover
Title A Decentralized Load Balancing Approach for Parallel Search-Tree Optimization
URI https://ieeexplore.ieee.org/document/6589259
WOSCitedRecordID wos000339119200028&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwELXaioGpQIv4lgdG3IbYjeuxtFQMUDIUqVvl2HdSJWhRaBn49ZyT0DKwsFmRLEV3dt6L_e4eY9eEAgSziReKsEoolE5kFrVIJCpEQiBjfGE2oSeT_mxm0hq72dbCAEAhPoNOGBZ3-X7lNuGorEtoaYiu11ld66Ss1dqep9DaDE6IhZecNiJ0Ldm11Oymo-FgGoRccSc4m_8yUilwZNz83xscsPauII-nW6g5ZDVYHrHmjyMDrzZoiz0N-AgqveXiCzx_XFnP74J80dFEPqg6iHOiqjy1eTBSeeWl5FhMcwD-TJ-Qt6o2s81exvfT4YOoDBPEgljAWmQ9aZA4mu1lCcaK8iMdZsEiUjtANJgkXsYRGmmi2Pgoi3sANtE2gr6ixMhj1liulnDCuPMapbT0N4SoiEUYo24x9irL-gl4Z09ZK0Rn_l72xJhXgTn7-_E52w-xL2UgF6yxzjdwyfbc53rxkV8VifwGPh2efA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH5BNNETKhh_24NHC3PtNnpElGAE3AETbqRb30tIFMwED_71ttsED168NU2aLO-t-75233sfwLVFAQuzoeHSYhWXJFKeaIp4KEgSWQRSyuRmE9Fo1J5MVFyBm3UtDCLm4jNsumH-L98s0pW7KmtZtFSWrm_BdiCl7xXVWusbFft2Oi_E3E0uUtz1Ldk01WzF993O2Em5_KbzNv9lpZIjSa_2v2fYh8amJI_Fa7A5gArOD6H248nAyi1ah2GH3WOpuJx9oWGDhTbszgkYU7uQdcoe4sySVRbrzFmpvLJCdMzHGSJ7th-Rt7I6swEvvYdxt89LywQ-szxgyZNAKLIsTQdJSL60GRIpJc4kMkqRSFEYGuF7pITyfGW8xA8QdRhpD9vSpkYcQXW-mOMxsNREJIS25yEiaXmEUvKWfCOTpB2iSfUJ1F10pu9FV4xpGZjTv6evYLc_Hg6mg8fR0xnsuTwUopBzqC6zFV7ATvq5nH1kl3lSvwGsWKHD
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%3Ajournal&rft.genre=proceeding&rft.title=Proceedings+%28International+Symposium+on+Parallel+and+Distributed+Computing%29&rft.atitle=A+Decentralized+Load+Balancing+Approach+for+Parallel+Search-Tree+Optimization&rft.au=Abu-Khzam%2C+F.+N.&rft.au=Mouawad%2C+A.+E.&rft.date=2012-12-01&rft.pub=IEEE&rft.issn=2379-5352&rft.spage=173&rft.epage=178&rft_id=info:doi/10.1109%2FPDCAT.2012.16&rft.externalDocID=6589259
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2379-5352&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2379-5352&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2379-5352&client=summon