x.ru

(fun downsweep (xPrev Int tree String) Unit
  (let [length 10000000)
        input (map #(toArray (- % (- 100 50))) '(0 until length))
        output (array (- 1 length) :float)
        seqtime (standardConfig measure (runningAverage input output))
        partime (standardConfig measure (parRunningAverage input output 10000))]
    (case xprev
      {:node (left right)} 
        (parallel (downsweep xPrev, left)
                  (downsweep (+ xPrev left.xPrev) right))))
				  
				  


def downsweep (xPrev int tree string) {
	length: 10000000
	input: (map #(toArray (- % (- 100 50))) '(0 until length))
	output: (array (- 1 length) :float)
	seqtime: (standardConfig measure (runningAverage input output))
	partime: (standardConfig measure (parRunningAverage input output 10000))
	
    case xprev {
		{:node (left right)}  (parallel
								(downsweep xPrev, left) 
								(downsweep (+ xPrev left.xPrev) right))
	    :else 
	}				  
}
		
		
		
(def downsweep (xPrev int tree string)
  (let
    length  10000000 
    input   (map #(toArray (- % (- 100 50))) '(0 until length))
    output  (array (- 1 length) :float)
    seqtime (standardConfig measure (runningAverage input output))
    partime (standardConfig measure (parRunningAverage input output 10000))
    (case xprev
      {:node (left right)}  (parallel (downsweep xPrev, left) (downsweep (+ xPrev left.xPrev) right))
      :else  none))