Efficient Task Scheduling Approach Relevant to the Hardware/Software Co-Design of Embedded System

Task scheduling is the primary multitasking activity controlled by the real-time executive. As hardware/software co-design of embedded systems has been enabled by advances in computer technologies, reprogrammable hardware can be used to implement a co-processor to perform most of the kernel functions, including task scheduling. In this kind of system design, more complex scheduling approaches can be applied. In this paper, a complex scheduling approach, which takes into account advantages of evolutionary computation (i.e., neurocomputing and genetic search and optimization) is presented. First, we present a model based on the Hopfield-Tank neural network (11). Then, we introduce modifications of the method based on the network model to improve the quality of the solutions. Finally, we propose a mixed approach of this evolutionary computation method and an extension of the Earliest Deadline First approach (3) for scheduling both types of periodic and aperiodic tasks. We also discuss simulation results that demonstrate performance that could be obtained by using this approach

A Generic Library of Problem Solving Methods for Scheduling Applications

In this thesis we propose a generic library of scheduling problem-solving methods. As a first approximation, scheduling can be defined as an assignment of jobs and activities to resources and time ranges in accordance with a number of constraints and requirements. In some cases optimisation criteria may also be included in the problem specification. Although, several attempts have been made in the past at developing the libraries of scheduling problem-solvers, these only provide limited coverage. Many lack generality, as they subscribe to a particular scheduling domain. Others simply implement a particular problem-solving technique, which may be applicable only to a subset of the space of scheduling problems. In addition, most of these libraries fail to provide the required degree of depth and precision, which is needed both to obtain a formal account of scheduling problem solving and to provide effective support for development of scheduling applications by reuse. Our library subscribes to the Task-Method-Domain-Application (TMDA) knowledge modelling framework, which provides a structured organisation for the different components of the library. In line with the organisation proposed by TMDA, we first developed a generic scheduling task ontology, which formalises the space of scheduling problems independently of any particular application domain, or problem solving method. Then we constructed a task-specific, but domain independent model of scheduling problem-solving, which generalises from the variety of approaches to scheduling problem-solving, which can be found in literature. The generic nature of this model was demonstrated by constructing seven methods for scheduling, as alternative specialisation of the model. Finally, we validated our library on a number of applications to demonstrate its generic nature and effective support for the analysis and development of scheduling applications

A Neural Network Approach to Dependent *Reliability Estimation.

This research presents the creation of a new model for automating the generation of component and system reliability estimates from simulated field data for tightly coupled systems. The model utilizes the CMAC neural network architecture, which resembles the human cerebellum and is capable of approximating nonlinear functions. An analysis and testing of the network as a tool for reliability prediction of dependent components within an assembly has been performed. In order to evaluate the performance of the model, the network has been tested on simulated data and provided over 90% performance accuracy in learning non-linear functions that represent the dependency between components. This serves as a valuable tool for maintenance personnel faced with important and costly decisions regarding equipment maintenance policies

Intelligent control of industrial processes

A detailed survey of the field of intelligent control is presented. Current practices are reviewed and the need for a unifying framework to identify and strengthen the underlying core principles is postulated. Intelligent control is redefined to make explicit use of human systems in control as a reference model. Psychological theories of intelligent behaviour reveal certain basic attributes. From these a set of necessary and sufficient conditions for intelligent control are derived. Learning ability is identified as a crucial element. Necessary attributes for learning are prediction capabilities, internal world model, estimation of the model parameters, and active probing to reduce uncertainties. This framewoik is used to define a Learning Based Predictive Control (LBPC) strategy. LBPC is derived from Predictive Functional Control techniques with an adaptive layer implemented by recursive least squares. Improved performance above conventional adaptive control is demonstrated. Distributed parameter systems are identified as a suitable application area requiring an intelligent control approach. Such systems are invariably complex, ill-defined, and nonlinear. Plasticating extrusion processes are considered in particular. LBPC is applied to control of the primary loop to regulate melt temperature and pressure at the die. A novel control technique is proposed for dynamic profile control of extruder barrel wall temperature. This is a two-level hierarchical scheme combining the benefits of LBPC control blocks at the lowest level with decision logic operating at the higher level as a supervisor. This Logic Based Strategy allows multivariable control of non-square systems with more outputs than inputs. The application of LBS to an extruder is demonstrated

Power-Aware Job Dispatching in High Performance Computing Systems

This works deals with the power-aware job dispatching problem in supercomputers; broadly speaking the dispatching consists of assigning finite capacity resources to a set of activities, with a special concern toward power and energy efficient solutions. We introduce novel optimization approaches to address its multiple aspects. The proposed techniques have a broad application range but are aimed at applications in the field of High Performance Computing (HPC) systems. Devising a power-aware HPC job dispatcher is a complex, where contrasting goals must be satisfied. Furthermore, the online nature of the problem request that solutions must be computed in real time respecting stringent limits. This aspect historically discouraged the usage of exact methods and favouring instead the adoption of heuristic techniques. The application of optimization approaches to the dispatching task is still an unexplored area of research and can drastically improve the performance of HPC systems. In this work we tackle the job dispatching problem on a real HPC machine, the Eurora supercomputer hosted at the Cineca research center, Bologna. We propose a Constraint Programming (CP) model that outperforms the dispatching software currently in use. An essential element to take power-aware decisions during the job dispatching phase is the possibility to estimate jobs power consumptions before their execution. To this end, we applied Machine Learning techniques to create a prediction model that was trained and tested on the Euora supercomputer, showing a great prediction accuracy. Then we finally develop a power-aware solution, considering the same target machine, and we devise different approaches to solve the dispatching problem while curtailing the power consumption of the whole system under a given threshold. We proposed a heuristic technique and a CP/heuristic hybrid method, both able to solve practical size instances and outperform the current state-of-the-art techniques

The scheduling of manufacturing systems using Artificial Intelligence (AI) techniques in order to find optimal/near-optimal solutions.

This thesis aims to review and analyze the scheduling problem in general and Job Shop Scheduling Problem (JSSP) in particular and the solution techniques applied to these problems. The JSSP is the most general and popular hard combinational optimization problem in manufacturing systems. For the past sixty years, an enormous amount of research has been carried out to solve these problems. The literature review showed the inherent shortcomings of solutions to scheduling problems. This has directed researchers to develop hybrid approaches, as no single technique for scheduling has yet been successful in providing optimal solutions to these difficult problems, with much potential for improvements in the existing techniques. The hybrid approach complements and compensates for the limitations of each individual solution technique for better performance and improves results in solving both static and dynamic production scheduling environments. Over the past years, hybrid approaches have generally outperformed simple Genetic Algorithms (GAs). Therefore, two novel priority heuristic rules are developed: Index Based Heuristic and Hybrid Heuristic. These rules are applied to benchmark JSSP and compared with popular traditional rules. The results show that these new heuristic rules have outperformed the traditional heuristic rules over a wide range of benchmark JSSPs. Furthermore, a hybrid GA is developed as an alternate scheduling approach. The hybrid GA uses the novel heuristic rules in its key steps. The hybrid GA is applied to benchmark JSSPs. The hybrid GA is also tested on benchmark flow shop scheduling problems and industrial case studies. The hybrid GA successfully found solutions to JSSPs and is not problem dependent. The hybrid GA performance across the case studies has proved that the developed scheduling model can be applied to any real-world scheduling problem for achieving optimal or near-optimal solutions. This shows the effectiveness of the hybrid GA in real-world scheduling problems. In conclusion, all the research objectives are achieved. Finaly, the future work for the developed heuristic rules and the hybrid GA are discussed and recommendations are made on the basis of the results.Board of Trustees, Endowment Fund Project, KPK University of Engineering and Technology (UET), Peshawar and Higher Education Commission (HEC), Pakista