Performance Evaluation of a New Scheduling Algorithm for Distributed Systems with Security Heterogeneity
Tao Xiea Xiao Qinb*
aDepartment of Computer Science, San Diego State University, San Diego, CA 92182, USA
bDepartment of Computer Science and Software Engineering, Auburn University, Auburn, AL 36849, USA
High quality of security is increasingly critical for applications running on heterogeneous distributed systems. However, existing scheduling algorithms for heterogeneous distributed systems disregard security requirements of applications. To address this issue, in this paper, we introduce security heterogeneity concept for our scheduling model in the context of distributed systems. Based on the concept, we propose a novel heuristic scheduling algorithm, or SATS, which strives to maximize the probability that all tasks are executed without any risk of being attacked. Extensive experimental studies using real world traces indicate that the scheduling performance is affected by heterogeneities of security and computational power. Additionally, empirical results demonstrate that with respect to security and performance, the proposed scheduling algorithm outperforms existing approaches under a wide spectrum of workload conditions.
Appeared in Journal of Parallel and Distributed Computing, vol. 67, No. 10, pp.1067-1081, Oct. 2007.
Acknowledgment: The work reported in this paper was supported by the US National Science Foundation under Grant No. CCF-0742187, San Diego State University under a startup grant, Auburn University under a startup grant, the Intel Corporation under Grant No. 2005-04-070, and the .