IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v7y2019i12p1159-d293020.html
   My bibliography  Save this article

Efficient Pipelined Broadcast with Monitoring Processing Node Status on a Multi-Core Processor

Author

Listed:
  • Jongsu Park

    (School of Electrical and Electronic Engineering, Yonsei University, Seoul 03722, Korea)

Abstract

This paper presents an efficient pipelined broadcasting algorithm with the inter-node transmission order change technique considering the communication status of processing nodes. The proposed method changes the transmission order for the broadcast operation based on the communication status of processing nodes. When a broadcast operation is received, a local bus checks the remaining pre-existing transmission data size of each processing node; it then transmits data according to the changed transmission order using the status information. Therefore, the synchronization time can be hidden for the remaining time, until the pre-existing data transmissions finish; as a result, the overall broadcast completion time is reduced. The simulation results indicated that the speed-up ratio of the proposed algorithm was up to 1.423, compared to that of the previous algorithm. To demonstrate physical implementation feasibility, the message passing engine (MPE) with the proposed broadcast algorithm was designed by using Verilog-HDL, which supports four processing nodes. The logic synthesis results with TSMC 0.18 μm process cell libraries show that the logic area of the proposed MPE is 2288.1 equivalent NAND gates, which is approximately 2.1% of the entire chip area. Therefore, performance improvement in multi-core processors is expected with a small hardware area overhead.

Suggested Citation

  • Jongsu Park, 2019. "Efficient Pipelined Broadcast with Monitoring Processing Node Status on a Multi-Core Processor," Mathematics, MDPI, vol. 7(12), pages 1-22, December.
  • Handle: RePEc:gam:jmathe:v:7:y:2019:i:12:p:1159-:d:293020
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/12/1159/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/7/12/1159/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:7:y:2019:i:12:p:1159-:d:293020. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.