Implement Matrix operations in Java or in C++ through JNI? -


i trying accomplish mna(modified nodal analysis) in java circuit solvers . involve solving ton of linear equations , ended matrix algebra . mtj , couple of other java libraries great i'm tasked implementing on own , did in java since entire project in java. wondering if should go ahead java implementation or doing in c++ through jni give better enough performance warrant implementation? i'm concerned bottleneck jni incur when passing matrices order of ten thousand , above or not problem?

my strongest recommendation not attempt optimise code performance develop it. impossible know ahead of time code needs optimising. end less readable, maintainable code doesn't perform better.

  1. develop library in java aiming maximum clarity , correctness. ignore performance.

  2. benchmark performance against realistic loads. example if need process millions of matrices test how long take.

  3. decide if have problem. modern hardware coupled performance elements of jre mean there far fewer situations in needs done @ stage. if needs done, consider running on more powerful machine instead of optimising code. that's cheaper option.

  4. if need optimise code, use profiler find bottlenecks. there few small areas consume majority of resources. can waste lot of time optimising code has little impact.

  5. optimise code in bottlenecks. there ton of resources out there this. rerun benchmarks regularly make sure making difference. unwind optimisations turn out make no difference.


Comments

Post a Comment

Popular posts from this blog

neo4j - finding mutual friends in a cypher statement starting with three or more persons -

Image
i trying build cypher statement neo4j know 2-n starting nodes name , need find node (if any) can reached of starting nodes. at first tought similar "mutual friend" situation handled (start1)-[*..2]->(main)<-[*..2]-(start2) in case have more 2 starting points around 6 know name. so puzzled how can include third, fourth , on node cypher able find commmon root amongst them. in above example neo4j website need path starting 'dilshad', 'becky' , 'cesar' check if have common friend (anders) excluding 'filipa' , 'emil' not friends of three. so far create statement programmatically looks like match (start1 {name:'person1'}), (start2 {name:'person2'}), (start3 {name: 'person3'}), (main) (start1)-[*..2]->(main) , (start2)-[*..2]->(main) , (start3)-[*..2]->(main) return distinct main but wondering if there more elegant / efficient way in cypher possibly use list of names parameter ...
Read more

php - How to remove letter in front of the word laravel -

Image
based on picture above result of var_dump() , dd() of same variable ,when var_dump() , apostrophe (') symbol in black diamond of question mark , when dd() same variable , apostrophe can seen letter 'b' appear in front of words what want can me result : loreal's sdn bhd and @ same time want remove special character ( excluding these 4 symbols (-) ,(_) ,('),(,) ) simply escape special character resolve issue. mysqli_real_escape_string resolve issue. $name = mysqli_real_escape_string($request()->user); or use addslashes function() $name = addslashes($request()->user);
Read more

minify - Minimizing css files -

i want know how css files can minimized. currently, using external sites css minifier compress css files. however, after removing whitespaces, comments, etc, file sizes reduced 10-15%. how frameworks bootstrap manage make minimized versions kilobytes. as example, css is: body { background-color: #ff0; } the reduction goes 28 bytes 22 bytes other css files have lot more characters still smaller this. actually minifying code means it's remove thing code white space characters new line characters comments block delimiters it reduces amount of code has transferred on web , speed site load fastly.but unreadable format.
Read more