Please use this identifier to cite or link to this item: https://doi.org/10.1109/TC.2010.117
DC FieldValue
dc.titleA novel security-driven scheduling algorithm for precedence-constrained tasks in heterogeneous distributed systems
dc.contributor.authorTang, X.
dc.contributor.authorLi, K.
dc.contributor.authorZeng, Z.
dc.contributor.authorVeeravalli, B.
dc.date.accessioned2014-10-07T04:23:00Z
dc.date.available2014-10-07T04:23:00Z
dc.date.issued2011
dc.identifier.citationTang, 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
dc.identifier.issn00189340
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/81899
dc.description.abstractIn 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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/TC.2010.117
dc.sourceScopus
dc.subjectDirected acyclic graphs
dc.subjectheterogeneous distributed systems
dc.subjectprecedence-constrained tasks.
dc.subjectscheduling algorithm
dc.subjectsecurity overheads
dc.subjectsecurity-driven
dc.typeArticle
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.doi10.1109/TC.2010.117
dc.description.sourcetitleIEEE Transactions on Computers
dc.description.volume60
dc.description.issue7
dc.description.page1017-1029
dc.description.codenITCOB
dc.identifier.isiut000290867300009
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

97
checked on May 28, 2022

WEB OF SCIENCETM
Citations

79
checked on May 20, 2022

Page view(s)

140
checked on May 26, 2022

Google ScholarTM

Check

Altmetric


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