Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!ogicse!emory!hubcap!fpst
From: iahmad@wotan.top.cis.syr.edu (Ishfaq Ahmad)
Newsgroups: comp.parallel
Subject: parallel data structures
Message-ID: <1991May23.120025.17495@hubcap.clemson.edu>
Date: 22 May 91 23:45:58 GMT
Sender: fpst@hubcap.clemson.edu (Steve Stevenson)
Reply-To: iahmad@top.cis.syr.edu (Ishfaq Ahmad)
Organization: CIS Dept., Syracuse University
Lines: 23
Approved: parallel@hubcap.clemson.edu

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.mabell