Xref: utzoo comp.sources.wanted:16673 comp.lang.fortran:5379 comp.unix.cray:306
Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!think.com!spool.mu.edu!cs.umn.edu!msi.umn.edu!math.fu-berlin.de!unido!fauern!faui43.informatik.uni-erlangen.de!kssingvo
From: kssingvo@immd4.informatik.uni-erlangen.de (Klaus Singvogel)
Newsgroups: comp.sources.wanted,comp.lang.fortran,comp.unix.cray
Subject: Wanted: Mandelbrot vectorizeable in Fortran
Keywords: vecorizable algorithm
Message-ID: <1991May15.125842.6521@informatik.uni-erlangen.de>
Date: 15 May 91 12:58:42 GMT
Article-I.D.: informat.1991May15.125842.6521
Distribution: comp
Organization: CSD., University of Erlangen, Germany
Lines: 23

I'm searching for the Mandelbrot-algorithm in Fortran, which can be vectorized 
on a Cray-Ymp.
Please don't send me the usual algorithm - 'cause it cannot be vectorized with
the following depedecy of x:  ;-)

	...
	DO 30 i=1, X_PIXEL
		DO 30 j=1, Y_PIXEL
			DO 10 k=1, max_iteration
				x = x * x + c
				IF (abs(x).gt.4) GOTO 20
10 			CONTINUE
20		field(i,j)=k
		...
30	CONTINUE

							 
Thank's in advance,
	Klaus.
---
Name    : Klaus Singvogel
Nickname: Pacman
E-Mail  : kssingvo@medusa.informatik.uni-erlangen.de