Quadtree communication structure for fast data searching and distribution

Woei Lin, Tsang Ling Sheu, Chita R. Das

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The authors present a quadtree communication structure and two associated procedures for efficient, contention-free data searching and distribution on the BBN Butterfly parallel processor and its family. The proposed quadtree communication structure suggests a general approach to mapping a class of parallel algorithms with intensive communication requirements for performing two primitive operations: selecting data from many different sources and distributing data from a single source. While performing these two operations through the quadtree structure, the two ascend and descend procedures incur no link conflicts in the Butterfly network. A concrete example of mapping the linear programming algorithm is given to show the effectiveness of the proposed quadtree communication structure.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE Computer Society's International Computer Software & Applications Conference
EditorsGeorge J. Knafl
PublisherPubl by IEEE
Pages316-323
Number of pages8
ISBN (Print)0818608730
StatePublished - Dec 1 1988

Publication series

NameProceedings - IEEE Computer Society's International Computer Software & Applications Conference

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Quadtree communication structure for fast data searching and distribution'. Together they form a unique fingerprint.

Cite this