Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References and Suggested Reading
Al-Hajery, M. Z., and K. E. Batcher, “On the Bit-Level Complexity of Bitonic Sorting Networks,” Proc. Int. Parallel Processing Conf., 1993, Vol. III. pp. 209–213.
Arden, B. W., and H. Lee, “Analysis of Chordal Ring Networks,” IEEE Trans. Computers, Vol. 30, No. 4, pp. 291–295, April 1981.
Bermond, J.-C., F. Comellas, and D. F. Du, “Distributed Loop Computer Networks: A Survey,” J. Parallel Distributed Computing, Vol. 24, No. 1, pp. 2–10, January 1995.
Cheng, W.-J., and W.-T. Chen, “A New Self-Routing Permutation Network,” IEEE Trans. Computers, Vol. 45, No. 5, pp. 630–636, May 1996.
Corbett, P. F., “Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks,” IEEE Trans. Parallel Distributed Systems, Vol. 3, No. 5, pp. 622–626, September 1992.
Day, K., and A. Tripathi, “A Comparative Study of Toplogical Properties of Hypercubes and Star Graphs,” IEEE Trans. Parallel Distributed Systems, Vol. 5, No. 1, pp. 31–38, January 1994.
Day, K., and A.-E. Al-Ayyoub, “The Cross Product of Interconnection Networks,” IEEE Trans. Parallel Distributed Systems, Vol. 8, No. 2, pp. 109–118, February 1997.
Efe, K., and A. Fernandez, “Mesh-Connected Trees: A Bridge Between Grids and Meshes of Trees,” IEEE Trans. Parallel Distributed Systems, Vol. 7, No. 12, pp. 1281–1291, December 1996.
Even, G., and S. Even, “Embedding Interconnection Networks in Grids via the Layered Cross Product,” Proc. 3rd Italian Conf. Algorithms and Complexity, Rome, March 1997, pp. 3–12.
Kendall Square Research, “KSRl Technology Background,” 1992.
Kwai, D.-M., and B. Parhami, “A Generalization of Hypercubic Networks Based on Their Chordal Ring Structures,” Information Processing Letters, Vol. 6, No. 4, pp. 469–477, 1996.
Kwai, D.-M., and B. Parhami, “A Class of Fixed-Degree Cayley-Graph Interconnection Networks Derived by Pruning k-ary n-cubes,” Proc. Int. Conf. Parallel Processing, 1997, pp. 92–95.
Latifi, S., M. M. de Azevedo, and N. Bagherzadeh, “The Star Connected Cycles: A Fixed-Degree Network for Parallel Processing,” in Proc. Int. Parallel Processing Conf., 1993, Vol. I, pp. 91–95.
Leighton, F. T., Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, 1992.
Mans, B., and N. Santoro, “Optimal Fault-Tolerant Leader Election in Chordal Rings,” Proc. 24th Int. Symp. Fault-Tolerant Computing, June 1994, pp. 392–401.
Parhami, B., “Periodically Regular Chordal Ring Networks for Massively Parallel Architectures,” Proc. 5th Symp. Frontiers Massively Parallel Computation, February 1995, pp. 315–322. [Extended version to appear in IEEE Trans. Parallel Distributed Systems.]
Ponnuswamy, S., and V. Chaudhary, “A Comparative Study of Star Graphs and Rotator Graphs,” in Proc. Int. Parallel Processing Conf., 1994, Vol. I, pp. 46–50.
Reichmeyer, F., S. Hariri, and K. Jabbour, “Wormhole Routing on Multichannel Ring Networks,” Proc. 36th Midwest Symp. Circuits and Systems, August 1993, pp. 625–628.
Scherson, I. D., and A. S. Youssef, Interconnection Networks for High-Performance Parallel Computers, IEEE Computer Society Press, 1994.
Valerio, M., L. E. Moser, P. M. Melliar-Smith, and P. Sweazey, “The QuickRing Network,” Proc. ACM Computer Science Conf., 1994.
Waksman, A., “A Permutation Network,” J. ACM, Vol. 15, No. 1, pp. 159–163, January 1968.
Yeh, C.-H., and B. Parhami, “A New Representation of Graphs and Its Applications to Parallel Processing,” Proc. Int. Conf. Parallel and Distributed Systems, 1998, to appear.
Youssef, A., “Design and Analysis of Product Networks,” Proc. 5th Symp. Frontiers Massively Parallel Computation, February 1995, pp. 521–528.
Rights and permissions
Copyright information
© 2002 Kluwer Academic Publishers
About this chapter
Cite this chapter
(2002). A Sampler of Other Networks. In: Introduction to Parallel Processing. Series in Computer Science. Springer, Boston, MA. https://doi.org/10.1007/0-306-46964-2_16
Download citation
DOI: https://doi.org/10.1007/0-306-46964-2_16
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-306-45970-2
Online ISBN: 978-0-306-46964-0
eBook Packages: Springer Book Archive