Thread 'We've improved and simplified the CPU scheduling and work-fetch policies, using a detailed simulation of BOINC's weighted round-robin scheduling. When the simulator predicts that a deadline will be missed, the client switches to earliest-dead'

Message boards : News : We've improved and simplified the CPU scheduling and work-fetch policies, using a detailed simulation of BOINC's weighted round-robin scheduling. When the simulator predicts that a deadline will be missed, the client switches to earliest-dead
Message board moderation

To post messages, you must log in.

AuthorMessage
ProfileDavid Anderson
Volunteer moderator
Project administrator
Project developer
Avatar

Send message
Joined: 10 Sep 05
Posts: 732
Message 29975 - Posted: 24 Jun 2005, 0:00:00 UTC

We've improved and simplified the CPU scheduling and work-fetch policies, using a detailed simulation of BOINC's weighted round-robin scheduling. When the simulator predicts that a deadline will be missed, the client switches to earliest-deadline-first scheduling. When the simulator predicts that fetching additional work will cause a deadline to be missed, it suspends work fetch.
ID: 29975 · Report as offensive

Message boards : News : We've improved and simplified the CPU scheduling and work-fetch policies, using a detailed simulation of BOINC's weighted round-robin scheduling. When the simulator predicts that a deadline will be missed, the client switches to earliest-dead

Copyright © 2025 University of California.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.