Parallel applications with deadline and security constraints are emerging in various areas like education, information technology, and business. However, conventional job schedulers for clusters generally do not take security requirements of realtime parallel applications into account when making allocation decisions. In this paper, we address the issue of allocating tasks of parallel applications on clusters subject to timing and security constraints in addition to precedence relationships. A task allocation scheme, or TAPADS (Task Allocation for Parallel Applications with Deadline and Security Constraints), is developed to find an optimal allocation that maximizes quality of security and the probability of meeting deadlines for parallel applications. In addition, we proposed mathematical models to describe a system framework, parallel applications with deadline and security constraints, and security overheads. Experimental results show that TAPADS significantly improves the performance of clusters in terms of quality of security and schedulability over three existing allocation schemes.
In REF , Xie et al. proposed a task allocation scheme named TPADPS to maximize the security quality and schedulability for real-time applications with task dependence.
A New Allocation Scheme for Parallel Applications with Deadline and Security Constraints on Clusters
2005 IEEE International Conference on Cluster Computing
2005 IEEE International Conference on Cluster Computing
Computer Science