Active pixel merging on hypercube multicomputers

Date
1996
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
High-Performance Computing and Networking
Print ISSN
Electronic ISSN
1611-3349
Publisher
Springer, Berlin, Heidelberg
Volume
1067
Issue
Pages
319 - 326
Language
English
Journal Title
Journal ISSN
Volume Title
Series
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.

Course
Other identifiers
Book Title
Citation