How to Identify Complexity of IBM ODM Rules Based Applications? -


i know, how complexity of rule based application can measured?

is there standard way defined ibm ?

or function point measure complexity of software based application

complexity can based on parameters 1) parameters being passed / 2) number of rules present / 3) database ups / 4) network latency / 5)ruleset parsing time / 6) ruleset execution time / 7) application design / 8) execution unit configuration / 9) configure xom / 10) asynchronous ruleset parsing / 11) connection pool size / 12) res server configuration / 13) xu configuration / 14) reduce trace in server logs

can please me understand standard way ibm recommend or decided application architect ?

any , inputs appreciated... in advance.

there no defined way of measuring 'complexity' of odm application. however, should make sure use correct topology needs (see deployment architecture odm documentation), , appropriate design decisions performance requirements (see odm documentation @ overview: affects performance of decision server application , improving performance of rule execution server.)

there improve performance ibm odm series on developerworks, discusses in detail possible configurations , impact on performance, including parameters mentioned. dw answers has few entries on odm performance listed in improve performance of odm modules.


Comments

Post a Comment

Popular posts from this blog

c++ - Difference between pre and post decrement in recursive function argument -

i have following sample code used pre-decrement void function(int c) { if(c == 0) { return; } else { cout << "dp" << c << endl; function(--c); cout << c << endl; return; } } this function give output input 4 : dp3 dp2 dp1 dp0 0 1 2 3 but when use post decrement void function(int c) { if(c == 0) { return; } else { cout << "dp" << c << endl; function(c--); cout << c << endl; return; } } output goes in infinite loop dp4 can explain me in detail why happens ? this happens because function(c--) called same value of c , when finishes c decremented. recursively called, hence called same value no chance of return , hit stack overflow error. assume this, int x = 1, y = 0; y = x++ result y == 1 , x == 2. if y = ++x , bot x , y 2.
Read more

php - Nothing but 'run(); ' when browsing to my local project, how do I fix this? -

i added new project. made mistake in projectname.conf file in sites-available apache2, led me reinstalling apache2. after reinstalling , re-enabling projects on every page of every project .. <body> run(); </body> .. i've run composer update, restarted service, restarted pc, checked config files, tried disabling new project. there nothing in error log, , access.log: 127.0.0.1 - - [15/may/2015:01:40:47 +0200] "get / http/1.1" 304 181 "-" "mozilla/5.0 (x11; ubuntu; linux x86_64; rv:38.0) gecko/20100101 firefox/38.0" maybe i'm forgetting apache2 reinstall? don't think did different last time installed it. looks haven't setup php correctly. take @ this great guide , maybe you're forgetting link php config apache2.
Read more

php - How can I echo out this array? -

i don't know how go grabbing data in variable , put foreach loop. class tree{ private $info = array( array('name'=>'jim','state'=>'nu','company'=>'nu','phone'=>array('cell'=>'5615111111','office'=>'5611111111'),'email'=>array('primary'=>'exs@example.com','ex@there.com')), array('name'=>'joe smith','city'=>'phoenix','phone'=>'4805551111','email'=>'jsmith@some_email.com'), array('name'=>'john doe','city'=>'chandler','company'=>'doe co.','email'=>array('jdoe@gmail.com','personal'=>'email@email.com'),'phone'=>'6025550002') ); } if you're inside of class, can access private variable using $this->variablename . example, i...
Read more