M. Ajmone Marsan

TL;DR: This is the first to focus entirely on the problem of modeling and performance evaluation of multiprocessor systems using analytical methods, and focuses on contention for physical system resources, such as shared devices and interconnection networks.

TL;DR: Graph models have been proposed by many authors as a useful tool for the analysis of peculiar features of computer systems such as concurrency, synchronization, communication, and cooperation among subsystems.

TL;DR: It is proved that input-queued switch architectures dealing at their interfaces with variable-size packets, but internally operating on fixed-size cells using packet-mode scheduling can achieve 100% throughput, and it is shown by simulation that, depending on the packet size distribution, packet- Mode scheduling may provide advantages over cell- mode scheduling.

TL;DR: Three regular meshed topologies are compared in light of their possible use for the implementation of large all-optical wavelength-routing communication networks (or interconnection systems) and the K-dimensional bidirectional square lattice, the twin shuffle, and the de Bruijn graph are considered.