[XSL-LIST Mailing List Archive Home]
Re: [xsl] [XSL] Accessing part of the result tree illustrated with "The Sudoku solver" example.
Subject: Re: [xsl] [XSL] Accessing part of the result tree illustrated with "The Sudoku solver" example.|
From: David Carlisle <davidc@xxxxxxxxx>
Date: Wed, 5 Sep 2007 13:36:07 +0100
> Is it conceivable for a processor to parallelise the processing of a
> sequence of atomic values and then reassemble the results in sequence
> order, or does that only apply to nodes and document order?
Me, I'm a pure mathematician, I can conceive of all sorts of things.
Actually, without looking at any system sources, I don't see why
not. If you have some massively parallel machine and dispatch each
item to a different processor to be evaluated, whether the ordering
comes from nodes (which may have been sorted) or from an atomic
sequence, you just need to label each processing request by its
position() value, so when you get the results back (also with this same
label) you slot them in in the right order, don't you....
Unfortunately I don't think they'll be running xslt on hector
The Numerical Algorithms Group Ltd is a company registered in England
and Wales with company number 1249803. The registered office is:
Wilkinson House, Jordan Hill Road, Oxford OX2 8DR, United Kingdom.
This e-mail has been scanned for all viruses by Star. The service is
powered by MessageLabs.