Visible to the public Biblio

Filters: Keyword is Data dependencies  [Clear All Filters]
2019-05-08
Yaseen, Q., Alabdulrazzaq, A., Albalas, F..  2019.  A Framework for Insider Collusion Threat Prediction and Mitigation in Relational Databases. 2019 IEEE 9th Annual Computing and Communication Workshop and Conference (CCWC). :0721–0727.

This paper proposes a framework for predicting and mitigating insider collusion threat in relational database systems. The proposed model provides a robust technique for database architect and administrators to predict insider collusion threat when designing database schema or when granting privileges. Moreover, it proposes a real time monitoring technique that monitors the growing knowledgebases of insiders while executing transactions and the possible collusion insider attacks that may be launched based on insiders accesses and inferences. Furthermore, the paper proposes a mitigating technique based on the segregation of duties principle and the discovered collusion insider threat to mitigate the problem. The proposed model was tested to show its usefulness and applicability.

2018-06-11
Peterson, Brad, Humphrey, Alan, Schmidt, John, Berzins, Martin.  2017.  Addressing Global Data Dependencies in Heterogeneous Asynchronous Runtime Systems on GPUs. Proceedings of the Third International Workshop on Extreme Scale Programming Models and Middleware. :1:1–1:8.
Large-scale parallel applications with complex global data dependencies beyond those of reductions pose significant scalability challenges in an asynchronous runtime system. Internodal challenges include identifying the all-to-all communication of data dependencies among the nodes. Intranodal challenges include gathering together these data dependencies into usable data objects while avoiding data duplication. This paper addresses these challenges within the context of a large-scale, industrial coal boiler simulation using the Uintah asynchronous many-task runtime system on GPU architectures. We show significant reduction in time spent analyzing data dependencies through refinements in our dependency search algorithm. Multiple task graphs are used to eliminate subsequent analysis when task graphs change in predictable and repeatable ways. Using a combined data store and task scheduler redesign reduces data dependency duplication ensuring that problems fit within host and GPU memory. These modifications did not require any changes to application code or sweeping changes to the Uintah runtime system. We report results running on the DOE Titan system on 119K CPU cores and 7.5K GPUs simultaneously. Our solutions can be generalized to other task dependency problems with global dependencies among thousands of nodes which must be processed efficiently at large scale.