VII) Bibliography

1) C.S. Yang, Y.M.Tsai, S.L. Chi and Shepherd S.B. Shi, Adaptive Wormhole Routing in k-ary n-Cubes,
Parallel Computing 21 (Jan 1995) 1925-1943.

2) Howard J. Siegel and Craig B. Stunkel, Inside Parallel Computers: Trends in Interconnection Networks,
IEEE Computational Science and Engineering v3n3 (Fall 1996) 69-71.

3) Philip P. To and Tony T. Lee, The Multi-dimensional Shuffle-exchange Network: A Novel Topology for
Regular Network Architectures, IEEE Infocom VI (1998) 110-117.

4) Shahram Latifi, Design of Bounded-Degree Circuits for Parallel Processing, IEEE Transactions on
Circuits and Systems-II v41n6 (June 1994) 428-431.

5) Emmanouel A. Varvarigos and Dimitri P. Bertsekas, A Conflict Sense Routing Protocol and Its Performance
for Hypercubes, IEEE Transactions on Computers v45n6 (June 1996) 693-703.

6) Sergio Felperin, Prabhakar Raghavan, and Eli Upfal, A Theory of Wormhole Routing in Parallel Computers,
IEEE Transactions on Computers v45n6 (June 1996) 704-713.

7) Smaragda Konstantinidou, Adaptive, Minimal Routing in Hypercubes, Advanced Research in VLSI (1990)
139-153.

8) Mark A. Firth, Andrew Jones, and Carol Wright, Performance/Cost Analyses for Common Network Topologies,
Microprocessors and Microsystems 21 (1998) 499-509.

9) Culler, D. E. and J.P. Singh, Parallel Computer Architecture: A Hardware/Software Approach ,
San Francisco: Morgan Kaufmann. 1998.