IDEAS home Printed from https://ideas.repec.org/a/eee/reensy/v238y2023ics0951832023003319.html
   My bibliography  Save this article

Usage of task and data parallelism for finding the lower boundary vectors in a stochastic-flow network

Author

Listed:
  • Forghani-elahabad, Majid
  • Francesquini, Emilio

Abstract

In a stochastic-flow network, a minimal system state vector under which the maximum flow of the network from a source node to a destination node is equal to d is called a lower boundary vector (LBV). As the number of LBVs increases exponentially with the size of the network, the available algorithms in the literature could be improved to be more practical for real-world large-sized systems. We employ task and data parallelism to propose an efficient algorithm for determining all the LBVs to tackle this problem. We present an efficient approach for removing duplicate solutions to improve an available algorithm to find all the LBVs. We show the correctness and compute the complexity results of the proposed approach and demonstrate its efficiency. Then, we propose vectorized, parallelized, and vectorized–parallelized versions of the main algorithm. We illustrate the standard version through a benchmark example and discuss the other proposed versions’ correctness. We conduct several experimental results on two known benchmark networks and more than one thousand random problems to demonstrate the practical efficiency of the vectorized–parallelized version. Moreover, Dolan and Moré’s performance profile is used to provide a more intuitive comparison between all four versions.

Suggested Citation

  • Forghani-elahabad, Majid & Francesquini, Emilio, 2023. "Usage of task and data parallelism for finding the lower boundary vectors in a stochastic-flow network," Reliability Engineering and System Safety, Elsevier, vol. 238(C).
    • Handle: RePEc:eee:reensy:v:238:y:2023:i:c:s0951832023003319
    DOI: 10.1016/j.ress.2023.109417
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0951832023003319
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ress.2023.109417?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yeh, Wei-Chang, 2024. "Time-reliability optimization for the stochastic traveling salesman problem," Reliability Engineering and System Safety, Elsevier, vol. 248(C).
    2. Majid Forghani-elahabad & Omar Mutab Alsalami, 2023. "Using a Node–Child Matrix to Address the Quickest Path Problem in Multistate Flow Networks under Transmission Cost Constraints," Mathematics, MDPI, vol. 11(24), pages 1-15, December.
    3. Xu, Xiu-Zhen & Zhou, Run-Hui & Wu, Guo-Lin & Niu, Yi-Feng, 2024. "Evaluating the transmission distance-constrained reliability for a multi-state flow network," Reliability Engineering and System Safety, Elsevier, vol. 244(C).
    4. Chang, Ping-Chen, 2024. "A path-based simulation approach for multistate flow network reliability estimation without using boundary points," Reliability Engineering and System Safety, Elsevier, vol. 249(C).
    5. Huang, Ding-Hsiang, 2024. "An algorithm to generate all d-lower boundary points for a stochastic flow network using dynamic flow constraints," Reliability Engineering and System Safety, Elsevier, vol. 249(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:reensy:v:238:y:2023:i:c:s0951832023003319. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/reliability-engineering-and-system-safety .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.