Ray Kim Sounds like it could be an interesting project for next year’s gsoc. To write a decent proposal, you spend a bit of time looking at the existing schedulers and how they interact with the task creation and destruction, context switching and stack allocation, because unfortunately, that’s where most of the overheads in our current scheduling lie.
I am not familiar with all of the scheduling algorithms that you listed below - I suspect that they make use of cost functions to determine which tasks should be executed next. Are there specific use cases where certain scheduling algorithms are more applicable than others? If there is a paper you can suggest I read that compares some of the trade offs, it’d be nice to have a look at it. (I quickly googled, but don’t have time to read all the stuff I found, so maybe you could suggest a good one). JB From: hpx-users-boun...@stellar.cct.lsu.edu <hpx-users-boun...@stellar.cct.lsu.edu> On Behalf Of ??? Sent: 07 November 2018 04:44 To: hpx-users@stellar.cct.lsu.edu Subject: [hpx-users] More scheduling algorithms Hi everyone, I'm a student from Korea researching scheduling algorithms. I noticed that HPX only has a limited number of scheduling algorithms. What do you think if I propose to add more scheduling algorithms to HPX for GSoC 2019? Notably the Factoring, Adaptive Factoring, Tapering, Trapezoid, Quadratic schedules. Ray Kim [https://mail.naver.com/readReceipt/notify/?img=udFcazJobr9SFqK9MqmsKrKmKo2dpoFCa6KqK6MqpxKmFopCFzUqKxJgMr9TM40npB%2B0Mogq74lR74lcWNFlbX30WLloWrdQarCmDV99brkZbdIq%2BzknWzJZ74Fo%2BVlnbXE5p639.gif]
_______________________________________________ hpx-users mailing list hpx-users@stellar.cct.lsu.edu https://mail.cct.lsu.edu/mailman/listinfo/hpx-users
