BSM: A scheduling algorithm for dynamic jobs based on economics theory

Author

Cao, Bo ; Wu, Yongwei ; Yang, Guangwen ; Liu, Jia ; Jiang, Jianjin

Author_Institution

Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing

fYear

2006

fDate

Oct. 2006

Firstpage

62

Lastpage

65

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

Keywords

pricing; scheduling; black Scholes market algorithm; black Scholes pricing model; dynamic job scheduling; economics theory; grid scheduling; investment; option pricing theory; Computer science; Distributed computing; Dynamic scheduling; Grid computing; Information science; Laboratories; Predictive models; Pricing; Round robin; Scheduling algorithm; Black and Scholes Option Pricing Model; Dynamic Jobs; Market Simulation; Scheduling Algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Grid and Cooperative Computing, 2006. GCC 2006. Fifth International Conference

Conference_Location

Hunan

Print_ISBN

0-7695-2694-2

Type

conf

DOI

10.1109/GCC.2006.34

Filename

4031434