-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi all,
I would like to ask you some questions: I am trying to use the cbs algorithm [1] over separated runqueues, providing soft guarantees on the cpu bandwidth reserved to each group, in the form of q ns every p ns. A snapshot of my work is at: http://feanor.sssup.it/~fabio/server_patches/ It is not working on smp and with incomplete interface (please, do not even consider it.) Before going on, as I've seen that I'm doing some duplicate work, and that it seems there is no agreement in the community on the approach to take, in your opinion is what I am doing of some interest ? Is it worth working on it (completing it and eventually integrating with more general approaches to task grouping) ? I cannot see any way of introducing guarantees on the current linux scheduler, without losing its main features (O(1) complexity, POSIX compliance, etc.) am I wrong ? Has anyone tried to do so ? Thank you in advance, Fabio [1] http://xoomer.alice.it/lucabe72/pubs/rtss98.ps -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.5 (GNU/Linux) iD8DBQFFeEaqJLupBxwGiLIRAnhOAJ9Z0lQn622467qckYIzvv1Sjno/dgCeM33f BLgQgXXuRWplprv77JftMxM= =Stgj -----END PGP SIGNATURE----- ------------------------------------------------------------------------- Take Surveys. Earn Cash. Influence the Future of IT Join SourceForge.net's Techsay panel and you'll get the chance to share your opinions on IT & business topics through brief surveys - and earn cash http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV _______________________________________________ ckrm-tech mailing list https://lists.sourceforge.net/lists/listinfo/ckrm-tech
