Communications of the ACM - Special section on computer architecture
Towards performance improvement of cut-through switching in computer networks
Performance Evaluation
Interprocessor Traffic Scheduling Algorithm for Multiple-Processor Networks
IEEE Transactions on Computers
The MAFT Architecture for Distributed Fault Tolerance
IEEE Transactions on Computers - Fault-Tolerant Computing
Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors
IEEE Transactions on Computers
Performance Analysis of Virtual Cut-Through Switching in HARTS: A Hexagonal Mesh Multicomputer
IEEE Transactions on Computers
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Guaranteeing Performance for Real-Time Communication in Wide-Area
Guaranteeing Performance for Real-Time Communication in Wide-Area
Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
IEEE Transactions on Computers
Using graph theory to reduce communication overhead in parallel systems
Journal of Computing Sciences in Colleges
| Hi-index | 14.98 |
The problem of selecting routes for interprocess communication in a network with virtual cut-through capability while balancing the network load and minimizing the number of times that a message gets buffered is addressed. The approach taken is to formulate the route selection problem as a minimization problem, with a link cost function that depends upon the traffic through the link. The form of this cost function is derived based on the probability of establishing a virtual cut-through route. It is shown that this route selection problem is NP-hard, and an approximate algorithm is developed which tries to incrementally reduce the cost by rerouting traffic. The performance of this algorithm is evaluated for the hypercube and the C-wrapped hexagonal mesh, example networks for which virtual cut-through switching support has been developed.