Skip to main content

Active pixel merging on hypercube multicomputers

  • Conference paper
  • First Online:
High-Performance Computing and Networking (HPCN-Europe 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1067))

Included in the following conference 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 scanline 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.

This work is partially supported by Intel Supercomputer Systems Division grant no. SSD100791-2 and The Scientific and Technical Research Council of Turkey (TÜBITAK) grant no. EEEAG-5.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.C. Highfield and H.E. Bez, ‘Hidden surface elimination on parallel processors', Computer Graphics Forum, 11(5) 293–307 (1992).

    Google Scholar 

  2. D. Ellsworth, ‘A multicomputer polygon rendering algorithm for interactive applications', in Proc. of 1993 Parallel Rendering Symposium, San Jose, 43–48 (Oct. 1993).

    Google Scholar 

  3. S. Whitman, Multiprocessor Methods for Computer Graphics Rendering, Jones and Bartlett Publishers, Boston (1992).

    Google Scholar 

  4. M. Cox and P. Hanrahan, ‘Pixel merging for object-parallel rendering: A distributed snooping algorithm', in Proc. of 1993 Parallel Rendering Symposium, San Jose, 49–56 (Oct. 1993).

    Google Scholar 

  5. R. Scopigno, A. Paoluzzi, S. Guerrini, and G. Rumolo, ‘Parallel depth-merge: A paradigm for hidden surface removal', Comput. & Graphics, 17(5), 583–592 (1993).

    Google Scholar 

  6. J. Li and S. Miguet, ‘Z-buffer on a transputer-based machine', in Proc. of the Sixth Distributed Memory Computing Conf., IEEE Computer Society Press, 315–322 (April 1991).

    Google Scholar 

  7. S.F. Nugent, ‘The iPSC/2 direct-connect communications technology', in Proc. Third Conf. Hypercube Concurrent Comput. and Appl., 51–60 (Jan. 1988).

    Google Scholar 

  8. B. Abah, F. Özgüner, and A. Bataineh, ‘Balanced parallel sort on hypercube multiprocessors', IEEE Trans. on Parallel and Distributed Systems, 4(5), 572–581 (1993).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Heather Liddell Adrian Colbrook Bob Hertzberger Peter Sloot

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kurç, T.M., Aykanat, C., Özgüç, B. (1996). Active pixel merging on hypercube multicomputers. In: Liddell, H., Colbrook, A., Hertzberger, B., Sloot, P. (eds) High-Performance Computing and Networking. HPCN-Europe 1996. Lecture Notes in Computer Science, vol 1067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61142-8_565

Download citation

  • DOI: https://doi.org/10.1007/3-540-61142-8_565

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61142-4

  • Online ISBN: 978-3-540-49955-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics