Please use this identifier to cite or link to this item: https://doi.org/10.1109/TC.2010.117
Title: A novel security-driven scheduling algorithm for precedence-constrained tasks in heterogeneous distributed systems
Authors: Tang, X.
Li, K.
Zeng, Z.
Veeravalli, B. 
Keywords: Directed acyclic graphs
heterogeneous distributed systems
precedence-constrained tasks.
scheduling algorithm
security overheads
security-driven
Issue Date: 2011
Citation: Tang, X., Li, K., Zeng, Z., Veeravalli, B. (2011). A novel security-driven scheduling algorithm for precedence-constrained tasks in heterogeneous distributed systems. IEEE Transactions on Computers 60 (7) : 1017-1029. ScholarBank@NUS Repository. https://doi.org/10.1109/TC.2010.117
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. © 2011 IEEE.
Source Title: IEEE Transactions on Computers
URI: http://scholarbank.nus.edu.sg/handle/10635/81899
ISSN: 00189340
DOI: 10.1109/TC.2010.117
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

49
checked on Jul 17, 2018

WEB OF SCIENCETM
Citations

27
checked on Jun 26, 2018

Page view(s)

34
checked on Jun 22, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.