Can't get simpler searches than this!

Cray XMT™ System

The Cray XMT supercomputing system is a scalable massively multithreaded platform with a shared memory architecture for large-scale data analysis and data mining. The system is purpose-built for parallel applications that are dynamically changing, require random access to shared memory and typically do not run well on conventional systems.

Hey, Cray, get me mucho processors, working with big chunks of shared memory, and, no need to hire me, we can independently push the standards group to get your software architecture for Cray, then Cray can have boom times. Seriously, if these things are what they claim, then Cray can win big in the semantic convolution system.

Multithreaded technology is ideally suited for tasks such as pattern matching, scenario development, behavioral prediction, anomaly identification and graph analysis.

I bet they found my blog and added the last item about graph analysis. They should go back and alter the description and say the thing is designed for next generation semantic pattern matching, for the WWW.


The programming staff here at Imagisoft would start debugging code is they had access to one of these. The market model ere is tha tthe BSON approach is gointg to yield a combined data, variable expression streams built on the exposed nested store. It will be driven by a hgih performance BSON expression evaluator. So, the way I do the g engine, the nested store itself is self configuring, able to deliver expression sequences as well as semantic entity sequences, intermixed and properly nested with scoping rules that manage the pointer variable. That BSON code will have run as the kernel in each member of a group of procressers. Above these group of SMP processors is a Linux CPU, managing IO, mainly doing link jumps, but it is critical is does well with disk io. If we split SQLITE3, then the compiled ueries run on the SMP processors, and generic table/URL management running in the Linux CPU. The entire system would be nothing but a graph layer, with BSON overloads triggering special node matches.

Cambridge Semantics would love this.

.