Permutation Routing on Mesh and Multimesh.

Date of Submission

December 1997

Date of Award

Winter 12-12-1998

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Advance Computing and Microelectronics Unit (ACMU-Kolkata)


Sinha, Bhabani Prasad (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

Fast communication between the processors in a parallel mmachine is very critical to efficient performance of parallel algorithms. The time-space trade-off involved in solution of the permulation routing problem uI mesh has been studied. Few algorithms for permutation routing on Multi-Mesh has been proposed. The first among these requires large buffers to be present in each processor. Another algorithm which requires no buffers has been proposed. Yet another algorithm which uses buffers of constant size has been proposed. An off-line algorithm which precomputes the paths to be taken by each packet off-line so as to route them without requirement of buffers in the processors has been proposed.


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.