Please use this identifier to cite or link to this item:
|Title:||Grid workflow scheduling with temporal decomposition||Authors:||Long, F.
|Issue Date:||2007||Citation:||Long, F.,Pung, H.K. (2007). Grid workflow scheduling with temporal decomposition. ICEIS 2007 - 9th International Conference on Enterprise Information Systems, Proceedings ISAS : 441-446. ScholarBank@NUS Repository.||Abstract:||Grid workflow scheduling, a very important system function in current Grid Systems, is known as a NP com plete problem. In this paper, we propose a new scheduling method- "temporal decomposition" - which divides a whole grid workflow into some sub-workflows. By dividing a large problem (workflow) into some smaller problems (sub-workflows), the "temporal decomposition" to better exploit achieves much lower computation complexity. Another motivation for the design of "temporal decomposition" is at the availability of the highly dynamic grid resources. We further propose an efficient scheduling algorithm for scheduling sub-workflows in this paper. Numerical simulation results show that our proposed scheme is more efficient in comparison with a well known existing grid workflow scheduling method.||Source Title:||ICEIS 2007 - 9th International Conference on Enterprise Information Systems, Proceedings||URI:||http://scholarbank.nus.edu.sg/handle/10635/40040|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 16, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.