Multisearch techniques for implementing data structures on a mesh-connected computer (preliminary version)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Multisearch techniques for implementing data structures on a mesh-connected computer (preliminary version)

Full text

Pdf (1.11 MB)

Source

ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the third annual ACM symposium on Parallel algorithms and architectures table of contents

Hilton Head, South Carolina, United States

Pages: 204 - 214

Year of Publication: 1991

ISBN:0-89791-438-4

Authors

Mikhail J. Atallah	Department of Computer Science, Purdue University, West Lafayette, IN
Frank Dehne	School of Computer Science, Carleton University, Ottawa, Canada K1S 5B6
Russ Miller	Department of Computer Science, State University of New York at Buffalo, Buffalo, NY
Andrew Rau-Chaplin	School of Computer Science, Carleton University, Ottawa, Canada K1S 5B6
Jyh-Jong Tsay	National Chung Cheng University, Inst. of Comp. Sci. and Inform. Eng., Chiayi, Taiwan 62107, ROC

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 17, Citation Count: 4

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/113379.113398 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.

	AH86	Mikhail J Atallah , Susanne E Hambrusch, Solving tree problems on a Mesh-connected processor Array, Information and Control, v.69 n.1-3, p.168-187, April/May/June 1986 [doi>10.1016/S0019-9958(86)80046-8]
	DK87	N. Dadoun , D. G. Kirkpatrick, Parallel processing for efficient subdivision search, Proceedings of the third annual symposium on Computational geometry, p.205-214, June 08-10, 1987, Waterloo, Ontario, Canada [doi>10.1145/41958.41980]
	DSS88	F. Dehne , J. R. Sack , I. Stojmenovic, A note on determining the 3-dimensional convex hull of a set of points on a mesh of processors, No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory, p.154-162, January 1988, Halmstad, Sweden
	DR90	Frank Dehne , A. Rau-Chaplin, Implementing data structures on a hypercube multiprocessor, and applications in parallel computational geometry, Journal of Parallel and Distributed Computing, v.8 n.4, p.367-375, Apr. 1990 [doi>10.1016/0743-7315(90)90135-C]
	Ede83a	H. Edelsbrunner. A new approach to rectangle intersections- Part I. International Journal of Computer Mathematics, 13:209- 219, 1983.
	HI90	J.A. Holey and O. H. ibarra. Triangulation in a Plane and 3-D convex hull on Mesh- Connected Arrays and Hypercubes. Tech. Rep., Univ. of Minnesota, Dept. of Computer Science, 1990.
	Kir83	D.G. Kirkpatrick. Optimal search in planar subdivisions. SlAM Journal o} Computing, 12(1):28-35, 1983.
	LPJC90	D.T. Lee, F. P. Preparata, C.S. Jeong and A. L. Chow. SIMD Parallel Convex Hull Algorithms, manuscript.
	PVS83	Wolfgang J. Paul , Uzi Vishkin , Hubert Wagener, Parallel Dictionaries in 2-3 Trees, Proceedings of the 10th Colloquium on Automata, Languages and Programming, p.597-609, July 18-22, 1983

CITED BY 4

	Susanne Hambrusch , Xin He , Russ Miller, Parallel algorithms for gray-scale image component labeling on a mesh-connected computer, Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, p.100-108, June 29-July 01, 1992, San Diego, California, United States
	Jyh-Jong Tsay, Searching tree structures on a mesh of processors, Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, p.114-123, September 1992, Orlando, Florida, United States
	Abhiram Ranade, Maintaining dynamic ordered sets on processor networks, Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, p.127-137, June 29-July 01, 1992, San Diego, California, United States
	Michael T. Goodrich, Randomized fully-scalable BSP techniques for multi-searching and convex hull construction, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.767-776, January 05-07, 1997, New Orleans, Louisiana, United States