The subtree processing model of XSLT seems to make it a good
application for parallel processing (i.e. using multiple CPUs to
process different subtrees simultaneously).  Since many people have
remarked on the inherent slowness of XSLT processors, I wonder if
anyone has succeeded in creating an XSLT processor that successfully
divides the work among different processors, resulting in a gain of
processing speed.  Has anyone tried this?  Some of the implementations
are written in Java, such as XT.  Do they use multi-threading and can
they take advantage of multiple CPUs?


-- 
Erik Ray
O'Reilly and Associates


 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list