Average diameter of network structures and its estimation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Average diameter of network structures and its estimation

Full text

Pdf (451 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 1998 ACM symposium on Applied Computing table of contents

Atlanta, Georgia, United States

Pages: 593 - 597

Year of Publication: 1998

ISBN:0-89791-969-6

Author

Zhizhang Shen

Dept. of Computer Science, Plymouth State College (USNH), Plymouth, NH

Sponsors

SIGADA: ACM Special Interest Group on Ada Programming Language
SIGCUE: ACM Special Interest Group on Computer Uses In Education
SIGAPP: ACM Special Interest Group on Applied Computing
SIGBIO: ACM Special Interest Group on Biomedical Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 32, Citation Count: 0

Additional Information:

references index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/330560.330973 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Reuven Cohen , Baiju V. Patel , Frank Schaffa , Marc Willebeek-LeMair, The sink tree paradigm: connectionless traffic support on ATM LAN's, IEEE/ACM Transactions on Networking (TON), v.4 n.3, p.363-374, June 1996 [doi>10.1109/90.502235]
	2	Drexel, P., Rucinski, A., and Shen, Z., A probabilistic model of a mesh system with distributed routing, in Proc. of the Pacific- Rim International Conference on Modeling, Simulation and Identification. Vancouver, BC, Canada, 1992, pp. 39-42.
	3	Leiserson, C.E.. Fat-trees: universal networks for hardware efficient supercomputing, in Proc. of the 1985 International Conference on Parallel Processing, 393-402, 1985.
	4	F. Thomson Leighton, Introduction to parallel algorithms and architectures: array, trees, hypercubes, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1991
	5	Jie Li , Hisao Kameda, Optimal load balancing in tree networks with two-way traffic, Computer Networks and ISDN Systems, v.25 n.12, p.1335-1348, July 1993 [doi>10.1016/0169-7552(93)90023-W]
	6	Hong Liu , Wei-Ming Lin , Yongsheng Song, An efficient processor partitioning and thread mapping strategy for mesh-connected multiprocessor systems, Proceedings of the 1997 ACM symposium on Applied computing, p.403-412, April 1997, San Jose, California, United States [doi>10.1145/331697.332322]
	7	Lin, W., Private communication, 1997.
	8	Russ Miller , Quentin F. Stout, Parallel algorithms for regular architectures: meshes and pyramids, MIT Press, Cambridge, MA, 1996
	9	Zhizhang Shen, Static behavior analysis of a mesh system, Information Processing Letters, v.47 n.6, p.295-299, Oct. 18, 1993 [doi>10.1016/0020-0190(93)90075-K ]
	10	Shen, Z., A mathematical model for mesh's dynamic behavior, Computers ~4 Mathematical Application 28(6)(1994) 25-32.
	11	Zhizhang Shen, The average diameter of binary tree structures, Proceedings of the 1997 ACM symposium on Applied computing, p.40-44, April 1997, San Jose, California, United States [doi>10.1145/331697.331707]
	12	Shen, Z., The average diameter of general tree structures. Accepted for publication in Computers ~4 Mathematical Application, Pergoman Press, England.
	13	Salvatore J Stolfo , Daniel P Miranker, DADO: a tree-structured architecture for artificial intelligence computation, Annual review of computer science vol. 1, 1986, Annual Reviews Inc., Palo Alto, CA, 1986
	14	Thinking Machine Corporation, The CM~5 Technical Summary, Cambridge, MA, !991.