Centre for Information Technology Research |
Simulation of Checkpoint Selection with Temporal Dependency on SwinDeW-G
Supervisor:Yun Yang (overall) & Jinjun Chen (day-to-day)
Suitable year level:3rd-5th year
Project Description
Grid computing is a new paradigm of distributed computing. It aims to accommodate large-scale resource sharing across heterogeneous and autonomous systems. Grid computing has become a hot topic internationally. A high degree research interest has been invoked. Industry efforts including those from Intel, HP, Microsoft, etc. have also been made towards potential applications of Grid computing. Many conferences, workshops and seminars are held annually to boost the research and industry applications. One of the popular organisations for Grid computing has been established to coordinate the standardisation. That is OGF (Open Grid Forum).
SwinDeW-G (Swinburne Decentralised Workflow for Grid) is a grid workflow management system running on SwinGrid. SwinGrid (Swinburne Grid) is a grid platform being set up. SwinDeW-G is supposed to support large-scale complex processes in complex scientific and business applications such as climate modelling and international finance and banking analysis. Such processes are defined as grid workflows and run in SwinDeW-G by facilitating the computing and resource sharing power of underlying grid infrastructure, i.e. SwinGrid.
Many grid workflows are often time constrained. Temporal constraints are enforced and then verified to identify any temporal violations. During the grid workflow execution, checkpoint selection aims to select appropriate checkpoints for verifying temporal constraints. Selecting every activity in the workflow as a checkpoint is not efficient as we may not need to conduct temporal verification as some activities. Then, where should we conduct the temporal verification? Some checkpoint selection strategies have been developed. But they often select some unnecessary and ignore some necessary checkpoints. We have developed one strategy which can select necessary yet sufficient checkpoints, but independently of temporal dependency between temporal constraints. With temporal dependency, our strategy can be improved further. Besides, considering succeeding activity execution, potential time could be saved for current checkpoints. Therefore, our strategy can be optimised further. This project aims to simulate the optimised strategy on SwinDeW-G environments. The aim is to reason about the optimised checkpoint selection results in a real-world grid workflow system (SwinDeW-G) on a real-world grid environment (SwinGrid).
Expectations/Assessment
- Simulation report including simulation results compared with other strategies.
- Simulation programs and set-up manual in SwinDeW-G
- Simulation data
Pre-requisite Knowledge
Good Java programming skills, basic knowledge about distributed computing and workflow, desirable knowledge about Linux, ideally some knowledge about grid.
Further details:yyang @ ict.swin.edu.au (9214 8752); jchen @ ict.swin.edu.au (9214 8739)
Back |
