Springer Sivumäärä: 145 sivua Asu: Pehmeäkantinen kirja Julkaisuvuosi: 2011, 20.11.2011 (lisätietoa) Kieli: Englanti
Parallel Processing in Digital Control is a volume to be published in the new Advances in Industrial Control series, edited by Professor M.J. Grimble and Dr. M.A. Johnson of the Industrial Control Unit, University of Strathclyde. The growing complexity of digital control systems in such areas as robotics, flight control and engine control has created a demand for faster and more reliable systems. This book examines how parallel processing can satisfy these requirements. Following a survey of parallel computer architectures, MIMD (Multiple Instruction Multiple Data) machines are identified as suitable systems for digital control problems, which are characterised by a mixture of regular and irregular algorithmic tasks. An example of a typical MIMD architecture, suitable for real-time control, (the Inmos Transputer) is introduced together with its associated parallel programming language (Occam). The key problem in implementing parallel software is associated with mapping parallel tasks onto physical processors. In this book a variety of schemes are described and assessed to help illustrate potential areas of difficulty for the real-time control software engineer. Solutions are proposed and tested on a flight control case study example. Recognising the widespread acceptance of MATLAB and its derivatives for computer aided control system design, this book demonstrates how mapping strategies can be realised in this environment and integrated with a transputer development system for on-line performance evaluation. A case study example demonstrates the power of this approach and important issues are highlighted. Readers will experience the advantages of parallel processing in digital control while being made aware of the key factors to be considered in the development of an effective solution. Practising control engineers and graduate/post-graduate students will find the book of particular interest and benefit.