Parallel processing is an area of growing interest to the computer science and engineering communities. This paper is an introduction to some of the concepts involved in the design and use of large-scale parallel systems. Parallel machines that are classified as SIMD (synchronous) and MIMD (asynchronous) systems, composed of a large number of microprocessors, are explored. Parallel algorithms a...

1. Historical Background 2. Modeling and Model Reduction 2.1. Aggregation 2.1.1 Balanced Aggregation 2.2. Perturbation 2.2.1. Weakly Coupled Models 3. Strongly Coupled Models 4. Hierarchical Control 4.1. Goal Coordination: Interaction Balance 4.2. Interaction Prediction 5. Decentralized Control 5.1. Stabilization Problem 5.2. Fixed Modes and Polynomials 5.3. Stabilization via Dynamic Compensati...

Building systems from existing applications written in two or more languages is common practice. Such systems are polylingual. Polylingual systems are relatively easy to build when the number of APIs needed to achieve language interoperability is small. However, when the number of distinct APIs become large, maintaining and evolving them becomes a notoriously difficult task. We present a practi...

Neuromorphic computing covers a diverse range of approaches to information processing all of which demonstrate some degree of neurobiological inspiration that differentiates them from mainstream conventional computing systems. The philosophy behind neuromorphic computing has its origins in the seminal work carried out by Carver Mead at Caltech in the late 1980s. This early work influenced other...

Introduction The ability to build computing systems that can observe, understand and act on day-today physical human activity has long been a goal of computing research. Such systems could have profound conceptual and practical implications. Since the ability to reason and act based on activity is one of the central aspects of human intelligence, from a conceptual viewpoint such a system could ...

Cooperative and peer-to-peer services both seek to provide a way to scale services beyond what can be provided by even a high-end server machine. Cooperative services do this by treating a service as a parallel program and then running the program across a cluster of machines. Key challenges include rearchitecting services not only to provide good performance by balancing parallelism and locali...

In this chapter, scheduling is defined as the activity that consists in mapping a task graph onto a target platform. The task graph represents the application, nodes denote computational tasks, and edges model precedence constraints between tasks. For each task, an assignment (choose the processor that will execute the task) and a schedule (decide when to start the execution) are determined. Th...

Ultra-large scale simulations via solving Partial Differential Equations (PDEs) require very large computational systems for their timely solution. Studies shown the rate of failure grows with the system size and these trends are likely to worsen in future machines. Thus, as systems, and the problems solved on them, continue to grow, the ability to survive failures is becoming a critical aspect...

This paper discusses a framework for supporting heterogeneous computing systems hcs hcs are physically distributed potentially complex and evolving systems hcs consist of a number of computers and in terconnections which may have di ering language and system support and sometimes distinct computational architectural models By providing a large num ber of computational resources to the user hcs ...

— This paper introduces systolic automata for VLSI as highly concurrent acceptors. Attention is focused on tree automata although other types are also discussed briefly. A number of preliminary results about the capabilities of such automata are obtained. The approach not only opens up a new and interesting area oflanguage theory but also its results give useful hints for VLSI system design par...