Bo Cao, Yongwei Wu, Guangwen Yang, Jia Liu, Jianjin Jiang
{"title":"BSM: A scheduling algorithm for dynamic jobs based on economics theory","authors":"Bo Cao, Yongwei Wu, Guangwen Yang, Jia Liu, Jianjin Jiang","doi":"10.1109/GCC.2006.34","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a new scheduling algorithm with economic theory, called black Scholes market (BSM) algorithm for a class of dynamic jobs (DJ). BSM is based on the classic option pricing theory in investment - black Scholes pricing model. The algorithm could meet the needs of dynamic flow jobs and select server to provide specific service through simulating an irrational market. Compared with dynamic weighted round robin (DWRR) and dynamic statistical random (DSR) scheduling algorithms, BSM algorithm achieves a better performance in long time scheduling and the best average delay rate in different maximum job arrival rates. And from view of the stability, BSM is also much better than the other two algorithms","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCC.2006.34","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we propose a new scheduling algorithm with economic theory, called black Scholes market (BSM) algorithm for a class of dynamic jobs (DJ). BSM is based on the classic option pricing theory in investment - black Scholes pricing model. The algorithm could meet the needs of dynamic flow jobs and select server to provide specific service through simulating an irrational market. Compared with dynamic weighted round robin (DWRR) and dynamic statistical random (DSR) scheduling algorithms, BSM algorithm achieves a better performance in long time scheduling and the best average delay rate in different maximum job arrival rates. And from view of the stability, BSM is also much better than the other two algorithms
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
