Learn More
— In this paper we present a methodology to design fault-tolerant routing algorithms for regular direct interconnection networks. It supports fully adaptive routing, does not degrade performance in the absence of faults, and supports a reasonably large number of faults without significantly degrading performance. The methodology is mainly based on the(More)
To meet the demand for more powerful high-performance shared-memory servers, multiprocessor systems must incorporate efficient and scalable cache coherence protocols, such as those based on directory caches. However, the limited directory cache size of the increasingly larger systems may cause frequent evictions of directory entries and, consequently,(More)
Networks of workstations are rapidly emerging as a cost-eeective alternative to parallel computers. Switch-based interconnects with irregular topologies allow the wiring exibility, scalability and in-cremental expansion capability required in this environment. The irregularity also makes routing and deadlock avoidance on such systems quite complicated.(More)