IEEE Transactions on Parallel and Distributed Systems
On deadlocks in interconnection networks
Proceedings of the 24th annual international symposium on Computer architecture
Improving the performance of bristled CC-NUMA systems using virtual channels and adaptivity
ICS '99 Proceedings of the 13th international conference on Supercomputing
A Formal Model of Message Blocking and Deadlock Resolution in Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
A Progressive Approach to Handling Message-Dependent Deadlock in Parallel Computer Systems
IEEE Transactions on Parallel and Distributed Systems
A Simple and Efficient Mechanism to Prevent Saturation in Wormhole Networks
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Principles and Practices of Interconnection Networks
Principles and Practices of Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Multifacet's general execution-driven multiprocessor simulator (GEMS) toolset
ACM SIGARCH Computer Architecture News - Special issue: dasCMP'05
The PARSEC benchmark suite: characterization and architectural implications
Proceedings of the 17th international conference on Parallel architectures and compilation techniques
A case for bufferless routing in on-chip networks
Proceedings of the 36th annual international symposium on Computer architecture
Blue Gene/L torus interconnection network
IBM Journal of Research and Development
Critical Bubble Scheme: An Efficient Implementation of Globally Aware Network Flow Control
IPDPS '11 Proceedings of the 2011 IEEE International Parallel & Distributed Processing Symposium
Exploiting global knowledge to achieve self-tuned congestion control for k-ary n-cube networks
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Network flow control mechanisms that are aware of global conditions potentially can achieve higher performance than flow control mechanisms that are only locally aware. Owing to high implementation overhead, globally-aware flow control mechanisms in their purest form are seldom adopted in practice, leading to less efficient simplified implementations. In this paper, we propose an efficient implementation of a globally-aware flow control mechanism, called Critical Bubble Scheme, for k-ary n-cube networks. This scheme achieves near-optimal performance with the same minimal buffer requirements of globally-aware flow control and can be further generalized to implement the general class of buffer occupancy-based network flow control. We prove deadlock freedom of the proposed scheme and exploit its use in handling protocol-induced deadlocks in on-chip environments. We evaluate the proposed scheme using both synthetic traffic and real application loads. Simulation results show that the proposed scheme can reduce the buffer access component of packet latency by as much as 62% over locally-aware flow control, and improve average packet latency by 18.8% and overall execution time by 7.2% in full system simulation.