Path: utzoo!utgpu!jarvis.csri.toronto.edu!clyde.concordia.ca!mcgill-vision!bloom-beacon!snorkelwacker!tut.cis.ohio-state.edu!ucsd!ucsdhub!hp-sdd!ncr-sd!ncrcae!hubcap!kyriazis
From: kyriazis@herodotus.rdrc.rpi.edu (George Kyriazis)
Newsgroups: comp.parallel
Subject: Re: Advice on MS Thesis needed;Graphics in Parallel using X
Message-ID: <7891@hubcap.clemson.edu>
Date: 6 Feb 90 13:17:47 GMT
Sender: fpst@hubcap.clemson.edu
Lines: 27
Approved: parallel@hubcap.clemson.edu

In article <7883@hubcap.clemson.edu> narayan@atanasoff.cs.iastate.edu (Pankaj Narayan) writes:
>
>	So we propose a system whereby each of the processors (of the
>	parallel machine) be assigned one graphics screen, and that the
>	results computed by that processor be displayed on that screen. The
>	screens can then be placed side-by-side to give the final overall
>	result. (This would force us to distribute tasks in the same manner

Take a look at the SIGGraph 1989 proceedings, the volume on
'Hardware Advances in Computer Graphics'.  I agree with you that
graphics can ne a bottleneck (especially in the future), but your
approach will probably have granularity problems.  Interleaved
frame buffers usually perform better.

I think this book will answer many of your questions.  Some other
volumes of the same proceedings can also been enlighting (they
describe different algorithms or implementations of common problems).

>	Pankaj Narayan			narayan@atanasoff.cs.iastate.edu
>	246 N Hyland Apt. 306		Ames, IA 50010
>	515 292 5535


  George Kyriazis
  kyriazis@turing.cs.rpi.edu
  kyriazis@rdrc.rpi.edu
------------------------------