The calculation of average distance in mesh structures

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The calculation of average distance in mesh structures

Full text

Pdf (312 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 2000 ACM symposium on Applied computing - Volume 1 table of contents

Como, Italy

Pages: 89 - 93

Year of Publication: 2000

ISBN:1-58113-240-9

Author

Zhizhang Shen

Department of Computer Science, Plymouth State College (USNH), Plymouth, NH

Sponsor

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 33, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions 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/335603.335707 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	Anton, H., Elementary Linear Algebra, John Wiley & Sons, Inc., New York, 1973.
	2	Bokhari, S. H., Finding maximum on an array processor with a global bus, IEEE Trans. Comput. 33 (1984) 133-139.
	3	Ralph Duncan, A Survey of Parallel Computer Architectures, Computer, v.23 n.2, p.5-16, February 1990 [doi>10.1109/2.44904]
	4	Gosper, R. W., Jr., Decision procedure for indefinite hypergeometric summation, in Proc. National Academy of Science o/ the United States of America 75(1978) 40-42.
	5	Ronald L. Graham , Donald E. Knuth , Oren Patashnik, Concrete mathematics: a foundation for computer science, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1989
	6	Himabindu Gurla, Leftmost one computation on meshes with row broadcasting, Information Processing Letters, v.47 n.5, p.261-266, Oct. 8, 1993 [doi>10.1016/0020-0190(93)90137-X]
	7	Vipin Kumar , Ananth Grama , Anshul Gupta , George Karypis, Introduction to parallel computing: design and analysis of algorithms, Benjamin-Cummings Publishing Co., Inc., Redwood City, CA, 1994
	8	F. Thomson Leighton, Introduction to parallel algorithms and architectures: array, trees, hypercubes, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1991
	9	Russ Miller , Quentin F. Stout, Parallel algorithms for regular architectures: meshes and pyramids, MIT Press, Cambridge, MA, 1996
	10	Moore, E. F., Machine models of selfrcproduction~ Proc. of the Symposium in Applied Mathematics 14(1962) 17-33.
	11	Nassimi, D., and Sahni, S., Finding connected components 'and connected ones on a meshconnected parallel computer, SIAM or. Computing 9(1980) 744-757.
	12	Petkov~ek, M., Wilf, H., and Zeilbcrger, D., A=B, A K Peters, Ltd., Wellesley, MA, 1996.
	13	Robert Sedgewick , Philippe Flajolet, An introduction to the analysis of algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1996
	14	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]
	15	Shen, Z., The average diameter of general tree structures. Computers f~ Mathematics with, Applications 36(7)(1998) 111-130.

CITED BY 3

	Zhizhang Shen, A routing algorithm for the pyramid structures, Proceedings of the 2001 ACM symposium on Applied computing, p.484-488, March 2001, Las Vegas, Nevada, United States
	Zhizhang Shen, An alternative routing algorithm for the pyramid structures, Proceedings of the 2003 ACM symposium on Applied computing, March 09-12, 2003, Melbourne, Florida
	L. Jonathan Dowell , Michael Lee Bruno, Connectivity of random graphs and mobile networks: validation of Monte Carlo simulation results, Proceedings of the 2001 ACM symposium on Applied computing, p.77-81, March 2001, Las Vegas, Nevada, United States