Although case is solved, I will post description for testcase program. Just in case someone wonder or would like to keep it for some later tests. ------------------------------------------------------------------------ It is a parallel model checker. The command line you used does reachability on the state space of mode anderson.6, meaning that it searches through all possible states (int vectors). Each thread gets a vector from the queue, calculates its successor states and puts them in a lock-less static hash table (pseudo BFS exploration because the threads each have there own queue). How did ingo run the binary? Because the static table size should be chosen to fit into memory. "-s 27" allocates 2^27 * (|vector| + 1 ) * sizeof(int) bytes. |vector| is equal to 19 for anderson.6, ergo the table size is 10GB. This could explain the huge number of page faults ingo gets. But anyway, you can imagine that the code is quiet jumpy and has a big memory footprint, so the page faults may also be normal. ------------------------------------------------------------------------ On Mar 23, 2010, at 7:13 PM, Andrew Morton wrote: > Anton, we have an executable binary in the bugzilla report but it would > be nice to also have at least a description of what that code is > actually doing. A quick strace shows quite a lot of mprotect activity. > A pseudo-code walkthrough, perhaps? > > Thanks. -- To unsubscribe, send a message with 'unsubscribe linux-mm' in the body to majordomo@xxxxxxxxxx For more info on Linux MM, see: http://www.linux-mm.org/ . Don't email: <a href=mailto:"dont@xxxxxxxxx";> email@xxxxxxxxx </a>