This volume contains most of the papers presented at the workshop on research directions in high-level parallel programming languages, held at Mont Saint-Michel, France, in June 1991. The motivation for organizing this workshop came from the emergence of a new class of formalisms for describing parallel computations in the last few years. Linda, Unity, Gamma, and the Cham are the most significant representatives of this new class. Formalisms of this family promote simple but powerful language features for describing data and programs. These proposals appeared in different contexts and were applied in different domains, and the goal of the workshop was to review the status of this new field and compare experiences. The workshop was organized into four main sessions: Unity, Linda, Gamma, and Parallel Program Design. The corresponding parts ofthe volume are introduced respectively by J. Misra, D. Gelernter, D. Le M tayer, and J.-P. Ban tre.

This volume presents the proceedings of a workshop on evolutionary models and strategies and another workshop on parallel processing, logic, organization, and technology, both held in Germany in 1989. In the search for new concepts relevant for parallel and distributed processing, the workshop on parallel processing included papers on aspects of space and time, representations of systems, non-Boolean logics, metrics, dynamics and structure, and superposition and uncertainties. The point was stressed that distributed representations of information may share features with quantum physics, such as the superposition principle and the uncertainty relations. Much of the volume contains material on general parallel processing machines, neural networks, and system-theoretic aspects. The material on evolutionary strategies is included because these strategies will yield important and powerful applications for parallel processing machines, and open the wayto new problem classes to be treated by computers.

This special volume contains the Proceedings of a Workshop on "Parallel Algorithms and Transputers for Optimization" which was held at the University of Siegen, on November 9, 1990. The purpose of the Workshop was to bring together those doing research on 2.lgorithms for parallel and distributed optimization and those representatives from industry and business who have an increasing demand for computing power and who may be the potential users of nonsequential approaches. In contrast to many other conferences, especially North-American, on parallel processing and supercomputers the main focus of the contributions and discussion was "problem oriented". This view reflects the following philosophy: How can the existing computing infrastructure (PC's, workstations, local area networks) of an institution or a company be used for parallel and/or distributed problem solution in optimization. This volume of the LECfURE NOTES ON ECONOMICS AND MA THEMA TICAL SYSTEMS contains most of the papers presented at the workshop, plus some additional invited papers covering other important topics related to this workshop. The papers appear here grouped according to four general areas. (1) Solution of optimization problems using massive parallel systems (data parallelism). The authors of these papers are: Lootsma; Gehne. (II) Solution of optimization problems using coarse-grained parallel approaches on multiprocessor systems (control parallelism). The authors of these papers are: Bierwirth, Mattfeld, and Stoppler; Schwartz; Boden, Gehne, and Grauer; and Taudes and Netousek.

Artificial neural networks are massively parallel interconnected networks ofsimple elements which are intended to interact with the objects of the real world in the same way as biological nervous systems do. Interest in these networks is due to the opinion that they are able to perform tasks like image and speech recognition that have only been implemented in limited ways by traditional computing methods. This book includes invited lectures and the full contributions to the International Workshop onArtificial Neural Networks held in Granada, Spain, September 17-19, 1991. The workshop was sponsored by the IEEE Computer Society, the Spanish Association for Computing and Automatics, and the University of Granada. The contributions were selected by an international program committee; the authors of the papers come from 12 countries. The book is organized in six sections, covering: - Neural network theories and neural models - Biological perspectives - Neural network architectures and algorithms - Software developments and tools - Hardware implementations - Applications.

This volume presents the proceedings of a workshop on parallel database systems organized by the PRISMA (Parallel Inference and Storage Machine) project. The invited contributions by internationally recognized experts give a thorough survey of several aspects of parallel database systems. The second part of the volume gives an in-depth overview of the PRISMA system. This system is based on a parallel machine, where the individual processors each have their own local memory and communicate with each other over a packet-switched network. On this machine a parallel object-oriented programming language, POOL-X, has been implemented, which provides dedicated support for database systems as well as general facilities for parallel programming. The POOL-X system then serves as a platform for a complete relational main-memory database management system, which uses the parallelism of the machine to speed up significantly the execution of database queries. The presentation of the PRISMA system, together with the invited papers, gives a broad overview of the state of the art in parallel database systems.

This volume contains the proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science, MFCS '91, held in Kazimierz Dolny, Poland, September 9-13, 1991. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Principal areas of interest in this symposium include: software specification and development, parallel and distributed computing, logic and semantics of programs, algorithms, automata and formal languages, complexity and computability theory, and others. The volume contains 5 invited papers by distinguished scientists and 38 contributions selected from a total of 109 submitted papers.

With the appearance of massively parallel computers, increased attention has been paid to algorithms which rely upon analogies to natural processes. This development defines the scope of the PPSN conference at Dortmund in 1990 whose proceedings are presented in this volume. The subjects treated include: - Darwinian methods such as evolution strategies and genetic algorithms; - Boltzmann methods such as simulated annealing; - Classifier systems and neural networks; - Transfer of natural metaphors to artificial problem solving. The main objectives of the conference were: - To gather theoretical results about and experimental comparisons between these algorithms, - To discuss various implementations on different parallel computer architectures, - To summarize the state of the art in the field, which was previously scattered widely both among disciplines and geographically.

The innovative progress in the development of large- and small-scale parallel computing systems and their increasing availability have caused a sharp rise in interest in the scientific principles that underlie parallel computation and parallel programming. The biannual Parallel Architectures and Languages Europe (PARLE) conferences aim at presenting current research on all aspects of the theory, design and application of parallel computing systems and parallel processing. PARLE '91, the third conference in the series, again offers a wealth of high-quality research material for the benefit of the scientific community. Compared to its predecessors, the scope of PARLE '91 has been broadened so as to cover the area of parallel algorithms and complexity, in addition to the central themes of parallel architectures and languages. The two-volume proceedings of the PARLE '91 conference contain the text of all contributed papers that were selected for the programme and of the invited papers by leading experts in the field.

Past, Present, Parallel is a survey of the current state of the parallel processing industry. In the early 1980s, parallel computers were generally regarded as academic curiosities whose natural environment was the research laboratory. Today, parallelism is being used by every major computer manufacturer, although in very different ways, to produce increasingly powerful and cost-effec- tive machines. The first chapter introduces the basic concepts of parallel computing; the subsequent chapters cover different forms of parallelism, including descriptions of vector supercomputers, SIMD computers, shared memory multiprocessors, hypercubes, and transputer-based machines. Each section concentrates on a different manufacturer, detailing its history and company profile, the machines it currently produces, the software environments it supports, the market segment it is targetting, and its future plans. Supplementary chapters describe some of the companies which have been unsuccessful, and discuss a number of the common software systems which have been developed to make parallel computers more usable. The appendices describe the technologies which underpin parallelism. Past, Present, Parallel is an invaluable reference work, providing up-to-date material for commercial computer users and manufacturers, and for researchers and postgraduate students with an interest in parallel computing.

This volume is a collection of papers on topics focused around concurrency, based on research work presented at the UK/Japan Workshop held at Wadham College, Oxford, September 25-27, 1989. The volume is organized into four parts: - Papers on theoretical aspects of concurrency which reflect strong research activities in the UK, including theories on CCS and temporal logic RDL. - Papers on object orientation and concurrent languages which reflect major research activities on concurrency in Japan. The languages presented include extensions of C, Prolog and Lisp as well as object-based concurrent languages. - Papers on parallel architectures and VLSI logic, including a rewrite rule machine, a graph rewriting machine, and a dataflow architecture. - An overview of the workshop including the abstracts of the talks and the list of participants. The appendix gives a brief report of the first UK/Japan Workshop in Computer Science, held at Sendai, Japan, July 6-9, 1987.

Logic programming refers to execution of programs written in Horn logic. Among the advantages of this style of programming are its simple declarativeand procedural semantics, high expressive power and inherent nondeterminism. The papers included in this volume were presented at the Workshop on Parallel Logic Programming held in Paris on June 24, 1991, as part of the 8th International Conference on Logic Programming. The papers represent the state of the art in parallel logic programming, and report the current research in this area, including many new results. The three essential issues in parallel execution of logic programs which the papers address are: - Which form(s) of parallelism (or-parallelism, and-parallelism, stream parallelism, data-parallelism, etc.) will be exploited? - Will parallelism be explicitly programmed by programmers, or will it be exploited implicitly without their help? - Which target parallel architecture will the logic program(s) run on?

Parallel architectures are no longer pure research vehicles, as they were some years ago. There are now many commercial systems competing for market segments in scientific computing. The 1990s are likely to become the decade of parallel processing. CONPAR 90 - VAPP IV is the joint successor meeting of two highly successful international conference series in the field of vector and parallel processing. This volume contains the 79 papers presented at the conference. The various topics of the papers include hardware, software and application issues. Some of the session titles best reflect the contents: new models of computation, logic programming, large-grain data flow, interconnection networks, communication issues, reconfigurable and scalable systems, novel architectures and languages, high performance systems and accelerators, performance prediction / analysis / measurement, performance monitoring and debugging, compile-time analysis and restructurers, load balancing, process partitioning and concurrency control, visualization and runtime analysis, parallel linear algebra, architectures for image processing, efficient use of vector computers, transputer tools and applications, array processors, algorithmic studies for hypercube-type systems, systolic arrays and algorithms. The volume gives a comprehensive view of the state of the art in a field of current interest.

This volume presents papers from the 2nd Scandinavian Workshop on Algorithm Theory. The contributions describe original research on algorithms and data structures, in all areas, including combinatorics, computational geometry, parallel computing, and graph theory. The majority of the papers focus on the design and complexity analysis of: data structures, text algorithms, and sequential and parallel algorithms for graph problems and for geometric problems. Examples of tech- niques presented include: - efficient ways to find approximation algorithms for the maximum independent set problem and for graph coloring; - exact estimation of the expected search cost for skip lists; - construction of canonical representations of partial 2-trees and partial 3-trees in linear time; - efficient triangulation of planar point sets and convex polygons.

Advances and problems in the field of compiler compilers are considered in this volume, which presents the proceedings of the third in a series of biannual workshops on compiler compilers. Selected papers address the topics of requirements, properties, and theoretical aspects of compiler compilers as well as tools and metatools for software engineering. The 23 papers cover a wide spectrum in the field of compiler compilers, ranging from overviews of new compiler compilers for generating quality compilers to special problems of code generation and optimization. Aspects of compilers for parallel systems and knowledge-based development tools are also discussed.

This volume presents the proceedings of a workshop at which major Parallel Lisp activities in the US and Japan were explained. Work covered includes Multilisp and Mul-T at MIT, Qlisp at Stanford, Lucid and Parcel at Illinois, PaiLisp at Tohoku University, Multiprocessor Lisp on TOP-1 at IBM Tokyo Research, and concurrent programming in TAO. Most papers present languages and systems of Parallel Lisp and are in particular concerned with: - Language constructs of Parallel Lisp and their meanings from the standpoint of implementing Parallel Lisp systems; - Some important technical issues such as parallel garbage collection, dynamic task partitioning, futures and continuations in parallelism, automatic parallelization of Lisp programs, and the kernel concept of Parallel Lisp. Some performance results are reported that suggest practical applicability of Parallel Lisp systems in the near future. Several papers on concurrent object-oriented systems are also included.

This book includes the papers presented at the Third International Workshop on Distributed Algorithms organized at La Colle-sur-Loup, near Nice, France, September 26-28, 1989 which followed the first two successful international workshops in Ottawa (1985) and Amsterdam (1987). This workshop provided a forum for researchers and others interested in distributed algorithms on communication networks, graphs, and decentralized systems. The aim was to present recent research results, explore directions for future research, and identify common fundamental techniques that serve as building blocks in many distributed algorithms. Papers describe original results in all areas of distributed algorithms and their applications, including: distributed combinatorial algorithms, distributed graph algorithms, distributed algorithms for control and communication, distributed database techniques, distributed algorithms for decentralized systems, fail-safe and fault-tolerant distributed algorithms, distributed optimization algorithms, routing algorithms, design of network protocols, algorithms for transaction management, composition of distributed algorithms, and analysis of distributed algorithms.

Each week of this three week meeting was a self-contained event, although each had the same underlying theme - the effect of parallel processing on numerical analysis. Each week provided the opportunity for intensive study to broaden participants' research interests or deepen their understanding of topics of which they already had some knowledge. There was also the opportunity for continuing individual research in the stimulating environment created by the presence of several experts of international stature. This volume contains lecture notes for most of the major courses of lectures presented at the meeting; they cover topics in parallel algorithms for large sparse linear systems and optimization, an introductory survey of level-index arithmetic and superconvergence in the finite element method.

This work relates different approaches for the modelling of parallel processes. On the one hand there are the so-called "process algebras" or "abstract programming languages" with Milner's Calculus of Communicating Systems (CCS) and the theoretical version of Hoare's Communicating Sequential Processes (CSP) as main representatives. On the other hand there are machine models, i.e. the classical finite state automata (transition systems), for which, however, more discriminating notions of equivalence than equality of languages are used; and secondly, there are differently powerful types of Petri nets, namely safe and general (place/transition) nets respectively, and predicate/transition nets. Within a uniform framework the syntax and the operational semantics of CCS and TCSP are explained. We consider both, Milner's well-known interleaving semantics, which is based on infinite transition systems, as well as the new distributed semantics introduced by Degano et al., which is based on infinite safe nets. The main part of this work contains three syntax-driven constructions of transition systems, safe nets, and predicate/transition nets respectively. Each of them is accompanied by a proof of consistency. Due to intrinsic limits, which are also investigated here, neither for transition systems and finite nets, nor for general nets does a finite consistent representation of all CCS and TCSP programs exist. However sublanguages which allow finite representations are discerned. On the other hand the construction of predicate/transition nets is possible for all CCS programs in which every choice and every recursive body starts sequentially.

It was the aim of the conference to present issues in parallel computing to a community of potential engineering/scientific users. An overview of the state-of-the-art in several important research areas is given by leading scientists in their field. The classification question is taken up at various points, ranging from parametric characterizations, communication structure, and memory distribution to control and execution schemes. Central issues in multiprocessing hardware and operation, such as scalability, techniques of overcoming memory latency and synchronization overhead, as well as fault tolerance of communication networks are discussed. The problem of designing and debugging parallel programs in a user-friendly environment is addressed and a number of program transformations for enhancing vectorization and parallelization in a variety of program situations are described. Two different algorithmic techniques for the solution of certain classes of partial differential equations are discussed. The properties of domain-decomposition algorithms and their mapping onto a CRAY-XMP-type architecture are investigated and an overview is given of the merit of various approaches to exploiting the acceleration potential of multigrid methods. Finally, an abstract performance modeling technique for the behavior of applications on parallel and vector architectures is described.

The papers collected in this volume are most of the material presented at the Advanced School on Mathematical Models for the Semantics of Parallelism, held in Rome, September 24- October 1, 1986. The need for a comprehensive and clear presentation of the several semantical approaches to parallelism motivated the stress on mathematical models, by means of which comparisons among different approaches can also be performed in a perspicuous way.

"WOPPLOT 86 - Workshop on Parallel Processing: Logic, " "Organization and Technology" - gathered together experts from various fields for a broad overview of current trends in parallel processing. There are contributions from logic (e.g., the connection between time and logic, or non-monotonic reasoning); from organizational structure theory (of great importance for pyramid architecture) and structure representation; from intrinsic parallelism and problem classification; from developments in future technologies (3-D Silicon technology, molecular electronics); and from various applications (pattern storage in adaptive memories, simulation of physical systems). The proceedings show clearly that progress in parallel processing is an interdisciplinary goal; they present a cross section of the state of the art as well as of future trends. Furthermore, some contributions (in particular, those from logic and organization) deserve a broader interest also outside the field of parallel processing.

This book is an introduction to the field of parallel algorithms and the underpinning techniques to realize the parallelization. The emphasis is on designing algorithms within the timeless and abstracted context of a high-level programming language. The focus of the presentation is on practical applications of the algorithm design using different models of parallel computation. Each model is illustrated by providing an adequate number of algorithms to solve some problems that quite often arise in many applications in science and engineering.The book is largely self-contained, presuming no special knowledge of parallel computers or particular mathematics. In addition, the solutions to all exercises are included at the end of each chapter.The book is intended as a text in the field of the design and analysis of parallel algorithms. It includes adequate material for a course in parallel algorithms at both undergraduate and graduate levels.

The programming language Fortran dates back to 1957 when a team of IBM engineers released the first Fortran Compiler. During the past 60 years, the language had been revised and updated several times to incorporate more features to enable writing clean and structured computer programs. The present version is Fortran 2018. Since the dawn of the computer era, there had been a constant demand for a "larger" and "faster" machine. To increase the speed there are three hurdles. The density of the active components on a VLSI chip cannot be increased indefinitely and with the increase of the density heat dissipation becomes a major problem. Finally, the speed of any signal cannot exceed the velocity of the light. However, by using several inexpensive processors in parallel coupled with specialized software and hardware, programmers can achieve computing speed similar to a supercomputer. This book can be used to learn the modern Fortran from the beginning and the technique of developing parallel programs using Fortran. It is for anyone who wants to learn Fortran. Knowledge beyond high school mathematics is not required. There is not another book on the market yet which deals with Fortran 2018 as well as parallel programming. FEATURES Descriptions of majority of Fortran 2018 instructions Numerical Model String with Variable Length IEEE Arithmetic and Exceptions Dynamic Memory Management Pointers Bit handling C-Fortran Interoperability Object Oriented Programming Parallel Programming using Coarray Parallel Programming using OpenMP Parallel Programming using Message Passing Interface (MPI) THE AUTHOR Dr Subrata Ray, is a retired Professor, Indian Association for the Cultivation of Science, Kolkata.