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. Key words: Black and Scholes Option Pricing Model, Market Simulation, Scheduling Algorithm, Dynamic Jobs

• Type: Conference
• Year: 2006
• Where: GCC
• Authors: Bo Cao, Yongwei Wu, Guangwen Yang, Jia Liu, Jianjin Jiang
• Keywords: Black Scholes, Distributed And Parallel Computing, Dynamic Jobs, GCC 2006, Scheduling Algorithm