On Jan 30, 2009, at 3:09 PM, Florian Fischer wrote:
My question is: is there a simple way to identify nodes in the Rete
network that have an excessive number of facts?
The "view" function draws you a graphical representation of the whole
Rete network, or the network for one rule (pass the name as the
argument.) You can double-click on each node to get some info; the
info for the join nodes includes the memory contents, so if you do
this on a system populated with data, you'll see which join nodes have
huge memories (and therefore possibly long search times.) The
"matches" command does something similar, but non-graphically.
Or is there a way to profile a Rete network to identify which part of
the network sucks up all the processing time?
Thanks in advance,
Florian Fischer
--
Florian Fischer
Service d'Informatique Médicale
Hôpitaux Universitaires de Genève
Tél: 022 37 28861
[email protected]
--------------------------------------------------------------------
To unsubscribe, send the words 'unsubscribe jess-users
[email protected]'
in the BODY of a message to [email protected], NOT to the list
(use your own address!) List problems? Notify [email protected]
.
--------------------------------------------------------------------
---------------------------------------------------------
Ernest Friedman-Hill
Informatics & Decision Sciences Phone: (925) 294-2154
Sandia National Labs
PO Box 969, MS 9012 [email protected]
Livermore, CA 94550 http://www.jessrules.com
--------------------------------------------------------------------
To unsubscribe, send the words 'unsubscribe jess-users [email protected]'
in the BODY of a message to [email protected], NOT to the list
(use your own address!) List problems? Notify [email protected].
--------------------------------------------------------------------
