L. W. Tucker. Data Parallelism and Computer VisionUsing the Connection Machine. In L. P. Kartashev and S. I. Kartashev, editors, Proceedings Third International Conference on Supercomputing, Vol. 3, pages 35--41, Boston, MA, May 1988.  Home/Search   Document Not in Database   Summary   Related Articles

....small class of structured applications led to its virtual exclusion as a programmingmodel for MIMD machines. More recently, however, researchers have demonstrated that dataparallel languages are useful for applications as diverse as parsing [22] DNA sequence comparison [7, 14] object recognition [26], VLSI design [8, 6, 13] and computer graphics [5] and most of the parallel algorithms found in the literature for grids, hypercubes and Parallel RAM models are either data parallel or easily converted into such a form. Furthermore, the semantic simplicity of data parallel languages, and their ....

L. W. Tucker. Data Parallelism and Computer VisionUsing the Connection Machine. In L. P. Kartashev and S. I. Kartashev, editors, Proceedings Third International Conference on Supercomputing, Vol. 3, pages 35--41, Boston, MA, May 1988.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC