报告题目: Security-Aware Scheduling for Real-Time Applications on Clusters
An increasing number of real-time parallel applications on clusters, such as aircraft control and medical electronics systems, require high quality of security to assure confidentiality, authenticity, and integrity of information. Conventional scheduling algorithms for clusters have been proposed to achieve high performance of parallel applications without security requirements; however, enhancing security of clusters for parallel applications requiring service flexibility remains a challenging problem. In this talk, we will focus on scheduling mechanisms and algorithms for applications with timing and security constraints on clusters. In particular, we will first articulate an adaptive control framework for quality of security in cluster computing systems. The framework is centered on a model of security-sensitive real-time applications and security overhead model. The overhead model is incorporated to measure security overheads incurred by an array of security services, including encryption, authentication, integrity check, and the like. Next, we will shed light on a dynamic real-time scheduling algorithm, or TAPADS (Task Allocation for Parallel Applications with Deadline and Security constraints), which seamlessly integrates security requirements into real-time scheduling for clusters. To quantitatively evaluate the performance TAPADS, we conducted extensive experiments driven by real world applications and traces as well as synthetic benchmarks. We will present experimental results to demonstratively show that TAPADS significantly improves system performance in terms of quality of security and schedulability over the three existing scheduling algorithms.
Xiao Qin is a Professor and the Director of Graduate Programs in the Department of Computer Science and Software Engineering at Auburn University. He received the B.S. and M.S. degrees in Computer Science from Huazhong University of Science and Technology, China, in 1996 and 1999, respectively. He also received the Ph.D. in Computer Science from the University of Nebraska-Lincoln in 2004. Prior to joining Auburn University in 2007, he had been an assistant professor with New Mexico Institute of Mining and Technology (New Mexico Tech) for three years. He won an NSF CAREER award in 2009. His research interests include parallel and distributed systems, real-time computing, storage systems, fault tolerance, and performance evaluation. His research is supported by the U.S. National Science Foundation.