The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2011 vol.60)
pp: 1017-1029
Xiaoyong Tang , Hunan University Hunan Agricultural University , Changsha ChangSha
Kenli Li , Hunan University, ChangSha
Zeng Zeng , Hunan University, Changsha
Bharadwaj Veeravalli , Dept of ECE, NUS, Singapore
ABSTRACT
In the recent past, security-sensitive applications, such as electronic transaction processing systems, stock quote update systems, which require high quality of security to guarantee authentication, integrity, and confidentiality of information, have adopted heterogeneous distributed system (HDS) as their platforms. This is primarily due to the fact that single parallel-architecture-based systems may not be sufficient to exploit the available parallelism with the running applications. Most security-aware applications end up in handling dependence tasks, also referred to as Directed Acyclic Graph (DAG), on these HDSs. Unfortunately, most existing algorithms for scheduling such DAGs in HDS fail to fully consider security requirements. In this paper, we systematically design a security-driven scheduling architecture that can dynamically measure the trust level of each node in the system by using differential equations. To do so, we introduce task priority rank to estimate security overhead of such security-critical tasks. Furthermore, we propose a security-driven scheduling algorithm for DAGs which can achieve high quality of security for applications. Our rigorous performance evaluation study results clearly demonstrate that our proposed algorithm outperforms the existing scheduling algorithms in terms of minimizing the makespan, risk probability, and speedup. We also observe that the improvement obtained by our algorithm increases as the security-sensitive data of applications increases.
INDEX TERMS
Directed acyclic graphs, scheduling algorithm, security overheads, heterogeneous distributed systems, security-driven, precedence-constrained tasks.
CITATION
Xiaoyong Tang, Kenli Li, Zeng Zeng, Bharadwaj Veeravalli, "A Novel Security-Driven Scheduling Algorithm for Precedence-Constrained Tasks in Heterogeneous Distributed Systems", IEEE Transactions on Computers, vol.60, no. 7, pp. 1017-1029, July 2011, doi:10.1109/TC.2010.117
REFERENCES
[1] A.A. Alhamdan, "Scheduling Methods for Efficient Utilization of Clusters Computing Environments," PhD thesis, Univ. of Connecticut, 2003.
[2] I. Foster and C. Kesselman, The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publishers, 1999.
[3] J. Sarangapani, Wireless Ad Hoc and Sensor Networks: Protocols, Performance, and Control. CRC Press, Apr. 2007.
[4] A. Dogan and F. Özgüner, "LDBS: A Duplication Based Scheduling Algorithm for Heterogeneous Computing Systems," Proc. Int'l Conf. Parallel Processing, pp. 352-359, 2002.
[5] G. Donoho, "Building a Web Service to Provide Real-Time Stock Quotes," MCAD.Net, Feb. 2004.
[6] S. Song, Y.-K. Kwok, and K. Hwang, "Trusted Job Scheduling in Open Computational Grids: Security-Driven Heuristics and A Fast Genetic Algorithms," Proc. Int'l Symp. Parallel and Distributed Processing, 2005.
[7] W. Yurcik, X. Meng, G. Koenig, and J. Greenseid, "Cluster Security as a Unique Problem with Emergent Properties," Proc. Fifth LCI Int'l Conf. Linux Clusters: The HPC Revolution, May 2004.
[8] K. Connelly and A.A. Chien, "Breaking the Barriers: High Performance Security for High Performance Computing," Proc. Workshop New Security Paradigms, Sept. 2002.
[9] H. El-Rewini and T.G. Lewis, "Scheduling Parallel Program Tasks onto Arbitrary Target Machines," J. Parallel and Distributed Computing, vol. 9, no. 2, pp. 138-153, 1990.
[10] G.C. Sih and E.A. Lee, "A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Machine Architectures," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 2, pp. 175-187, Feb. 1993.
[11] M. Iverson, F. Ozuner, and G. Follen, "Parallelizing Existing Applications in a Distributed Heterogeneous Environment," Proc. Heterogeneous Computing Workshop, pp. 93-100, 1995.
[12] Y.-K. Kwok and I. Ahmad, "Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs onto Multiprocessors," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 5, pp. 506-521, May 1996.
[13] H. Topcuoglu, S. Hariri, and M.-Y. Wu, "Performance-Effective and Low Complexity Task Scheduling for Heterogeneous Computing," IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 3, pp. 260-274, Mar. 2002.
[14] X. Tang, L. Kenli, and D. Padua, "Communication Contention in APN List Scheduling Algorithm," Science in China Series F: Information Sciences, vol. 52, no. 1, pp. 59-69, 2009.
[15] M.R. Gary and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
[16] I. Ahmad and Y.-K. Kwok, "On Exploiting Task Duplication in Parallel Program Scheduling," IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 9, pp. 872-892, Sept. 1998.
[17] S. Darbha and D.P. Agrawal, "Optimal Scheduling Algorithm for Distributed-Memory Machines," IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 1, pp. 87-95, Jan. 1998.
[18] C.H. Papadimitriou and M. Yannakakis, "Towards An Architecture-Independent Analysis of Parallel Algorithms," SIAM J. Computing, vol. 19, no. 2, pp. 322-328, 1990.
[19] M.K. Dhodhi, I. Ahmad, A. Yatama, and I. Ahmad, "An Integrated Technique for Task Matching and Scheduling onto Distributed Heterogeneous Computing System," J. Parallel and Distributed Computing, vol. 62, no. 9, pp. 1338-1361, 2002.
[20] H. Topcuoglu, S. Hariri, and M.Y. Wu, "Task Scheduling Algorithms for Heterogeneous Machines," Proc. Heterogeneous Computing Workshop, pp. 3-14, 1999.
[21] A. Radulescu and A.J.C. van Gemund, "Low-Cost Task Scheduling for Distributed-Memory Machines," IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 6, pp. 648-658, June 2002.
[22] H.J. Park and B.K. Kim, "An Optimal Scheduling Algorithm for Minimizing the Computing Period of Cyclic Synchronous Tasks on Multiprocessors," J. Systems and Software, vol. 56, no. 3, pp. 213-229, 2001.
[23] D. Kim and B.G. Yi, "A Two-Pass Scheduling Algorithm for Parallel Programs," Parallel Computing, vol. 20, no. 6, pp. 869-885, 1994.
[24] A. Dogan and F. Özgüner, "On QoS-Based Scheduling of a Meta-Task with Multiple QoS Demands in Heterogeneous Computing," Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS), pp. 50-55, 2002.
[25] T. Xie, X. Qin, and A. Sung, "SAREC: A Security-Aware Scheduling Strategy for Real-Time Application on Clusters," Proc. Int'l Conf. Parallel Processing (ICPP '05), pp. 5-12, 2005.
[26] T. Xie and X. Qin, "Scheduling Security-Critical Real-Time Applications on Clusters," IEEE Trans. Computers, vol. 55, no. 7, pp. 864-879, July 2006.
[27] T. Xie, X. Qin, A. Sung, M. Lin, and L.T. Yang, "Real-Time Scheduling with Quality of Security Constraints," Int'l J. High Performance Computing and Networking, vol. 4, nos. 3/4, pp. 188-197, 2006.
[28] T. Xie and X. Qin, "Performance Evaluation of a New Scheduling Algorithm for Distributed Systems with Security Heterogeneity," J. Parallel and Distributed Computing, vol. 67, no. 6, pp. 1067-1081, 2007.
[29] T. Xie and X. Qin, "Security-Aware Resource Allocation for Real-Time Parallel Jobs on Homogeneous and Heterogeneous Clusters," IEEE Trans. Parallel and Distributed Systems, vol. 19, no. 5, pp. 682-697, May 2008.
[30] F. Azzedin and M. Maheswaran, "A Trust Brokering System and Its Application to Resource Management in Public-Resource Grids," Proc. Parallel and Distributed Processing Symp., pp. 26-30, 2004.
[31] F. Azzedin and M. Maheswaran, "Integrating Trust into Grid Resource Management Systems," Int'l Conf. Parallel Processing (ICPP '02), pp. 47-54, 2002.
[32] R. He, J.W. Niu, and G.W. Zhang, "CBTM: A Trust Model with Uncertainty Quantification and Reasoning for Pervasive Computing," Lecture Notes in Computer Science, pp. 541-552, Springer-Verlag, 2005.
[33] M. Nielsen, K. Krukow, and V. Sassone, "A Bayesian Model for Event-Based Trust," Electronic Notes in Theoretical Computer Science, vol. 172, no. 1, pp. 499-521, 2007.
[34] S. Song, Y.-K. Kwok, and K. Hwang, "Risk-Resilient Heuristics and Genetic Algorithms for Security-Assured Grid Job Scheduling," IEEE Trans. Computers, vol. 55, no. 6, pp. 703-719, June 2006.
[35] F.G. Marmol and G.M. Peréz, "Security Threats Scenarios in Trust and Reputation Models for Distributed Systems," Computers & Security, vol. 28, no. 7, pp. 545-556, 2009.
[36] S.D. Kamvar, M.T. Schlosser, and H. Garcia-Molina, "The EigenTrust Algorithm for Reputation Management in P2P Networks," Proc. 12th Int'l Conf. World Wide Web, 2003.
[37] S.A. Mokhov, "Towards Security Hardening of Scientific Demand-Driven and Pipelined Distributed Computing Systems," Proc. Int'l Symp. Parallel and Distributed Computing (ISPDC '08), pp. 375-382, 2008.
[38] M. Pourzandi, D. Gordon, W. Yurcik, and G.A. Koenig, "Clusters and Security: Distributed Security for Distributed Systems," Proc. Fifth IEEE Int'l Symp. Cluster Computing and the Grid (CCGrid '05), pp. 96-104, 2005.
[39] S. Jorgensen, S. Taboubi, and G. Zaccour, "Retail Promotions with Negative Brand Image Effects: Is Cooperation Possible?" European J. Operational Research, vol. 150, no. 2, pp. 395-405, 2003.
[40] G.Q. Liu, K.L. Poh, and M. Xie, "Iterative List Scheduling for Heterogeneous Computing," J. Parallel and Distributed Computing, vol. 65, no. 5, pp. 654-665, 2005.
[41] M.I. Daoud and N. Kharma, "A High Performance Algorithm for Static Task Scheduling in Heterogeneous Distributed Computing Systems," J. Parallel and Distributed Computing, vol. 68, no. 4, pp. 399-409, 2008.
[42] S. Bansal, P. Kumar, and K. Singh, "An Improved Duplication Strategy for Scheduling Precedence Constrained Graphs in Multiprocessor Systems," IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 6, pp. 533-544, June 2003.
[43] C. Zhu, X. Tang, and K. Li, "Integrating Trust into Grid Economic Model Scheduling Algorithm," Proc. Int'l Conf. Grid Computing, High-Performance and Distributed Applications (GADA '06), pp. 1263-1272, 2006.
[44] Y. Chung and S. Ranka, "Application and Performance Analysis of a Compile-Time Optimization Approach for List Scheduling Algorithms on Distributed Memory Multiprocessors," Proc. Super computing, pp. 512-521, 1992.
[45] A.E. Cretu and R.J. Brodie, "The Influence of Brand Image and Company Reputation Where Manufacturers Market to Small Firms: A Customer Value Perspective," Industrial Marketing Management, vol. 36, no. 2, pp. 230-240, 2007.
[46] F. Almenarez, A. Marin, C. Campo, and R.C. Garcia, "TrustAC: Trust-Based Access Control for Pervasive Devices," Lecture Notes in Computer Science, pp. 225-238, Springer-Verlag, 2005.
[47] H. Jameel, L.X. Hung, U. Kalim, A. Sajjad, S.Y. Lee, and Y.K. Lee, "A Trust Model for Ubiquitous Systems Based on Vectors of Trust Values," Proc. Seventh IEEE Int'l Symp. Multimedia, pp. 674-679, 2005.
[48] G. Theodorakopoulos and J.S. Baras, "On Trust Models and Trust Evaluation Metrics for Ad-Hoc Networks," IEEE J. Selected Areas in Comm., vol. 24, no. 2, pp. 318-328, Feb. 2006.
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool