Applying software reuse to many embedded real-time systems, such as autonomous mobile robot system poses significant challenges to industrial software processes due to the resource-constrained and real-time requiremen...
详细信息
ISBN:
(纸本)9780769532639
Applying software reuse to many embedded real-time systems, such as autonomous mobile robot system poses significant challenges to industrial software processes due to the resource-constrained and real-time requirements of the systems. An approach for early life-cycle systematic reuse for component-based softwareengineering (ELCRA) of autonomous mobile robot software is developed The approach allows reuse at the early stage of software development process by integrating analysis patterns, component model, and component-oriented programming framework. The results of applying the approach in developing software for real robots show that the strategies and processes proposed in the approach can fulfill requirements for self-contained, platform-independent and real-time predictable mobile robot.
Performance modeling is becoming an increasingly important part of the parallel application development process, particulary for expensive computations that will be run on very high-end systems where resources are sca...
详细信息
ISBN:
(纸本)9780769549712
Performance modeling is becoming an increasingly important part of the parallel application development process, particulary for expensive computations that will be run on very high-end systems where resources are scarce. We describe a performance modeling tool SIPMaP (Super Instruction Processor Modeling and Prediction) developed for the Super-Instruction Architecture (SIA). The SIA is designed for applications where the dominant data structures are large multi-dimensional arrays and it comprises a DSL, the Super-Instruction Assembly Language (SIAL) that supports expressing algorithms in terms of blocks (tiles), and its runtime system Super Instruction Processor (SIP) that manages distribution and disk storage of the arrays. SIPMaP generates performance models from the SIAL source code. In comparison with many applications where useful performance models have been developed and reported, these programs are irregular and have other difficult to model characteristics such as extensive overlapping of communication and computation.
softwaredistributed Shared Memory (DSM) systems can be used to provide a coherent shared address space on multicomputers and other parallelsystems without support for shared memory in hardware. The coherency softwar...
详细信息
Performance debugging and prediction for parallelsystems is a difficult problem. The difficulties in identifying performance bottlenecks stem from the need for an intimate understanding of the underlying architecture...
详细信息
Performance debugging and prediction for parallelsystems is a difficult problem. The difficulties in identifying performance bottlenecks stem from the need for an intimate understanding of the underlying architecture. It has been recognized that portability is an important requirement for parallel program development. However, this makes the task of performance debugging even more difficult. In this paper, we present a simulation based approach for performance prediction of portable parallel programs. We demonstrate it using Charm: a message driven programming environment, which provides program portability across a variety of shared and distributed memory MIMD parallelsystems. The proposed approach makes it possible to use a single debugging environment for the development of portable parallelsoftware. This environment can provide correctness and performance debugging support that provides the developer with valuable feedback for improving program performance.
Concurrency and consistency are the two inherent and complex characteristics of distributedsystems. Their types, levels and implementation procedures determine the nature and efficiency of a distributed system. Concu...
详细信息
ISBN:
(纸本)9781665431682
Concurrency and consistency are the two inherent and complex characteristics of distributedsystems. Their types, levels and implementation procedures determine the nature and efficiency of a distributed system. Concurrency and consistency are difficult concepts to understand, moreover, without a comprehensive understanding a complete system cannot be designed and built. Applying a comprehensive understanding of concurrency and consistency to the design of a distributed system will generate a system that is more closely aligned with the desired outcomes. This paper analyses both concurrency and consistency in distributedsystems to present a comprehensive understanding of their requirements, types, levels, benefits and limitations. Initially, it analyses concurrency and compares it with parallelism to distinguish the two related but distinct terms. Subsequently, it analyses consistency and different consistency models including a comparative analysis of strong consistency and weak consistency models, and data-centric consistency and client-centric consistency models.
Reconfigurable computing systems have already shown their abilities to accelerate embedded hardware/ softwaresystems. Since standard processor-based embedded applications have come to their limits we need new concept...
详细信息
In this paper, we consider the problem of scheduling a special kind of mixed data-parallel applications arising in the context of continuous integration. Continuous integration (CI) is a softwareengineering technique...
详细信息
ISBN:
(纸本)9780769546766
In this paper, we consider the problem of scheduling a special kind of mixed data-parallel applications arising in the context of continuous integration. Continuous integration (CI) is a softwareengineering technique, which consists in rebuilding and testing interdependent software components as soon as developers modify them. The CI tool is able to provide quick feedback to the developers, which allows them to fix the bug soon after it has been introduced. The CI process can be described as a DAG where nodes represent package build tasks, and edges represent dependencies among these packages;build tasks themselves can in turn be run in parallel. Thus, CI can be viewed as a mixed data-parallel application. A crucial point for a successful CI process is its ability to provide quick feedback. Thus, makespan minimization is the main goal. Our contribution is twofold. First we provide and analyze a large dataset corresponding to a build DAG. Second, we compare the performance of several scheduling heuristics on this dataset.
Performance analysis through visualization techniques usually suffers semantic limitations due to the size of parallel applications. Most performance visualization tools rely on data aggregation to work at scale, with...
详细信息
ISBN:
(纸本)9781479936069
Performance analysis through visualization techniques usually suffers semantic limitations due to the size of parallel applications. Most performance visualization tools rely on data aggregation to work at scale, without any attempt to evaluate the loss of information caused by such aggregations. This paper proposes a technique to evaluate the quality of aggregated representations - using measures from information theory - and to optimize such measures in order to build consistent multiresolution representations of large execution traces.
The proceedings contain 8 papers. The topics discussed include: a debugger for flow graph based parallel applications;organizing processes and threads for debugging;techniques for specifying bug patterns;testing patte...
详细信息
ISBN:
(纸本)159593748X
The proceedings contain 8 papers. The topics discussed include: a debugger for flow graph based parallel applications;organizing processes and threads for debugging;techniques for specifying bug patterns;testing patterns for software transactional memory engines;semantics driven dynamic partial-order reduction of MPI-based parallel programs;and healing data races on-the-fly.
In this paper we introduce a method for generating unstructured meshes in parallel which are partitioned in a 'good' way. When solving a partial differential equation on a paralleldistributed memory machine, ...
详细信息
In this paper we introduce a method for generating unstructured meshes in parallel which are partitioned in a 'good' way. When solving a partial differential equation on a paralleldistributed memory machine, the mesh should be decomposed so that the communication requirement of the numerical solver is minimised and also the amount of work to be performed on each processor is approximately equal. Most previous work in this area has concentrated on partitioning a mesh that has already been generated. We introduce a method which actually generates the partitioned mesh in parallel whilst producing a good quality decomposition and compare this method with other approaches. Copyright (C) 1996 Civil-Comp Limited and Elsevier Science Limited
暂无评论