Responsive systems are fault-tolerant, real-time systems in parallel and distributed environments. Recently, several approaches to responsive system design have been developed. By incorporating key concepts in these a...
详细信息
Responsive systems are fault-tolerant, real-time systems in parallel and distributed environments. Recently, several approaches to responsive system design have been developed. By incorporating key concepts in these approaches to communication protocols, responsive protocols are defined as protocols that can revert to a normal state in bounded time, even when they enter abnormal states due to faults. Fundamentally, communication protocols can be made responsive by adding timely checkpointing and rollback recovery to them. In this paper, we discuss fault-tolerant, real-time performance (called responsiveness) of such protocols and propose an algorithm to compute responsiveness of protocols whose reachability graphs form acyclic directed graphs. Finally, we also present several simulation results to analyze dynamic behaviors of such protocols.
The proceedings contain 24 papers. The special focus in this conference is on Evolutionary Computing. The topics include: Formal memetic algorithms;a statistical mechanical formulation of the dynamics of genetic algor...
ISBN:
(纸本)9783540584834
The proceedings contain 24 papers. The special focus in this conference is on Evolutionary Computing. The topics include: Formal memetic algorithms;a statistical mechanical formulation of the dynamics of genetic algorithms;evolutionary stability in simple classifier systems;nonbinary transforms for genetic algorithm problems;enhancing evolutionary computation using analogues of biological mechanisms;exploiting mate choice in evolutionary computation;an empirical comparison of selection methods in evolutionary algorithms;genetic algorithms and directed adaptation;genetic algorithms and neighbourhood search;a unified paradigm for parallel genetic algorithms;distributed coevolutionary genetic algorithms for multi-criteria and multi-constraint optimisation;inductive operators and rule repair in a hybrid genetic learning system;adaptive learning of a robot arm;co-evolving co-operative populations of rules in learning control systems;learning anticipatory behaviour using a delayed action classifier system;applying a restricted mating policy to determine state space niches using immediate and delayed reinforcement;a comparison between two architectures for searching and learning in maze problems;fast practical evolutionary timetabling;optimising a presentation timetable using evolutionary algorithms;genetic algorithms for digital signal processing;complexity reduction using expansive coding and the application of genetic programming to the investigation of short, noisy, chaotic data series.
We obtain stochastic bounds on execution times of parallel computations assuming ideal conditions for shared resources. A parallel computation is modelled as a task system with precedence constraints expressed as a di...
详细信息
We obtain stochastic bounds on execution times of parallel computations assuming ideal conditions for shared resources. A parallel computation is modelled as a task system with precedence constraints expressed as a directed acyclic graph (DAG). The task execution times are assumed independent random variables. The performance measure considered is the overall execution time of the computation. To obtain upper bounds on this measure, we apply stochastic ordering and stochastic comparison techniques.< >
IVD, Interactive Visualization Debugger is intended to provide on-line and integrated mechanisms for debugging, performance analysis, and data visualization for message-passing parallel applications. The current IVD i...
详细信息
IVD, Interactive Visualization Debugger is intended to provide on-line and integrated mechanisms for debugging, performance analysis, and data visualization for message-passing parallel applications. The current IVD includes: (I) ESP, a mechanism to multicast window-based commands from a single control window to some subset of existing debuggers/visualizers on various processes; (2) program replay to reproduce program runs deterministically to enable cyclic debugging; and (3) ad hoc data visualization of distributed arrays using existing visualizers.< >
In this paper, we consider the problem of partitioning a conservative parallelsimulation for execution on a multi-computer. The synchronization protocol makes use of null messages [6]. We propose the use of a simulat...
ISBN:
(纸本)9781565550278
In this paper, we consider the problem of partitioning a conservative parallelsimulation for execution on a multi-computer. The synchronization protocol makes use of null messages [6]. We propose the use of a simulated annealing algorithm with an adaptive search schedule to find good (sub-optimal) partitions. The paper discusses the algorithm, its implementation and reports on the performance results of simulations of a partitioned FCFS queueing network model executed on iPSC/860 hypercube. The results obtained are compared with a random partitioning. They show that a partitioning which makes use of our simulated annealing algorithm results in a reduction of 25-35% of the running time of the simulations when compared to the running time of a random partition of the model.
Large concurrent or distributed systems have proven notoriously difficult to comprehend due to their combinatoric complexity. There is a clear need for thorough formal system modeling at all design stages. Ease of use...
详细信息
Large concurrent or distributed systems have proven notoriously difficult to comprehend due to their combinatoric complexity. There is a clear need for thorough formal system modeling at all design stages. Ease of use and validation capability are important criteria in method selection. It is important that the selection permit evaluation of design details with respect to performance and behavioral goals. Net models are a likely candidate to achieve the requisite needs of such a modeling environment. They provide both graphical and mathematical system modeling views which inherently enable both quantitative and qualitative analysis of the design. To demonstrate this claim, a colored Petri Net model and performance analysis of a particular scalable multiprocessor interconnect fabric is presented. The fundamental component of this fabric is an adaptive routing device, R2. The R2 fabric is based on the interconnection scheme used in the Mayfly parallel processing system.< >
This conference proceedings contains 22 papers on advances in the design and analysis of algorithms for parallel and distributedsimulation. Topics discussed include selecting the checkpoint interval in time warp para...
详细信息
ISBN:
(纸本)1565550552
This conference proceedings contains 22 papers on advances in the design and analysis of algorithms for parallel and distributedsimulation. Topics discussed include selecting the checkpoint interval in time warp parallelsimulation, parallel algorithms for simulating continuous time Markov chains, determining initial states for time-parallelsimulations, global synchronization for optimistic parallel discrete event simulation, an algorithm for minimally latent global virtual time, a parallel partitioning technique for use with conservative parallelsimulation, disseminating critical synchronization information in parallel discrete event simulations, shared variables in distributedsimulation, high performance parallel logic simulation on a network of workstations, corolla partitioning for distributed logic simulation of VLSI circuits, efficient implementation of event sets in time warp, an analytical comparison of periodic checkpointing and incremental state saving, parallelsimulation of communicating finite state machines, the effect of synchronization requirements on the performance of distributedsimulations, and time warp simulation in time-constrained systems.
Synchronization is a significant cost in many parallel programs, and can be a major bottleneck if it is handled in a centralized fashion using traditional shared-memory constructs such as barriers. In a parallel time-...
详细信息
ISBN:
(纸本)1565550552
Synchronization is a significant cost in many parallel programs, and can be a major bottleneck if it is handled in a centralized fashion using traditional shared-memory constructs such as barriers. In a parallel time-stepped simulation, the use of global synchronization primitives limits scalability, increases the sensitivity to load imbalance, and reduces the potential for exploiting locality to improve cache behavior. This paper presents the results of an initial one-application study quantifying the costs and performance benefits of distributed, nearest neighbors synchronization. The application studied, MP3D, is a particle-based wind tunnel simulation. Our results for this one application on current shared-memory multiprocessors show a significant decrease in synchronization time using these techniques. We prototyped an application-independent library that implements distributed synchronization. The library allows a variety of parallelsimulations to exploit these techniques without increasing the application programming beyond that of conventional approaches.
Recent experiments have shown that conservative methods can achieve good performance by exploiting the characteristics of the system being simulated. In this paper we focus on the interrelationship between run time an...
详细信息
ISBN:
(纸本)1565550552
Recent experiments have shown that conservative methods can achieve good performance by exploiting the characteristics of the system being simulated. In this paper we focus on the interrelationship between run time and synchronization requirements of a distributedsimulation. A metric that considers the effect of lookahead and the physical rate of transmission of messages, and an arrival approximation that models the effect of synchronization requirements on the run time are developed. It is shown that even when good lookahead is exploited in the system, poor run-time performance is achieved if an inefficient mapping of LPs to processors is used.
暂无评论