Sheep,
Touché.
Have a good night,
Rui
> -----Original Message-----
> From: [log in to unmask] [mailto:[log in to unmask]] On
> Behalf Of Nick Dalton
> Sent: 19 April 2005 22:58
> To: [log in to unmask]
> Subject: Re: [SPACESYNTAX] Seeking a list of space syntax algorithms
>
> >
> >To end this message on a smile, I like to set a challenge to our friend
Rui.
> >Please Rui, if you like to show off big way, could you please show
> >and tell the Space Syntax community how to reduce to one hour the
> >time it takes to compute 650 000 VGA nodes. At the moment it takes
> >only a mere 1045 hours on a Pentium IV 3800 Mhz with 1Gb Ram with
> >plenty of virtual memory - I suppose parallel computing may do, what
> >do you think? Could you do it, and we promise we won't pass it has
> >ours either.
> >For designer 1045 hours is still years to wait, yet it is only just
> >44 days ;-)
>
> Hmmm. I'll take a bite at that, can't promise an hour but I think I
> can reduce it down by a credible amount and without running in
> parallel. (see previous posting).
>
> Email me the data file (simulated or otherwise), this is computing
> step depth for a graph with 650 000 nodes ? I'll take a crack at
> it. If I get anywhere I'll post back to the group.
>
>
> sheep
|