Performance Evaluation of SDS Algorithm with Fault Tolerance for Distributed System
Sathiya Bharathi K1, Kumaresan N2
1K.Sathiya Bharathi, PG Student, Department of ECE, Anna University of Technology, Coimbatore, India.
2N.Kumaresan, Assistant Professor, Department of ECE, Anna University of Technology, Coimbatore, India.
Manuscript received on July 01, 2012. | Revised Manuscript received on July 05, 2012. | Manuscript published on July 10, 2012. | PP: 50-56 | Volume-1, Issue-2, July 2012. | Retrieval Number: B0147061212/2012©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
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.We systematically design a securitydriven scheduling architecture that can dynamically measure the trust level of each node in the system by using differential equations and introduce SRank to estimate security overhead of critical tasks using SDS algorithm.Furthermore,we can achieve high quality of security for applications by using security-driven scheduling algorithm for DAGs in terms of minimizing the makespan, risk probability, and speedup. In addition to that the fault tolerant is included using Security Driven Fault Tolerant Scheduling Algorithm (SDFT) to tolerate N processors failure at one time, and it introduced a new global scheduler to improve efficiency of scheduling process.Moreover, the SDFT supported flexible security policy applied on real time tasks according to its security requirement and considered the effect of security overhead during scheduling. We also observe that the improvement obtained by our algorithm increases as the securitysensitive data of applications increases.
Keywords: Directed acyclic graphs, scheduling algorithm, security overheads, heterogeneous distributed systems, security-driven, fault tolerance, precedence-constrained tasks.