Academic Journal
An efficient parallel approach for binary-state network reliability problems.
| Τίτλος: | An efficient parallel approach for binary-state network reliability problems. |
|---|---|
| Συγγραφείς: | Yeh, Wei-Chang1 (AUTHOR) yeh@ieee.org, Forghani-elahabad, Majid2 (AUTHOR) m.forghani@ufabc.edu.br |
| Πηγή: | Annals of Operations Research. Jun2026, Vol. 361 Issue 3, p1091-1112. 22p. |
| Θεματικοί όροι: | *Parallel processing, *Reliability in engineering, *Algorithms, *Parallel programming, Computer network reliability, Computational complexity |
| Περίληψη: | Networks are ubiquitous in modern applications, with reliability being a paramount performance metric. While exact network reliability can be determined using implicit enumeration algorithms like depth-first search, breadth-first search, the universal generating function methodology, the binary decision diagram, and the binary addition tree algorithm (BAT), these methods are limited to small-scale networks. The recently introduced BAT algorithm offers a high-speed, flexible, and easily implementable exact solution for determining network reliability. Experimental results demonstrate BAT's superiority over other implicit enumeration algorithms. To address the computational challenges of larger networks, we propose a multithreaded version of BAT (mBAT). By leveraging multi-core architectures, mBAT efficiently solves medium-scale network reliability problems, as confirmed by time complexity analysis and experiments on 20 benchmark instances using up to 12 CPU threads. [ABSTRACT FROM AUTHOR] |
| Copyright of Annals of Operations Research is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Βάση Δεδομένων: | Business Source Index |
| FullText | Links: – Type: other Text: Availability: 0 CustomLinks: – Url: https://dx.doi.org/doi:10.1007/s10479-024-06409-3 Name: EDS - Springer Nature Journals (s7799221) Category: fullText Text: View record at Springer |
|---|---|
| Header | DbId: bsx DbLabel: Business Source Index An: 194452349 RelevancyScore: 1435 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 1435 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: An efficient parallel approach for binary-state network reliability problems. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Yeh%2C+Wei-Chang%22">Yeh, Wei-Chang</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> yeh@ieee.org</i><br /><searchLink fieldCode="AR" term="%22Forghani-elahabad%2C+Majid%22">Forghani-elahabad, Majid</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> m.forghani@ufabc.edu.br</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Annals+of+Operations+Research%22">Annals of Operations Research</searchLink>. Jun2026, Vol. 361 Issue 3, p1091-1112. 22p. – Name: Subject Label: Subject Terms Group: Su Data: *<searchLink fieldCode="DE" term="%22Parallel+processing%22">Parallel processing</searchLink><br />*<searchLink fieldCode="DE" term="%22Reliability+in+engineering%22">Reliability in engineering</searchLink><br />*<searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br />*<searchLink fieldCode="DE" term="%22Parallel+programming%22">Parallel programming</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+network+reliability%22">Computer network reliability</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+complexity%22">Computational complexity</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Networks are ubiquitous in modern applications, with reliability being a paramount performance metric. While exact network reliability can be determined using implicit enumeration algorithms like depth-first search, breadth-first search, the universal generating function methodology, the binary decision diagram, and the binary addition tree algorithm (BAT), these methods are limited to small-scale networks. The recently introduced BAT algorithm offers a high-speed, flexible, and easily implementable exact solution for determining network reliability. Experimental results demonstrate BAT's superiority over other implicit enumeration algorithms. To address the computational challenges of larger networks, we propose a multithreaded version of BAT (mBAT). By leveraging multi-core architectures, mBAT efficiently solves medium-scale network reliability problems, as confirmed by time complexity analysis and experiments on 20 benchmark instances using up to 12 CPU threads. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Annals of Operations Research is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=bsx&AN=194452349 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s10479-024-06409-3 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 22 StartPage: 1091 Subjects: – SubjectFull: Parallel processing Type: general – SubjectFull: Reliability in engineering Type: general – SubjectFull: Algorithms Type: general – SubjectFull: Parallel programming Type: general – SubjectFull: Computer network reliability Type: general – SubjectFull: Computational complexity Type: general Titles: – TitleFull: An efficient parallel approach for binary-state network reliability problems. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Yeh, Wei-Chang – PersonEntity: Name: NameFull: Forghani-elahabad, Majid IsPartOfRelationships: – BibEntity: Dates: – D: 21 M: 06 Text: Jun2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 02545330 Numbering: – Type: volume Value: 361 – Type: issue Value: 3 Titles: – TitleFull: Annals of Operations Research Type: main |
| ResultId | 1 |