![]() ![]() From wiki,Īmdahl's law states that if P is the proportion of a program that can be made parallel (i.e., benefit from parallelization), and (1 ? P) is the proportion that cannot be parallelized (remains serial), then the maximum speedup that can be achieved by using N processors is ![]() ![]() Ideally assuming your threads do not have locking such that they do not block each other (independent of each other) and you can assume that the work load (processing) is same, then it turns out that, have a pool size of Runtime.getRuntime().availableProcessors() or availableProcessors() + 1 gives the best results.īut say, if threads interfere with each other or have I/O inlvolved, then Amadhal's law explains pretty well.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |