Ada for Multi-Microprocessors
M. Tedd, Stefano Crespi-Reghizzi, Antonio Natali
CUP Archive, 1984 - Computers - 208 pages
Multi-processor systems are becoming more prevalent due to the many advantages which they offer over single-processor systems. A multi-microprocessor system can smoothly accommodate expansion and increasing levels of integration of separate controllers, facilitating modernization of industrial plants without large capital outlay. This book deals with the ways in which Ada can be used for such distributed systems. The main part of the book is devoted to the issue of how to construct and run an Ada program for a variable target configuration of several microcomputers, interconnected through shared memories, multi-access busses, local area networks or end-to-end lines. It is recognized that Ada and current Ada Programming Support Environments (APSEs) do not address distributed targets, and different approaches are therefore considered for coping with distribution without changing the language or unduly restricting the way in which it is used. The approach which emerges as the most natural is one where the designer is required to cluster tightly coupled Ada tasks into 'virtual nodes'. The implications of this approach for the user and the APSE are examined in detail, and further implications concerning use of the multi-microprocessor approach to achieve reliability and extensibility are also studied.
What people are saying - Write a review
We haven't found any reviews in the usual places.
REQUIREMENTS FOR THE PROGRAMMING LANGUAGE AND TOOLS
SUITABILITY OF ADA AND APSE
STRATEGIES FOR DEVELOPING DISTRIBUTED SYSTEMS
DETAILED CONSIDERATION OF THE CONSTRUCTION SYSTEM
IMPLICATIONS FOR THE APSE TOOLSET
RELIABILITY AND EXTENSIBILITY
THE MML EXPERIENCE
access types Ada language Ada program Ada source algorithm allocation allow application software application system Apse architecture assembly language atomic action back-end buffer called task checking code and data compilation unit constraints construction system copy data structures debugging distributed systems distributed targets dynamic entry call environment exceeds requirements exception handling execution facilities fault tolerance functions graceful degradation handling hardware node heap partitions host implementation input inter-processor interaction interface Intermetrics kernel library package linker logical machine Mapse mechanism meets requirements method microprocessors modules monitor multiprocessor operator outermost-level tasks output physical possible problem procedure processes programming language reconfiguration rendezvous parameters replacement representation clauses restriction run-time system sequence shared data shared memory specific standby static subprogram synchronisation target configuration target hardware task access object task object task type declarations type of processor virtual node