Future multicore systems suffer from high and varying fault rates due to device scaling,
increasing number of processing notes, varying environmental issues and aging effects …

Task Scheduling for real-time distributed systems has been investigated extensively in the
literature. However, conventional wisdom in dynamic scheduling ignores security …

Fault-tolerant real-time scheduling algorithm is one of the most important means to ensure
the timeliness and high availability characteristics of fault-tolerant real-time systems. Existing …

Security requirements of security-critical real-time applications must be met in addition to
satisfying timing constraints. However, conventional real-time scheduling algorithms ignore …

The advent of widely interconnected computing resources introduces the technologies of
grid computing. A typical grid system, the cluster grid, consists of several clusters located in …

Embedded systems increasingly include heterogeneous compute resources. Yet the vast
majority of real-time scheduling methods are designed for single-resource or homogeneous …

This paper addresses the problem of improving quality of security for real-time parallel
applications on heterogeneous clusters. We propose a new security-and heterogeneity …

No longer prohibitively expensive, encryption of data in motion and at rest is a new
potentially cost-effective thread in the fabric of controls appropriate for many medium-to-high …

Task scheduling in a distributed environment is an NP-hard problem. A large amount of time
is required for solving this NP-hard problem using traditional techniques. Heuristics/meta …

Recognition of context-free and stack languages Page 1 RECOONITlOO OF CCJf.I'EXT-FREE
AND STACK IANGUAGES* SR Kosaraju** The Johns Hopkins University Baltimore" Maryland …