Technical Reports (CIS)

Document Type

Technical Report

Date of this Version

October 1991


University of Pennsylvania Department of Computer and Information Sciences Technical Report No. MS-CIS-91-92.


Packet routing is an important problem of parallel computing since a fast algorithm for packet routing will imply 1) fast inter-processor communication, and 2) fast algorithms for emulating ideal models like PRAMs on fixed connection machines.There are three different models of packet routing, namely 1) Store and forward, 2) Multipacket, and 3) Cut through. In this paper we provide a survey of the best known randomized algorithms for store and forward routing, k-k routing, and cut through routing on the Mesh Connected Computers.



Date Posted: 30 July 2007