Difference: Scone (2 vs. 3)

Revision 32006-11-16 - FabrizioMorbini

Line: 1 to 1
 
META TOPICPARENT name="SKIL"

Paper 1

Line: 53 to 53
 
  • current machine are much faster than what was available when NETL has been designed.
  • the parallel core is small and simple and can be efficiently implemented on a modern sequential machine.
    • intersection is one of the most common operations to do. In SCONE, intersection of M sets each of size N_i is done in time \Sum_{i=1}^{M}{N_i}+min_{0<i<=M}{N_i} by marking all elements of set i with marker i and then checking the smallest of the M sets to see wihch elements have all the M markers set.
Changed:
<
<
  • this method is more efficient of focused then a general resolution based theorem prover (though it is not complete).
>
>
  • this method is more efficient and focused then a general resolution based theorem prover (though it is not complete).
 
  • it can be easily adapted to use cluster and vector machines.
Changed:
<
<
  • the high focus obtain by this method helps in keeping contained the effects of inconsistencis present in the KB
>
>
  • the high focus obtained by this method helps to keep contained the effects of inconsistencies present in the KB
  Key characteristics of the sequential implementation:
  • the marker bits are a contiguous set of bits in memory (so, a logical AND on a 32 bit machine can simultaneously intersect 32 markers in one clock cycle).
 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2017 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding URCS? Send feedback