Scheduling Tasks with Resource Requirements in Hard Real-Time Systems
IEEE Transactions on Software Engineering
Minimizing total tardiness on one machine is NP-hard
Mathematics of Operations Research
A security architecture for computational grids
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Dynamic mapping of a class of independent tasks onto heterogeneous computing systems
Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
NetSolve: a network server for solving computational science problems
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Journal of Parallel and Distributed Computing
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Data Intensive Distributed Computing; A Medical Application Example
HPCN Europe '99 Proceedings of the 7th International Conference on High-Performance Computing and Networking
Maintaining Security in Firm Real-Time Database Systems
ACSAC '98 Proceedings of the 14th Annual Computer Security Applications Conference
Scheduling Resources in Multi-User, Heterogeneous, Computing Environments with SmartNet
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
Heuristics for Scheduling Parameter Sweep Applications in Grid Environments
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Architectural Impact of Secure Socket Layer on Internet Servers
ICCD '00 Proceedings of the 2000 IEEE International Conference on Computer Design: VLSI in Computers & Processors
Security Implications of Typical Grid Computing Usage Scenarios
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
Ten actions when Grid scheduling: the user as a Grid scheduler
Grid resource management
Dynamic Task Scheduling with Security Awareness in Real-Time Systems
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
International Journal of High Performance Computing Applications
The GrADS Project: Software Support for High-Level Grid Application Development
International Journal of High Performance Computing Applications
Journal of Parallel and Distributed Computing
Fair Scheduling Algorithms in Grids
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
An efficient adaptive scheduling policy for high-performance computing
Future Generation Computer Systems
An Adaptive Scheduling Algorithm for Scheduling Tasks in Computational Grid
GCC '08 Proceedings of the 2008 Seventh International Conference on Grid and Cooperative Computing
Security-Driven Task Scheduling Based on Evolutionary Algorithm
CIS '08 Proceedings of the 2008 International Conference on Computational Intelligence and Security - Volume 02
A parallel solution for scheduling of real time applications on grid environments
Future Generation Computer Systems
An integrated security-aware job scheduling strategy for large-scale computational grids
Future Generation Computer Systems
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
IEEE Transactions on Computers
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
Multifaceted web services: an approach to secure and scalable grid scheduling
EuroWeb'02 Proceedings of the 2002 international conference on EuroWeb
| Hi-index | 0.00 |
Security-aware scheduling for real-time grid applications is an important task and a little work has been done to accomplish this. In this paper, we propose two scheduling algorithms for real-time grid applications with stringent security requirements, and the proposed algorithms are compared with a few existing scheduling algorithms, i.e. MinMin, MaxMin, EDF/ECT, SPMinMin and SPMaxMin. Security overhead computation for existing and proposed models is done on the basis of security level demand of the tasks. Performance of WB-EDFMin on success rate performance metric is considered to be the best among all the contemporary scheduling algorithms. SFWB-EDFMin compromises on the overall success rate of the grid application but its task scheduling is uniformly spread over the tasks of all security levels.