Active pixel merging on hypercube multicomputers
Author
Kurç, Tahsin M.
Aykanat, Cevdet
Özgüç, Bülent
Date
1996Source Title
High-Performance Computing and Networking
Electronic ISSN
1611-3349
Publisher
Springer, Berlin, Heidelberg
Volume
1067
Pages
319 - 326
Language
English
Type
Conference PaperItem Usage Stats
160
views
views
118
downloads
downloads
Abstract
This paper presents algorithms developed for pixel merging phase of object-space parallel polygon rendering on hypercube-connected multicomputers. These algorithms reduce volume of communication in pixel merging phase by only exchanging local foremost pixels. In order to avoid message fragmentation, local foremost pixels should be stored in consecutive memory locations. An algorithm, called modified seanline z-buffer, is proposed to store local foremost pixels efficiently. This algorithm also avoids the initialization of scanline z-buffer for each scanline on the screen. Good processor utilization is achieved by subdividing the image-space among the processors in pixel merging phase. Efficient algorithms for load balancing in the pixel merging phase are also proposed and presented. Experimental results obtained on a 16-processor Intel's iPSC/2 hypercube multicomputer are presented. © Springer-Verlag Berlin Heidelberg 1996.
Keywords
AlgorithmsGeometry
Merging
Network Management
Active Pixel
Hypercube
Image Space
Memory Locations
Multicomputers
Object Space
Processor Utilization
Z-Buffer
Pixels
Permalink
http://hdl.handle.net/11693/27743Published Version (Please cite this version)
https://doi.org/10.1007/3-540-61142-8_565https://doi.org/10.1007/3-540-61142-8