Hi John, It seems to me that the scheduling algorithms your thinking are task scheduling algorithms, am I right? The scheduling algorithms I listed are chunk scheduling algorithms (or loop scheduling). They try to determine how many chunks they should bundle in order to achieve maximum performance. In the HPX context the job would be to add executors along guided, auto, anddynamic. (hpx/parallel/executors) There was a recent experimental review paper on the subject [1] I recommend this one. By the way if there is a task scheduling algorithm you can suggest, I think I would more than happy to look into it.
Ray Kim Sogang University [1] Ciorba, Florina & Iwainsky, Christian & Buder, Patrick. (2018). OpenMP Loop Scheduling Revisited: Making a Case for More Schedules. 14th International Workshop on OpenMP, IWOMP 2018, Barcelona, Spain, September 26–28, 2018, Proceedings -----Original Message----- From: "Biddiscombe, John A."<biddi...@cscs.ch> To: "hpx-users@stellar.cct.lsu.edu"<hpx-users@stellar.cct.lsu.edu>; Cc: Sent: 2018-11-07 (수) 16:45:51 Subject: Re: [hpx-users] More scheduling algorithms 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
_______________________________________________ hpx-users mailing list hpx-users@stellar.cct.lsu.edu https://mail.cct.lsu.edu/mailman/listinfo/hpx-users
