PVM implementation of quadtree building algorithms on SIMD hypercube system

Author

Suresh, Hungenahally

Author_Institution

Sch. of Microelectron. Eng., Griffith Univ., Brisbane, Qld., Australia

Volume

2

fYear

1995

fDate

19-21 Apr 1995

Firstpage

855

Abstract

Representation of data using hierarchical data structures is commonly used in applications such as computer graphics, digital image processing, computer vision and techniques are being evolved for efficient representation of these data. Transforming bilevel images to linear quadtrees is a way of representing the high-volume data. In this paper, the preliminary investigation and results thus obtained for transforming binary images to linear quadtrees using Parallel Virtual Machine System Software are presented. Single Instruction Multiple Data hypercube algorithms implemented using PVM software was tested under DOS operating system on IBM compatible PCs. The quadtree algorithm generates locational codes in pre-order and generally runs in O(log n) time and this paper tested the feasibility of achieving this time for an SIMD machine

Keywords

hypercube networks; image processing; parallel algorithms; quadtrees; DOS operating system; IBM compatible PCs; PVM implementation; Parallel Virtual Machine System Software; SIMD hypercube system; Single Instruction Multiple Data hypercube algorithms; bilevel images; hierarchical data structures; linear quadtrees; quadtree building algorithms; Application software; Buildings; Computer graphics; Computer vision; Data structures; Digital images; Hypercubes; Software algorithms; System software; Virtual machining;

fLanguage

English

Publisher

ieee

Conference_Titel

Algorithms and Architectures for Parallel Processing, 1995. ICAPP 95. IEEE First ICA/sup 3/PP., IEEE First International Conference on

Conference_Location

Brisbane, Qld.

Print_ISBN

0-7803-2018-2

Type

conf

DOI

10.1109/ICAPP.1995.472277

Filename

472277