Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/2474

Download PDF (Published version) (Adobe Acrobat PDF, -1 bytes)

Title

A minimum proportional time redundancy based checkpoint selection strategy for dynamic verification of fixed-time constraints in grid workflow systems

Author(s)

Chen, Jinjun;  Yang, Yun

Abstract

In grid workflow systems, existing typical checkpoint selection strategies, which are used to select checkpoints for verifying fixed-time constraints at run-time execution stage, are not effective and/or efficient for fixed-time constraint verification because they often ignore some necessary checkpoints and select some unnecessary checkpoints. To improve such status, in this paper, we develop a new checkpoint selection strategy. Specifically, we first address a new concept of minimum proportional time redundancy which can be used to tolerate certain time deviation incurred by abnormal grid workflow execution. Then, we discuss relationships between minimum proportional time redundancy and fixed-time constraint consistency. Based on the relationships, we present our new strategy. With the strategy, we can avoid the omission of necessary checkpoints and the selection of excess unnecessary checkpoints. Consequently, our strategy is more effective and efficient for fixed-time constraint verification than the existing typical strategies. The final evaluation further demonstrates this result.

Publication type

Conference paper

Research centre

Swinburne University of Technology. Faculty of Information and Communication Technologies

Source

Proceedings of the 12th Asia-Pacific Software Engineering Conference, Taipei, Taiwan, 15-17 December 2005, pp. 299-306

Publication year

2005

Publisher

IEEE

ISBN

0769524656

Publisher URL

http://dx.doi.org/10.1109/APSEC.2005.11

Copyright

Copyright © 2005 IEEE. Published version of the paper reproduced here in accordance with the copyright policy of the publisher. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

Research Projects

Agent-enabled social networks, Australian Research Council grant number LP0562500

Full text

Peer reviewed