The Community for Technology Leaders
Green Image
Security is increasingly becoming an important issue in the design of real-time parallel applications, which are widely used in industry and academic organizations. However, existing schedulers for real-time parallel jobs on clusters generally do not factor in security requirements when making allocation and scheduling decisions. Aiming at improving security for real-time parallel applications, we develop two resource allocation schemes, called TAPADS (Task Allocation for Parallel Applications with Deadline and Security constraints) and SHARP (Security- and Heterogeneity-Aware Resource allocation for Parallel jobs), by taking into account applications"?timing and security requirements in addition to precedence constraints. In this paper we consider two types of computing platforms: homogeneous clusters and heterogeneous clusters. To facilitate the presentation of the new schemes, we build mathematical models to describe a system framework, security overhead, and parallel applications with deadline and security constraints. The proposed schemes are applied to heuristically find resource allocations that maximize the quality of security and the probability of meeting deadlines for parallel applications running on clusters. We conducted extensive experiments using real world applications and traces as well as synthetic benchmarks. Experimental results are presented to demonstrate the effectiveness and practicality of the proposed schemes.
Scheduling and task partitioning, Real-time distributed
Tao Xie, Xiao Qin, "Security-Aware Resource Allocation for Real-Time Parallel Jobs on Homogeneous and Heterogeneous Clusters", IEEE Transactions on Parallel & Distributed Systems, vol. 19, no. , pp. 682-697, May 2008, doi:10.1109/TPDS.2007.70776
97 ms
(Ver 3.1 (10032016))