iahmad@wotan.top.cis.syr.edu (Ishfaq Ahmad) (05/23/91)
I am looking for some references (books/papers) which could provide some
information about effecient data structures for parallel architectures,
particulary for distributed-memory message passing systems. I am
interested in knowing how to effecienctly store, manipulate and access
common serial data structures, when implemented on parallel machines.
The data structure can be rings, trees, graphs, linked lists, queues etc.
By effeciency I mean good locaity and reduced communication overhead.
Thanks in advance.
Ishfaq Ahmad
Suite 4-116
Department of Computer Science
Center for Science & Tech.
Syracuse University
Syracuse, NY 13244
--
=========================== MODERATOR ==============================
Steve Stevenson {steve,fpst}@hubcap.clemson.edu
Department of Computer Science, comp.parallel
Clemson University, Clemson, SC 29634-1906 (803)656-5880.mabellreynolds@park.bu.edu (John Reynolds) (05/23/91)
Of course, decision trees tesselate feature space by dividing regions into subregions recursively, placing hyperplanes that are perpendicular to the coordinate axis corresponding to the current decision point. Discriminant functions provide more general way of tesselating the space, which could include search tree tesselation. A good comparison is ID-3 with ARTMAP.