Networking and Parallel/Distributed Computing 2012

Numerical algorithms, modern programming techniques, and parallel computing are often taught serially across different courses and different textbooks. The need to integrate concepts and tools usually comes only in employment or in research - after the courses are concluded - forcing the student to synthesise what is perceived to be three independent subfields into one. This book provides a seamless approach to stimulate the student simultaneously through the eyes of multiple disciplines, leading to enhanced understanding of scientific computing as a whole. The book includes both basic as well as advanced topics and places equal emphasis on the discretization of partial differential equations and on solvers. Some of the advanced topics include wavelets, high-order methods, non-symmetric systems, and parallelization of sparse systems. The material covered is suited to students from engineering, computer science, physics and mathematics.

For 80 years, mathematics has driven fundamental innovation in computing and communications. This timely book provides a panorama of some recent ideas in mathematics and how they will drive continued innovation in computing, communications and AI in the coming years. It provides a unique insight into how the new techniques that are being developed can be used to provide theoretical foundations for technological progress, just as mathematics was used in earlier times by Turing, von Neumann, Shannon and others. Edited by leading researchers in the field, chapters cover the application of new mathematics in computer architecture, software verification, quantum computing, compressed sensing, networking, Bayesian inference, machine learning, reinforcement learning and many other areas.

Do you have the tools to address recent challenges and problems in modern computer networks? Discover a unified view of auction theoretic applications and develop auction models, solution concepts, and algorithms with this multidisciplinary review. Devise distributed, dynamic, and adaptive algorithms for ensuring robust network operation over time-varying and heterogeneous environments, and for optimizing decisions about services, resource allocation, and usage of all network entities. Topics including cloud networking models, MIMO, mmWave communications, 5G, data aggregation, task allocation, user association, interference management, wireless caching, mobile data offloading, and security. Introducing fundamental concepts from an engineering perspective and describing a wide range of state-of-the-art techniques, this is an excellent resource for graduate and senior undergraduate students, network and software engineers, economists, and researchers.

Communication complexity is the mathematical study of scenarios where several parties need to communicate to achieve a common goal, a situation that naturally appears during computation. This introduction presents the most recent developments in an accessible form, providing the language to unify several disjoint research subareas. Written as a guide for a graduate course on communication complexity, it will interest a broad audience in computer science, from advanced undergraduates to researchers in areas ranging from theory to algorithm design to distributed computing. The first part presents basic theory in a clear and illustrative way, offering beginners an entry into the field. The second part describes applications including circuit complexity, proof complexity, streaming algorithms, extension complexity of polytopes, and distributed computing. Proofs throughout the text use ideas from a wide range of mathematics, including geometry, algebra, and probability. Each chapter contain

Discover the very latest game-theoretic approaches for designing, modeling, and optimizing emerging wireless communication networks and systems with this unique text. Providing a unified and comprehensive treatment throughout, it explains basic concepts and theories for designing novel distributed wireless networking mechanisms, describes emerging game-theoretic tools from an engineering perspective, and provides an extensive overview of recent applications. A wealth of new tools is covered - including matching theory and games with bounded rationality - and tutorial chapters show how to use these tools to solve current and future wireless networking problems in areas such as 5G networks, network virtualization, software defined networks, cloud computing, the Internet of Things, context-aware networks, green communications, and security. This is an ideal resource for telecommunications engineers, and researchers in industry and academia who are working on the design of efficient, scala

This book presents an integrated collection of representative approaches for scaling up machine learning and data mining methods on parallel and distributed computing platforms. Demand for parallelizing learning algorithms is highly task-specific: in some settings it is driven by the enormous dataset sizes, in others by model complexity or by real-time performance requirements. Making task-appropriate algorithm and platform choices for large-scale machine learning requires understanding the benefits, trade-offs and constraints of the available options. Solutions presented in the book cover a range of parallelization platforms from FPGAs and GPUs to multi-core systems and commodity clusters, concurrent programming frameworks including CUDA, MPI, MapReduce and DryadLINQ, and learning settings (supervised, unsupervised, semi-supervised and online learning). Extensive coverage of parallelization of boosted trees, SVMs, spectral clustering, belief propagation and other popular learning algo

This comprehensive treatment of network information theory and its applications provides the first unified coverage of both classical and recent results. With an approach that balances the introduction of new models and new coding techniques, readers are guided through Shannon's point-to-point information theory, single-hop networks, multihop networks, and extensions to distributed computing, secrecy, wireless communication, and networking. Elementary mathematical tools and techniques are used throughout, requiring only basic knowledge of probability, whilst unified proofs of coding theorems are based on a few simple lemmas, making the text accessible to newcomers. Key topics covered include successive cancellation and superposition coding, MIMO wireless communication, network coding, and cooperative relaying. Also covered are feedback and interactive communication, capacity approximations and scaling laws, and asynchronous and random access channels. This book is ideal for use in the

This unique text helps make sense of big data in engineering applications using tools and techniques from signal processing. It presents fundamental signal processing theories and software implementations, reviews current research trends and challenges, and describes the techniques used for analysis, design and optimization. Readers will learn about key theoretical issues such as data modelling and representation, scalable and low-complexity information processing and optimization, tensor and sublinear algorithms, and deep learning and software architecture, and their application to a wide range of engineering scenarios. Applications discussed in detail include wireless networking, smart grid systems, and sensor networks and cloud computing. This is the ideal text for researchers and practising engineers wanting to solve practical problems involving large amounts of data, and for students looking to grasp the fundamentals of big data analytics.

Gain a detailed understanding of the protocols, network architectures and techniques being considered for 5G wireless networks with this authoritative guide to the state of the art. • Get up to speed with key topics such as cloud radio access networks, mobile edge computing, full duplexing, massive MIMO, mmWave, NOMA, Internet of things, M2M communications, D2D communications, mobile data offloading, interference mitigation techniques, radio resource management, visible light communications, and smart data pricing. • Learn from leading researchers in academia and industry about the most recent theoretical developments in the field. • Discover how each potential technology can increase the capacity, spectral efficiency, and energy efficiency of wireless systems. Providing the most comprehensive overview of 5G technologies to date, this is an essential reference for researchers, practicing engineers and graduate students working in wireless communications and networking.

The constantly increasing demand for more computing power can seem impossible to keep up with. However, multicore processors capable of performing computations in parallel allow computers to tackle ever larger problems in a wide variety of applications. This book provides a comprehensive introduction to parallel computing, discussing theoretical issues such as the fundamentals of concurrent processes, models of parallel and distributed computing, and metrics for evaluating and comparing parallel algorithms, as well as practical issues, including methods of designing and implementing shared- and distributed-memory programs, and standards for parallel program implementation, in particular MPI and OpenMP interfaces. Each chapter presents the basics in one place followed by advanced topics, allowing novices and experienced practitioners to quickly find what they need. A glossary and more than 80 exercises with selected solutions aid comprehension. The book is recommended as a text for adva

Perceptual organization is the neuro-cognitive process that enables us to perceive scenes as structured wholes consisting of objects arranged in space. Simplicity in Vision explores the intriguing idea that these perceived wholes are given by the simplest organizations of the scenes. Peter A. van der Helm presents a truly multidisciplinary approach to answer fundamental questions such as: Are simplest organizations sufficiently reliable to guide our actions? What is the nature of the regularities that are exploited to arrive at simplest organizations? To account for the high combinatorial capacity and speed of the perceptual organization process, he proposes transparallel processing by hyperstrings. This special form of distributed processing not only gives classical computers the extraordinary computing power that seemed reserved for quantum computers, but also explains how neuronal synchronization relates to flexible self-organizing cognitive architecture in between the relatively ri

Covering the fundamental principles and state-of-the-art cross-layer techniques, this practical guide provides the tools needed to design MIMO- and OFDM-based wireless networks that are both energy- and spectrum-efficient. Technologies are introduced in parallel for both centralized and distributed wireless networks to give you a clear understanding of the similarities and differences between their energy- and spectrum-efficient designs, which is essential for achieving the highest network energy saving without losing performance. Cutting-edge green cellular network design technologies, enabling you to master resource management for next-generation wireless networks based on MIMO and OFDM, and detailed real-world implementation examples are provided to guide your engineering design in both theory and practice. Whether you are a graduate student, a researcher or a practitioner in industry, this is an invaluable guide.

Stream processing is a novel distributed computing paradigm that supports the gathering, processing and analysis of high-volume, heterogeneous, continuous data streams, to extract insights and actionable results in real time. This comprehensive, hands-on guide combining the fundamental building blocks and emerging research in stream processing is ideal for application designers, system builders, analytic developers, as well as students and researchers in the field. This book introduces the key components of the stream computing paradigm, including the distributed system infrastructure, the programming model, design patterns and streaming analytics. The explanation of the underlying theoretical principles, illustrative examples and implementations using the IBM InfoSphere Streams SPL language and real-world case studies provide students and practitioners with a comprehensive understanding of such applications and the middleware that supports them.

Perceptual organization is the neuro-cognitive process that enables us to perceive scenes as structured wholes consisting of objects arranged in space. Simplicity in Vision explores the intriguing idea that these perceived wholes are given by the simplest organizations of the scenes. Peter A. van der Helm presents a truly multidisciplinary approach to answer fundamental questions such as: Are simplest organizations sufficiently reliable to guide our actions? What is the nature of the regularities that are exploited to arrive at simplest organizations? To account for the high combinatorial capacity and speed of the perceptual organization process, he proposes transparallel processing by hyperstrings. This special form of distributed processing not only gives classical computers the extraordinary computing power that seemed reserved for quantum computers, but also explains how neuronal synchronization relates to flexible self-organizing cognitive architecture in between the relatively ri

From its earliest days, the Fortran programming language has been designed with computing efficiency in mind. The latest standard, Fortran 2008, incorporates a host of modern features, including object-orientation, array operations, user-defined types, and provisions for parallel computing. This tutorial guide shows Fortran programmers how to apply these features in twenty-first-century style: modular, concise, object-oriented, and resource-efficient, using multiple processors. It offers practical real-world examples of interfacing to C, memory management, graphics and GUIs, and parallel computing using MPI, OpenMP, and coarrays. The author also analyzes several numerical algorithms and their implementations and illustrates the use of several open source libraries. Full source code for the examples is available on the book's website.

From its earliest days, the Fortran programming language has been designed with computing efficiency in mind. The latest standard, Fortran 2008, incorporates a host of modern features, including object-orientation, array operations, user-defined types, and provisions for parallel computing. This tutorial guide shows Fortran programmers how to apply these features in twenty-first-century style: modular, concise, object-oriented, and resource-efficient, using multiple processors. It offers practical real-world examples of interfacing to C, memory management, graphics and GUIs, and parallel computing using MPI, OpenMP, and coarrays. The author also analyzes several numerical algorithms and their implementations and illustrates the use of several open source libraries. Full source code for the examples is available on the book's website.

In this 1991 book, Hilbers discusses the general case of how to use processors simultaneously in order to solve a single problem rather than any specific application, and develops a theory independent of particular architectures. He starts by introducing distributed computing with graph theory, and considers processor networks and their price/performance ratios. He goes on to look at obtaining homogeneous distributions of work over networks and considers examples. Finally he discusses message routing within a processor network. This is intended to be a fundamental treatment of the relevant subjects and is aimed at computer scientists and graduate students in computer science who have experience with parallel processing: it will also be useful to others interested in processor networks.

This unified treatment of game theory focuses on finding state-of-the-art solutions to issues surrounding the next generation of wireless and communications networks. Future networks will rely on autonomous and distributed architectures to improve the efficiency and flexibility of mobile applications, and game theory provides the ideal framework for designing efficient and robust distributed algorithms. This book enables readers to develop a solid understanding of game theory, its applications and its use as an effective tool for addressing wireless communication and networking problems. The key results and tools of game theory are covered, as are various real-world technologies including 3G networks, wireless LANs, sensor networks, dynamic spectrum access and cognitive networks. The book also covers a wide range of techniques for modeling, designing and analysing communication networks using game theory, as well as state-of-the-art distributed design techniques. This is an ideal resou

This book presents an integrated collection of representative approaches for scaling up machine learning and data mining methods on parallel and distributed computing platforms. Demand for parallelizing learning algorithms is highly task-specific: in some settings it is driven by the enormous dataset sizes, in others by model complexity or by real-time performance requirements. Making task-appropriate algorithm and platform choices for large-scale machine learning requires understanding the benefits, trade-offs and constraints of the available options. Solutions presented in the book cover a range of parallelization platforms from FPGAs and GPUs to multi-core systems and commodity clusters, concurrent programming frameworks including CUDA, MPI, MapReduce and DryadLINQ, and learning settings (supervised, unsupervised, semi-supervised and online learning). Extensive coverage of parallelization of boosted trees, SVMs, spectral clustering, belief propagation and other popular learning algo

This comprehensive treatment of network information theory and its applications provides the first unified coverage of both classical and recent results. With an approach that balances the introduction of new models and new coding techniques, readers are guided through Shannon's point-to-point information theory, single-hop networks, multihop networks, and extensions to distributed computing, secrecy, wireless communication, and networking. Elementary mathematical tools and techniques are used throughout, requiring only basic knowledge of probability, whilst unified proofs of coding theorems are based on a few simple lemmas, making the text accessible to newcomers. Key topics covered include successive cancellation and superposition coding, MIMO wireless communication, network coding, and cooperative relaying. Also covered are feedback and interactive communication, capacity approximations and scaling laws, and asynchronous and random access channels. This book is ideal for use in the

The arrival and popularity of multi-core processors has sparked a renewed interest in the development of parallel programs. Similarly, the availability of low-cost microprocessors and sensors has generated a great interest in embedded real-time programs. This book provides students and programmers whose backgrounds are in traditional sequential programming with the opportunity to expand their capabilities into parallel, embedded, real-time and distributed computing. It also addresses the theoretical foundation of real-time scheduling analysis, focusing on theory that is useful for actual applications. Written by award-winning educators at a level suitable for undergraduates and beginning graduate students, this book is the first truly entry-level textbook in the subject. Complete examples allow readers to understand the context in which a new concept is used, and enable them to build and run the examples, make changes, and observe the results.

Designing distributed computing systems is a complex process requiring a solid understanding of the design problems and the theoretical and practical aspects of their solutions. This comprehensive textbook covers the fundamental principles and models underlying the theory, algorithms and systems aspects of distributed computing. Broad and detailed coverage of the theory is balanced with practical systems-related issues such as mutual exclusion, deadlock detection, authentication, and failure recovery. Algorithms are carefully selected, lucidly presented, and described without complex proofs. Simple explanations and illustrations are used to elucidate the algorithms. Important emerging topics such as peer-to-peer networks and network security are also considered. With vital algorithms, numerous illustrations, examples and homework problems, this textbook is suitable for advanced undergraduate and graduate students of electrical and computer engineering and computer science. Practitioner

Games provide mathematical models for interaction. Numerous tasks in computer science can be formulated in game-theoretic terms. This fresh and intuitive way of thinking through complex issues reveals underlying algorithmic questions and clarifies the relationships between different domains. This collection of lectures, by specialists in the field, provides an excellent introduction to various aspects of game theory relevant for applications in computer science that concern program design, synthesis, verification, testing and design of multi-agent or distributed systems. Originally devised for a Spring School organised by the GAMES Networking Programme in 2009, these lectures have since been revised and expanded, and range from tutorials concerning fundamental notions and methods to more advanced presentations of current research topics. This volume is a valuable guide to current research on game-based methods in computer science for undergraduate and graduate students. It will also in

Originally published in 2002, this book presents techniques in the application of formal methods to object-based distributed systems. A major theme of the book is how to formally handle the requirements arising from OO distributed systems, such as dynamic reconfiguration, encapsulation, subtyping, inheritance, and real-time aspects. These may be supported either by enhancing existing notations, such as UML, LOTOS, SDL and Z, or by defining fresh notations, such as Actors, Pi-calculus and Ambients. The major specification notations and modelling techniques are introduced and compared by leading researchers. The book also includes a description of approaches to the specification of non-functional requirements, and a discussion of security issues. Researchers and practitioners in software design, object-oriented computing, distributed systems, and telecommunications systems will gain an appreciation of the relationships between the major areas of concerns and learn how the use of object-o

JavaTech is a practical introduction to the Java programming language with an emphasis on the features that benefit technical computing. After presenting the basics of object-oriented programming in Java, it examines introductory topics such as graphical interfaces and thread processes. It goes on to review network programming and develops Web client-server examples for tasks such as monitoring remote devices. The focus then shifts to distributed computing with RMI. Finally, it examines how Java programs can access the local platform and interact with hardware. Topics include combining native code with Java, communication via serial lines, and programming embedded processors. An extensive web site supports the book with additional instructional materials. JavaTech demonstrates the ease with which Java can be used to create powerful network applications and distributed computing applications. It will be used as a textbook for programming courses, and by researchers who need to learn Jav

Originally published in 1993, this book was the first to offer a comprehensive review of large eddy simulations (LES) - the history, state of the art, and promising directions for research. Among topics covered are fundamentals of LES; LES of incompressible, compressible, and reacting flows; LES of atmospheric, oceanic, and environmental flows; and LES and massivelt parallel computing. The book grew out of an international workshop that, for the first time, brought together leading researchers in engineering and geophysics to discuss developments and applications of LES models in their respective fields. It will be of value to anyone with an interest in turbulence modelling.

Process algebra is a widely accepted and much used technique in the specification and verification of parallel and distributed software systems. This book sets the standard for the field. It assembles the relevant results of most process algebras currently in use, and presents them in a unified framework and notation. The authors describe the theory underlying the development, realization and maintenance of software that occurs in parallel or distributed systems. A system can be specified in the syntax provided, and the axioms can be used to verify that a composed system has the required external behaviour. As examples, two protocols are completely specified and verified in the text: the Alternating-Bit Protocol for Data Communication, and Fischer's Protocol of Mutual Exclusion. The book serves as a reference text for researchers and graduate students in computer science, offering a complete overview of the field and referring to further literature where appropriate.

Wireless sensor networks are set to play a key role in a wide range of civilian and military applications, with tiny sensors connected through wireless links performing various sensing, computing, communication, and control tasks in highly distributed systems. This book presents a critical element in the deployment of wireless sensor networks: the process of synchronization. It summarizes the most important clock synchronization protocols proposed for wireless sensor networks with special emphasis placed on deriving efficient clock offset estimation schemes and performance benchmarks. Graduate students of electrical and computer engineering and computer science will find this a valuable resource, as will engineers who are interested in designing efficient clock synchronization algorithms and improving the performance of existing synchronization protocols.

The world is increasingly populated with interactive agents distributed in space, real or abstract. These agents can be artificial, as in computing systems that manage and monitor traffic or health; or they can be natural, e.g. communicating humans, or biological cells. It is important to be able to model networks of agents in order to understand and optimise their behaviour. Robin Milner describes in this book just such a model, by presenting a unified and rigorous structural theory, based on bigraphs, for systems of interacting agents. This theory is a bridge between the existing theories of concurrent processes and the aspirations for ubiquitous systems, whose enormous size challenges our understanding. The book is reasonably self-contained mathematically, and is designed to be learned from: examples and exercises abound, solutions for the latter are provided. Like Milner's other work, this is destined to have far-reaching and profound significance.

The world is increasingly populated with interactive agents distributed in space, real or abstract. These agents can be artificial, as in computing systems that manage and monitor traffic or health; or they can be natural, e.g. communicating humans, or biological cells. It is important to be able to model networks of agents in order to understand and optimise their behaviour. Robin Milner describes in this book just such a model, by presenting a unified and rigorous structural theory, based on bigraphs, for systems of interacting agents. This theory is a bridge between the existing theories of concurrent processes and the aspirations for ubiquitous systems, whose enormous size challenges our understanding. The book is reasonably self-contained mathematically, and is designed to be learned from: examples and exercises abound, solutions for the latter are provided. Like Milner's other work, this is destined to have far-reaching and profound significance.

First published in 1976, this monograph presents an exposition of some of the more important theoretical and computational techniques that have been developed for the determination and interpretation of molecular wave functions. Although a comprehensive theory of the electronic structure and bonding in molecules had been developed by 1960, only with the advent of the electronic computer in the late 1950s did it become possible to perform accurate non-empirical calculations for molecules of chemical interest; indeed, much of the subsequent evolution of the theory has occurred in parallel with the development of computing machines and techniques.

Information theory lies at the heart of modern technology, underpinning all communications, networking, and data storage systems. This book sets out, for the first time, a complete overview of both classical and quantum information theory. Throughout, the reader is introduced to key results without becoming lost in mathematical details. Opening chapters present the basic concepts and various applications of Shannon's entropy, moving on to the core features of quantum information and quantum computing. Topics such as coding, compression, error-correction, cryptography and channel capacity are covered from classical and quantum viewpoints. Employing an informal yet scientifically accurate approach, Desurvire provides the reader with the knowledge to understand quantum gates and circuits. Highly illustrated, with numerous practical examples and end-of-chapter exercises, this text is ideal for graduate students and researchers in electrical engineering and computer science, and practitione

Presenting the fundamentals of cooperative communications and networking, this book treats the concepts of space, time, frequency diversity and MIMO, with a holistic approach to principal topics where significant improvements can be obtained. Beginning with background and MIMO systems, Part I includes a review of basic principles of wireless communications and space-time diversity and coding. Part II then presents topics on physical layer cooperative communications such as relay channels and protocols, performance bounds, multi-node cooperation, and energy efficiency. Finally, Part III focuses on cooperative networking including cooperative and content-aware multiple access, distributed routing, source-channel coding, and cooperative OFDM. Including end-of-chapter review questions, this text will appeal to graduate students of electrical engineering and is an ideal textbook for advanced courses on wireless communications. It will also be of great interest to practitioners in the wirele

Ensuring secure transmission and good quality of service (QoS) in ad hoc wireless networks are key commercial concerns. Focusing on practical potential solutions, this text covers security and QoS in these networks. Starting with a review of the basic principles of ad hoc wireless networking, coverage progresses to vulnerabilities, and the requirements and solutions necessary to tackle them. QoS in relation to ad hoc networks is covered in detail, with specific attention to routing, QoS support in unicast communication, and recent developments in the area. Secure routing, intrusion detection, security in WiMax networks and trust management are also covered, the latter being based on principles and practice of key management and authentication in distributed networks. Representing the state-of-the-art in ad hoc wireless network security, this book is a valuable resource for researchers in electrical and computer engineering, as well as practitioners in the wireless communications indust

This book, first published in 2000, explores the exciting field of complexity. It features in-depth coverage of important theoretical areas, including fractals, chaos, non-linear dynamics, artificial life and self-organization. It also provides overviews of complexity in several applied areas, including parallel computation, control systems, neural systems and ecosystems. Some of the properties that best characterize complex systems, including algorithmic richness, non-linearity and abundant interactions between components are examined. In this way the book draws out themes, especially the ideas of connectivity and natural computation, that reveal deep, underlying similarities between phenomena that have formerly been treated as completely distinct. The idea of natural computation is particularly rich in fresh approaches applicable to both biology and computing. Analogies such as the DNA code as life's underlying program, or organisms as automata, are very compelling. Conversely, biolo

From the Internet's infrastructure to operating systems like GNU/Linux, the open source movement comprises some of the greatest accomplishments in computing over the past quarter century. Its story embraces technological advances, unprecedented global collaboration, and remarkable tools for facilitating distributed development. The evolution of the Internet enabled an enormous expansion of open development, allowing developers to exchange information and ideas without regard to constraints of space, time, or national boundary. The movement has had widespread impact on education and government, as well as historic cultural and commercial repercussions. Part I discusses key open source applications, platforms, and technologies used in open development. Part II explores social issues ranging from demographics and psychology to legal and economic matters. Part III discusses the Free Software Foundation, open source in the public sector (government and education), and future prospects.

From the Internet's infrastructure to operating systems like GNU/Linux, the open source movement comprises some of the greatest accomplishments in computing over the past quarter century. Its story embraces technological advances, unprecedented global collaboration, and remarkable tools for facilitating distributed development. The evolution of the Internet enabled an enormous expansion of open development, allowing developers to exchange information and ideas without regard to constraints of space, time, or national boundary. The movement has had widespread impact on education and government, as well as historic cultural and commercial repercussions. Part I discusses key open source applications, platforms, and technologies used in open development. Part II explores social issues ranging from demographics and psychology to legal and economic matters. Part III discusses the Free Software Foundation, open source in the public sector (government and education), and future prospects.

Concurrent Programming in ML focuses on the practical use of concurrency to implement naturally concurrent applications. In addition to a tutorial introduction to programming in Concurrent ML (CML), the book presents three extended examples using CML for practical systems programming: a parallel software build system, a simple concurrent window manager, and an implementation of distributed tuple spaces. CML, which is included as part of the SML of New Jersey (SML/NJ) distribution, combines the best features of concurrent programming and functional programming. This book also illustrates advanced SML programming techniques, and includes a chapter on the implementation of concurrency using features provided by the SML/NJ system. It will be of interest to programmers, students, and professional researchers working in computer language development.

This book sets out the principles of parallel computing in a way which will be useful to student and potential user alike. It includes coverage of both conventional and neural computers. The content of the book is arranged hierarchically. It explains why, where and how parallel computing is used; the fundamental paradigms employed in the field; how systems are programmed or trained; technical aspects including connectivity and processing element complexity; and how system performance is estimated (and why doing so is difficult). The penultimate chapter of the book comprises a set of case studies of archetypal parallel computers, each study written by an individual closely connected with the system in question. The final chapter correlates the various aspects of parallel computing into a taxonomy of systems.

In this text, students of applied mathematics, science and engineering are introduced to fundamental ways of thinking about the broad context of parallelism. The authors begin by giving the reader a deeper understanding of the issues through a general examination of timing, data dependencies, and communication. These ideas are implemented with respect to shared memory, parallel and vector processing, and distributed memory cluster computing. Threads, OpenMP, and MPI are covered, along with code examples in Fortran, C, and Java. The principles of parallel computation are applied throughout as the authors cover traditional topics in a first course in scientific computing. Building on the fundamentals of floating point representation and numerical error, a thorough treatment of numerical linear algebra and eigenvector/eigenvalue problems is provided. By studying how these algorithms parallelize, the reader is able to explore parallelism inherent in other computations, such as Monte Carlo