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

Researches for more reliable arrangement graphs in multiprocessor computer system

Author

Listed:
  • Yu, Zhongbao
  • Shao, Fangming
  • Zhang, Zuyuan

Abstract

The arrangement graph An,k is regarded as an attractive interconnection network in multiprocessor computer system. The subsystem-reliability (s-reliability) is defined as the probability that a fault-free subgraph of a specific size is still available, and is able to measure the health state of the system. In this paper, we mainly consider the comparison of two different topologies of arrangement graphs with the same number of processors and the robustness of reliability bounds of arrangement graph. Further, we prove that the larger n is, the higher s-reliability of An,k will be, and provide a theoretical basis for finding the topology of more reliable arrangement graph with the same number of processors. The simulation is carried out to verify the robustness of reliability bounds and comparison of more pairs of arrangement graph.

Suggested Citation

  • Yu, Zhongbao & Shao, Fangming & Zhang, Zuyuan, 2019. "Researches for more reliable arrangement graphs in multiprocessor computer system," Applied Mathematics and Computation, Elsevier, vol. 363(C), pages 1-1.
    • Handle: RePEc:eee:apmaco:v:363:y:2019:i:c:4
    DOI: 10.1016/j.amc.2019.124611
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300319306034
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2019.124611?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.

    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:apmaco:v:363:y:2019:i:c:4. 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/applied-mathematics-and-computation .

    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.