Programação Funcional e Concorrente com Scheme

notas de aula -
Jerônimo C. Pellegrini
( let ((q ( partition !! vec start end )))
( quicksort-sub ! vec start (- q 1))
( quicksort-sub ! vec (+ 1 q) end )))))
( define quicksort !
( lambda ( vec )
( quicksort-sub ! vec 0 (- ( vector-length vec ) 1))))
Uma versão paralela do Quicksort poderia criar processos para ordenar as duas
partições do vetor:
( define node ( make-node " 127.0.0.1 " 10000))
( node-init node )
( define quicksort-par-sub !
( lambda ( vec start end client )
( let (( me ( self )))
(if (< start end )
( let ((q ( partition !! vec start end )))
( let ((a ( spawn ( lambda ()
( quicksort-par-sub ! vec
start
(- q 1)
me ))))
(b ( spawn ( lambda ()
( quicksort-par-sub ! vec
(+ 1 q)
end
me )))))
( recv ( msg
( where ( member msg ( list a b )))))
( recv ( msg
( where ( member msg ( list a b ))))))))
(! client me ))))
Versão Preliminar
( define quicksort-par !
( lambda ( vec )
( quicksort-par-sub ! vec
0
304
[ 27 de outubro de 2010 at 15:47 ]