• Publications
  • Influence
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
Two novel scheduling algorithms for a bounded number of heterogeneous processors with an objective to simultaneously meet high performance and fast scheduling time are presented, called the Heterogeneous Earliest-Finish-Time (HEFT) algorithm and the Critical-Path-on-a-Processor (CPOP) algorithm. Expand
Task scheduling algorithms for heterogeneous processors
Two low-complexity efficient heuristics are presented, the Heterogeneous Earliest-Finish-Time (HEFT) algorithm and the Critical-Path-on-a-Processor (CPOP) algorithm for scheduling directed acyclic weighted task graphs (DAGs) on a bounded number of heterogeneous processors. Expand
Autonomic Computing: An Overview
The increasing scale complexity, heterogeneity and dynamism of networks, systems and applications have made our computational and information infrastructure brittle, unmanageable and insecure. ThisExpand
Distributed program reliability analysis
Graph theory techniques are used to systematically generate file spanning trees that provide all the required connections and can be used in a dynamic environment for efficient reliability evaluation. Expand
A component-based programming model for autonomic applications
A component-based programming framework to support the development of autonomic self-managed applications and the formulation of autonomics applications as the dynamic composition and management of autonomousic components is presented. Expand
A testbed for analyzing security of SCADA control systems (TASSCS)
The critical infrastructures of our society are in the process of being modernized. Most significantly impacted are the industrial control systems through replacement of old electromechanical systemsExpand
Autonomia: an autonomic computing environment
This work has successfully implemented a proof-of-concept prototype system that can support the self-configuring, self-deploying and self-healing of any networked application. Expand
SYREL: A Symbolic Reliability Algorithm Based on Path and Cutset Methods
A simple and efficient algorithm, SYREL, to obtain compact terminal reliability expressions between a terminal pair of computers of complex networks that incorporates conditional probability, set theory, and Boolean algebra in a distinct approach. Expand
An efficient network intrusion detection method based on information theory and genetic algorithm
This paper presents a hybrid method based on information theory and genetic algorithm to detect network attacks that applies to the kdd99 benchmark dataset and obtains high detection rate and low false alarm rate. Expand