Bo Cao, Yongwei Wu, Guangwen Yang, Jia Liu, Jianjin Jiang
{"title":"基于经济学理论的动态作业调度算法","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":"{\"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}","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
摘要
本文利用经济学理论提出了一类动态作业(DJ)的调度算法black Scholes market (BSM)算法。BSM是在经典期权定价理论的基础上建立的投资- black Scholes定价模型。该算法通过模拟一个不合理的市场，可以满足动态流作业的需求，选择服务器提供特定的服务。与动态加权轮询调度算法(DWRR)和动态统计随机调度算法(DSR)相比，BSM算法具有较好的长时间调度性能和不同最大作业到达率下的最佳平均延迟率。从稳定性来看，BSM算法也明显优于其他两种算法
BSM: A scheduling algorithm for dynamic jobs based on economics theory
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号
