This book constitutes the refereed proceedings of the Third International Workshop on Applied Parallel Computing, PARA'96, held in Lyngby, Denmark, in August 1996.
The volume presents revised full versions of 45 carefully selected contributed papers together with 31 invited presentations. The papers address all current aspects of applied parallel computing relevant for industrial computations. The invited papers review the most important numerical algorithms and scientific applications on several types of parallel machines.

This book constitutes the strictly refereed post-workshop proceedings of the 1997 IPPS Workshop on Job Scheduling Strategies for Parallel Processing held in Geneva, Switzerland, in April 1997, as a satelite meeting of the IEEE/CS International Parallel Processing Symposium.
The 12 revised full papers presented were carefully reviewed and revised for inclusion in the book. Also included is a detailed introduction surveying the state of the art in the area. Among the topics covered are processor allocation, parallel scheduling, massively parallel processing, shared-memory architectures, gang scheduling, etc.

This book constitutes the refereed proceedings of the Third International Conference of the Austrian Center for Parallel Computation, ACPC '96, held in Klagenfurt, Austria, in September 1996.
The 15 revised full papers presented together with two keynote contributions were selected from 31 submissions by authors from 13 countries. Also included are two industrial papers and six posters. The topical emphasis of the book is on parallel databases and parallel input/output aspects; however also other topics are addressed, like parallel hardware, parallel numerics, parallel languages, and tools and algorithms.

This book constitutes the refereed proceedings of the 8th International Conference on Concurrency Theory, CONCUR'97. held in Warsaw, Poland, in July 1997.
The 24 revised full papers presented were selected by the program committee for inclusion in the volume from a total of 41 high-quality submissions. The volume covers all current topics in the science of concurrency theory and its applications, such as reactive systems, hybrid systems, model checking, partial orders, state charts, program logic calculi, infinite state systems, verification, and others.

This two-volume set presents the proceedings of the Second International European Conference on Parallel Processing, EuroPar '96, held in Lyon, France, in August 1996.
EuroPar '96 was organized in 14 workshops covering the whole spectrum of parallel processing. The comprehensive proceedings constitute a unique record of the state of the art in parallel processing research and development: the 224 papers included together with four invited papers were selected from a total of 383 submissions by authors from 40 countries; 554 referees were involved in the selection process and the index lists 521 contributing authors.

This monograph-like book assembles the thorougly revised and cross-reviewed lectures given at the School on Data Parallelism, held in Les Menuires, France, in May 1996.
The book is a unique survey on the current status and future perspectives of the currently very promising and popular data parallel programming model. Much attention is paid to the style of writing and complementary coverage of the relevant issues throughout the 12 chapters. Thus these lecture notes are ideally suited for advanced courses or self-instruction on data parallel programming. Furthermore, the book is indispensable reading for anybody doing research in data parallel programming and related areas.

This book constitutes the refereed proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems, IRREGULAR '96, held in Santa Barbara, California, in August 1996.
The volume presents 28 revised full papers selected from 51 submissions; also included are one full invited paper by Torben Hagerup and abstracts of four other invited talks. The papers are organized in topical sections on sparse matrix problems, partitioning and domain composition, irregular applications, communication and synchronization, systems support, and mapping and load balancing.

This book constitutes the refereed proceedings of the 4th International Symposium on Solving Irregularly Structured Problems in Parallel, IRREGULAR'97, held in Paderborn, Germany, in June 1997.
The 18 revised full papers presented were carefully selected by the program committee for inclusion in the volume; also included are full papers by the five invited speakers. Among the topics covered are discrete algorithms, randomized methods and approximation algorithms, implementations, programming environments, systems and applications, and scheduling and load balancing.

This book contains a refereed collection of revised papers selected from the presentations at the France-Japan Workshop on Object-Based Parallel and Distributed Computation, OBPDC'95, held in Tokyo in June 1995.
The 18 full papers included in the book constitute a representative, well-balanced set of timely research contributions to the growing field of object-based concurrent computing. The volume is organized in sections on massively parallel programming languages, distributed programming languages, formalisms, distributed operating systems, dependable distributed computing, and software management.

This book constitutes the refereed proceedings of the First International Conference on Scientific Computing in Object-Oriented Parallel Environments, ISCOPE '97, held in Marina del Rey, California, in December 1997. The volume presents 36 revised papers carefully selected for inclusion in the book. The papers address run-time performance optimization at several levels, new language programming paradigms, applications of Java-based technology, direct applications in various areas, object-oriented libraries, and new ideas and approaches to parallel scientific computing. All in all, this is an up-to-date presentation of the state-of-the-art in the application of object-oriented methods in scientific and engineering applications.

This book constitutes the refereed proceedings of the 7th International Conference on Concurrency Theory, CONCUR '96, held in Pisa, Italy, in August 1996.
The volume presents 37 revised full papers selected from a total of 133 submissions; also included are seven invited papers. The contributions are grouped into topical sections on process algebras, categorical approaches, the pi-calculus, decidability and complexity, probability, functional and constraint programming, Petri nets, verification, automata and causality, practical models, and shared-memory systems.

Massively parallel processing is currently the most promising answer to the quest for increased computer performance. This has resulted in the development of new programming languages and programming environments and has stimulated the design and production of massively parallel supercomputers. The efficiency of concurrent computation and input/output essentially depends on the proper utilization of specific architectural features of the underlying hardware. This book focuses on development of runtime systems supporting execution of parallel code and on supercompilers automatically parallelizing code written in a sequential language. Fortran has been chosen for the presentation of the material because of its dominant role in high-performance programming for scientific and engineering applications.

This book presents the refereed proceedings of the International Workshop on Parallel Symbolic Languages and Systems, PSLS '95, held in Beaune, France, in October 1995.
The 21 full papers included in the book were carefully selected for presentation at the meeting and thoroughly revised afterwards. Parallel symbolic computing has gained in importance for high-performance computing; in recent years, many applications have been implemented using C, C++, and their parallel extensions. This volume is organized in sections on evaluation strategies, programming tools, irregular data structures and applications, systems, and distributed models and systems.

This book constitutes the strictly refereed post-workshop proceedings of the International Workshop on Job Scheduling Strategies for Parallel Processing, held in conjunction with IPPS '96 symposium in Honolulu, Hawaii, in April 1996.
The book presents 15 thoroughly revised full papers accepted for inclusion on the basis of the reports of at least five program committee members. The volume is a highly competent contribution to advancing the state-of-the-art in the area of job scheduling for parallel supercomputers. Among the topics addressed are job scheduler, workload evolution, gang scheduling, multiprocessor scheduling, parallel processor allocation, and distributed memory environments.

Solving combinatorial optimization problems can often lead to runtime growing exponentially as a function of the input size. But important real-world problems, industrial applications, and academic research challenges, may demand exact optimal solutions. In such situations, parallel processing can reduce the runtime from days or months, typical when one workstation is used, to a few minutes or even seconds.
Partners of the CEC-sponsored SCOOP Project (Solving Combinatorial Optimization Problems in Parallel) contributed, on invitation, to this book; much attention was paid to competent coverage of the topic and the style of writing. Readers will include students, scientists, engineers, and professionals interested in the design and implementation of parallel algorithms for solving combinatorial optimization problems.

Parallel execution of SQL queries against large databases offers a solution to the problem of reducing query response. This book addresses the related optimization problem: Given an SQL query, find the plan that delivers the result in minimal time. The author presents and analyzes new theoretical findings and efficient algorithms pertaining to parallel operation at a practical level of granularity relevant to database system operations. The optimization results balance the advantages and costs of parallel execution of SQL queries. The techniques presented are applicable to modern system configurations, where computation is performed on pipelining-capable workstations operating in parallel, and can be used to construct SQL compilers able to exploit parallel machines effectively.

This book presents the refereed proceedings of the Eighth Annual Workshop on Languages and Compilers for Parallel Computing, held in Columbus, Ohio in August 1995.
The 38 full revised papers presented were carefully selected for inclusion in the proceedings and reflect the state of the art of research and advanced applications in parallel languages, restructuring compilers, and runtime systems. The papers are organized in sections on fine-grain parallelism, interprocedural analysis, program analysis, Fortran 90 and HPF, loop parallelization for HPF compilers, tools and libraries, loop-level optimization, automatic data distribution, compiler models, irregular computation, object-oriented and functional parallelism.

This monograph is a revised version of the author's Ph.D. thesis, submitted to the University of Li ge, Belgium, with Pierre Wolper as thesis advisor.
The general pattern of this work, is to turn logical and semantic ideas into exploitable algorithms. Thus, it perfectly fits the modern trend, viewing verification as a computer-aided activity, and as algorithmic as possible, not as a paper and pencil one, dealing exclusively with semantic and logical issues. Patrice Godefroid uses state-space exploration as the key technique, which, as such or elaborated into model checking, is attracting growing attention for the verification of concurrent systems. For most realistic examples, the methods presented provide a significant reduction of memory and time requirements for protocol verification.

This book contains mainly a selection of papers that were presented at the International Workshop on High Performance Computing/or Computer Graphics and Visualisation, held in Swansea, United Kingdom on 3-4 July 1995. The workshop was sponsored by the HEFCWI Initiative on *Parallel Computing - Foundations and Applications*, and it has provided the international computer graphics community with a platform for: * assessing and reviewing the impact of the development of high performance computing on the progress of computer graphics and visualisation; * presenting the current use of high performance computing architecture and software tools in computer graphics and visualisation, and the development of parallel graphics algorithms; * identifying potential high performance computing applications in computer graphics and visualisation, and encouraging members of the graphics community to think about their problems from the perspective of parallelism. The book is divided into six sections. The first section, which acts as the introduction of the book, gives an overview of the current state of the art It contains a comprehensive survey, by Whitman, of parallel algorithms for computer graphics and visualisation; and a discussion, by Hansen, on the past, present and future high performance computing applications in computer graphics and visualisation. The second section is focused on the design and implementation of high performance architecture, software tools and algorithms for surface rendering.

Within the DFG -Schwerpunktprogramm "Stromungssimulation mit Hochleistungsrechnern" and within the activities of the French-German cooperation of CNRS and DFG a DFG symposium on "Computational Fluid Dynamics (CFD) on Parallel Systems" was organized at the Institut fur Aerodynamik and Gasdynamik of the Stuttgart University, 9-10 December 1993. This symposium was attended by 37 scientists. The scientific program consisted of 18 papers that considered finite element, finite volume and a two step Taylor Galerkin algorithm for the numerical solution of the Euler and Navier-Stokes equations on massively parallel computers with MIMD and SIMD architecture and on work station clusters. Incompressible and compressible, steady and unsteady flows were considered including turbu lent combustion with complex chemistry. Structured and unstructured grids were used. High numerical efficiency was demonstrated by multiplicative, additive and multigrid methods. Shared memory, virtual shared memory and distributed memory systems were investigated, in some cases based on an automatic grid partitioning technique. Various methods for domain decomposition were investigated. The key point of these methods is the resolution of the inter face problem because the matrix involved can be block dense. Multilevel decomposition can be very efficient using multifrontal algorithm. The numerical methods include explicit and implicit schemes. In the latter case the system of equations is often solved by a Gauss -Seidel line re laxation technique."

This book is the proceedings of the Structures in Concurrency Theory workshop (STRICT) that was held from 11 th to l3th May 1995 in Berlin, Germany. It includes three invited contributions - by J. de Bakker, E. Best et aI, and E. R. Olderog and M. Schenke - and all papers which were submitted and accepted for presentation. Concurrency Theory deals with formal aspects of concurrent systems. It uses partly competing and partly complementary formalisms and structures. The aim of this workshop was to present and compare different formalisms and results in Concurrency Theory. STRICT was organized by the Humboldt-University Berlin and the ESPRIT Basic Research Working Group CALIBAN. Original papers had been sought from all scientists in the field of Concurrency Theory. The Programme Committee selected twenty contributions with various different topics, including Petri Nets, Process Algebras, Distributed Algorithms, Formal Semantics, and others. I am grateful to the Programme Committee and to the other referees for the careful evaluation of the submitted papers.

Parallel processing is a key topic which is becoming more important as the technology becomes more widespread. UK Parallel '96 - Proceedings of the BCS PPSG Annual Group is the publication of the academic programme from the first in an annual series of national conferences covering the broad area of parallel and distributed computing. It was coordinated by the BCS Parallel Processing Specialist Group and provided a focus for both research and industrial presentations. This first conference was held at the University of Surrey in July 1996, and contains work from a number of universities within the UK. The scope of the proceedings illustrates the breadth of the work being undertaken in the UK and includes a variety of papers covering a number of important areas, including: compiler development for both data-parallel and message passing languages and the development of application specific software.

This book presents five tutorial-style lectures on various approaches to the problem of verifying distributed systems: three chapters concentrate on linear-time or branching-time temporal logics; one addresses process equivalence with an emphasis on infinite-state systems; and the final one presents a novel category-theoretic approach to verification. The various formalisms for expressing properties of concurrent systems, based on automata-theoretic techniques or structural properties, are studied in detail.
Much attention is paid to the style of writing and complementary coverage of the relevant issues. Thus these lecture notes are ideally suited for advanced courses on logics for concurrent systems. Equally, they are indispensable reading for anyone researching the area of distributed computing.

This book constitutes the refereed proceedings of the 17th International Conference on Application and Theory of Petri Nets, held in Osaka, Japan, in June 1996.
The 26 revised full papers included in the book together with three invited presentations were selected from a total of 78 submissions. The book addresses the current theoretical and applicational aspects of the various types of Petri Nets and competently reflects the state of the art in the area.

Many parallel computer architectures are especially suited for particular classes of applications. However, there are only a few parallel architectures equally well suited for standard programs. Much effort is invested into research in compiler techniques to make programming parallel machines easier.
This book presents methods for automatic parallelization, so that programs need not to be tailored for specific architectures; here the focus is on fine-grain parallelism, offered by most new microprocessor architectures. The book addresses compiler writers, computer architects, and students by demonstrating the manifold complex relationships between architecture and compiler technology.