Is this Java design idea practical? (Flow Scheduler and Particle Rice Optimization)

Question

In the multi-core block, Java thread scheduler decisions are fairly arbitrary; it assigns thread priorities based on when the thread was created, from which the thread was created, etc.

The idea is to start the tuning process with pso, which would randomly prioritize the threads and then ultimately reach the optimal priorities when the fitness function is the total execution time of the program?

Of course, there will be more parameters, for example, priorities will be shifted during the run to find the optimal priority function.

How practical, interesting does the idea sound? and any suggestions. Just some kind of background, ive been programming in java / c / C ++ for several years with various projects, another alternative would be to create a thread scheduler based on this in c, where the default thread scheduler is the OS.

Answer 1

The best way to find out is to run an open source project and see how people use / react.

I am very interested, but I personally am not very helpful. Perhaps we are simply not at the point where concurrent programming is as common and easy as it could be.

, , ( , )

, , 90% . . , .

! . , :)

Answer 2

, , , .. , , .

, , . , , . , , , , , , ( , , java ).

, - , . , (), , . , , , .

, , , , .