Providing Security of Real Time Data Intensive Applications on Grids Using Dynamic Scheduling

Authors:
Rafiqul Islam;Toufiq Hasan;Md. Ashaduzzaman
Affiliations:
Computer Science and Engineering Discipline, Khulna University, Khulna, Bangladesh 9208;Computer Science and Engineering Discipline, Khulna University, Khulna, Bangladesh 9208;Computer Science and Engineering Discipline, Khulna University, Khulna, Bangladesh 9208
Venue:
GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
Year:
2009

Citing 5
Cited 1

Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms

Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications

HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
The Anatomy of the Grid: Enabling Scalable Virtual Organizations

International Journal of High Performance Computing Applications
Security-driven scheduling for data-intensive applications on grids

Cluster Computing
Enhancing security of real-time applications on grids through dynamic scheduling

JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing

An architecture and a dynamic scheduling algorithm of grid for providing security for real-time data-intensive applications

International Journal of Network Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we have proposed a dynamic real time scheduling algorithm named SARDIG, which is capable of scheduling real time data intensive applications and provides security for real time data intensive applications running on grids. We have presented a grid architecture, which describes the scheduling framework of the security attentive real time data intensive applications running on data grids. In addition, we have introduced a mathematical model for the scheduling policy to provide optimum security for real time data intensive applications. The time complexity of the SARDIG algorithm has been analyzed to show the efficiency of the algorithm. Simulation result shows that the SARDIG algorithm provides better performance and security than two existing scheduling algorithms.