Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
5 Author(s)
Bo Cao ; Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing ; Yongwei Wu ; Guangwen Yang ; Jia Liu
more authors

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

Published in:

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

Date of Conference:

Oct. 2006