Abstract
Integrated network barriers (INBs) are network protocols for parallel processors. INBs are both pipelinable and have low latency. In this paper, we show that INBs implement barriers-which ensure that all prebarrier operations of any processor appear to complete before any post-barrier operations-and we show how to construct efficient, deadlock-free barriers for any interconnection network and routing function which has an acyclic queue dependency graph. As a special case, INBs can be implemented for any network and routing function for which there exists an acyclic channel dependency graph.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Parallel and Distributed Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
