ZPL is a new array programming language for science and engineering computation. Designed for fast execution on both sequential and parallel computers, it is intended to replace languages such as Fortran and C. Because ZPL benefits from recent research in parallel compilation, it provides a convenient high-level programming medium for supercomputers with efficiency comparable to hand-coded message-passing programs.
The concept of fuzzy sets is one of the most fundamental and influential tools in computational intelligence. Fuzzy sets can provide solutions to a broad range of problems of control, pattern classification, reasoning, planning, and computer vision. This book bridges the gap that has developed between theory and practice. The authors explain what fuzzy sets are, why they work, when they should be used (and when they shouldn't), and how to design systems using them.
PLAPACK is a library infrastructure for the parallel implementation of linear algebra algorithms and applications on distributed memory supercomputers such as the Intel Paragon, IBM SP2, Cray T3D/T3E, SGI PowerChallenge, and Convex Exemplar. This infrastructure allows library developers, scientists, and engineers to exploit a natural approach to encoding so-called blocked algorithms, which achieve high performance by operating on submatrices and subvectors.
This text evolved from a new curriculum in scientific computing that was developed to teach undergraduate science and engineering majors how to use high-performance computing systems (supercomputers) in scientific and engineering applications.
Written by the team that developed the software, this tutorial is the definitive resource for scientists, engineers, and other computer users who want to use PVM to increase the flexibility and power of their high-performance computing resources. PVM introduces distributed computing, discusses where and how to get the PVM software, provides an overview of PVM and a tutorial on setting up and running existing programs, and introduces basic programming techniques including putting PVM in existing code.
Communication Complexity describes a new intuitive model for studying circuit networks that captures the essence of circuit depth. Although the complexity of boolean functions has been studied for almost 4 decades, the main problems the inability to show a separation of any two classes, or to obtain nontrivial lower bounds remain unsolved. The communication complexity approach provides clues as to where to took for the heart of complexity and also sheds light on how to get around the difficulty of proving lower bounds.
The field of VLSI (Very Large Scale Integration) is concerned with the design, production, and use of highly complex integrated circuits. The research collected here comes from many disciplines, including computer architecture, computer-aided design, parallel algorithms, semiconductor technology, and testing.