loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth International Conference on Grid and Cooperative Computing (GCC'06)
BSM: A scheduling algorithm for dynamic jobs based on economics theory
Hunan, China
October 21-October 23
ISBN: 0-7695-2694-2
Bo Cao, Tsinghua University Beijing, China
Yongwei Wu, Tsinghua University Beijing, China
Guangwen Yang, Tsinghua University Beijing, China
Jia Liu, Tsinghua University Beijing, China
Jianjin Jiang, Tsinghua University Beijing, China
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.
Index Terms:
Black and Scholes Option Pricing Model, Market Simulation, Scheduling Algorithm, Dynamic Jobs
Citation:
Bo Cao, Yongwei Wu, Guangwen Yang, Jia Liu, Jianjin Jiang, "BSM: A scheduling algorithm for dynamic jobs based on economics theory," gcc, pp.62-65, Fifth International Conference on Grid and Cooperative Computing (GCC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.