By Topic

Security-aware resource management for real-time applications on clusters

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Xiao Qin ; Department of Computer Science and Software Engineering, Auburn University, AL 36849-5347, USA

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 an open problem. In this tutorial, we will discuss our current research that focuses on developing and evaluating new scheduling mechanisms and algorithms for applications with timing and security constraints on clusters. In particular, we will first describe 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 used to measure security overheads incurred by an array of security services, including encryption, authentication, integrity check, etc. Next, we will describe 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 using 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 three existing scheduling algorithms.

Published in:

Cluster Computing, 2007 IEEE International Conference on

Date of Conference:

17-20 Sept. 2007