We present a process algebra with conditionally distributed discrete-time delays and generally-distributed stochastic delays. the treatment allows for expansion laws for the parallel composition and the maximal progre...
详细信息
ISBN:
(纸本)9781424418381
We present a process algebra with conditionally distributed discrete-time delays and generally-distributed stochastic delays. the treatment allows for expansion laws for the parallel composition and the maximal progress operator. the approach is illustrated by a specification of the concurrent alternating bit protocol with generally-distributed unreliable channels in the language X. We compare performance analysis using timed probabilistic reward graphs and discrete-event simulation.
the evaluation of network performance under real application loads is carried out by detailed time-intensive and resource-intensive simulations. Moreover, the use of ILP (instruction-level parallel) processors in cc-N...
详细信息
the proceedings contain 7 papers. the topics discussed include: memetic algorithm for web service selection;model-driven performance engineering for wireless sensor networks with feature modeling and event calculus;de...
ISBN:
(纸本)9781450307338
the proceedings contain 7 papers. the topics discussed include: memetic algorithm for web service selection;model-driven performance engineering for wireless sensor networks with feature modeling and event calculus;description and composition of bio-inspired design patterns: the gradient case;methods for self-organizing distributed software;protein structure prediction using particle swarm optimization and a distributedparallel approach;discrete optimization problem solving withthree variants of hybrid binary particle swarm optimization;and self-organized invasive parallel optimization.
In this paper, the relationship between the computational models of Object-Oriented Rewriting and parallel Discrete-Event simulation models is explored. A discrete-event simulation program in which several objects int...
详细信息
ISBN:
(纸本)0818683325
In this paper, the relationship between the computational models of Object-Oriented Rewriting and parallel Discrete-Event simulation models is explored. A discrete-event simulation program in which several objects interact with each other by exchanging messages may have a high degree of concurrency (which can be exploited using optimistic or conservative parallelsimulation methods). We report on some observations on using Rewriting Logic in the field of parallel Discrete Event simulations, and investigate how parallelsimulation applications can be expressed using Object-Oriented Rewriting.
A difference scheme for noise removal based on four-order partial differential equations is suggested. It can approximate actual image while preserving edges and avoiding blocky effects in image processing. Numerical ...
详细信息
ISBN:
(纸本)0769529097
A difference scheme for noise removal based on four-order partial differential equations is suggested. It can approximate actual image while preserving edges and avoiding blocky effects in image processing. Numerical results are demonstrated its efficiency and the better choice of parameters.
distributed signal processing algorithms suitable for their implementation over wireless sensor networks (WSNs) and ad hoc networks with communications and computing capabilities have become a hot topic during the pas...
详细信息
ISBN:
(纸本)9781479914814
distributed signal processing algorithms suitable for their implementation over wireless sensor networks (WSNs) and ad hoc networks with communications and computing capabilities have become a hot topic during the past years. One class of algorithms that have received special attention are particles filters. However, most distributed versions of this type of methods involve various heuristic or simplifying approximations and, as a consequence, classical convergence theorems for standard particle filters do not hold for their distributed counterparts. In this paper, we look into a distributed particle filter scheme that has been proposed for implementation in bothparallel computing systems and WSNs, and prove that, under certain stability assumptions regarding the physical system of interest, its asymptotic convergence is guaranteed. Moreover, we show that convergence is attained uniformly over time. this means that approximation errors can be kept bounded for an arbitrarily long period of time without having to progressively increase the computational effort.
Fast, efficient parallel algorithms are presented for discrete event simulations of dynamic channel assignment schemes for wireless cellular communication networks. the driving events are call arrivals and departures,...
详细信息
ISBN:
(纸本)1565550277
Fast, efficient parallel algorithms are presented for discrete event simulations of dynamic channel assignment schemes for wireless cellular communication networks. the driving events are call arrivals and departures, in continuous time, to cells geographically distributed across the service area. A dynamic channel assignment scheme decides which call arrivals to accept, and which channels to allocate to the accepted calls, attempting to minimize call blocking while ensuring co-channel interference is tolerably low. Specifically, the scheme ensures that the same channel is used concurrently at different cells only if the pairwise distances between those cells are sufficiently large. Much of the complexity of the system comes from ensuring this separation. the network is modeled as a system of interacting continuous time automata, each corresponding to a cell. To simulate the model, we use conservative methods;i.e., methods in which no errors occur in the course of the simulation and so no rollback or relaxation is needed. Implemented on a 16K processor MasPar MP-1, an elegant and simple technique provides speedups of about I5x over an optimized serial simulation running on a high speed workstation. A drawback of this technique, typical of conservative methods, is that processor utilization is rather low. To overcome this, we developed new methods that exploit slackness in event dependencies over short intervals of time, thereby raising the utilization to above 50% and the speedup over the optimized serial code to about 120x with respect to the workstation simulation.
In previous work we have introduced JavaSymphony, a system whose purpose is to simplify the development of distributed and parallel Java applications. JavaSymphony is a Java library that allows to control parallelism,...
详细信息
ISBN:
(纸本)076951880X
In previous work we have introduced JavaSymphony, a system whose purpose is to simplify the development of distributed and parallel Java applications. JavaSymphony is a Java library that allows to control parallelism, load balancing, and locality at a high level. Objects can be explicitly distributed and migrated within virtual architectures, which impose a virtual hierarchy on a distributed system of physical computing nodes. In this paper we present the design of the JavaSymphony Runtime System and the JavaSymphony Shell. Moreover we discuss details about an agent-based implementation of the JavaSymphony Runtime System which comprises the Network Agent, Object Agent, and Event Agent. We present a detailed comparison of the functionality provided by JavaSymphony with several related systems.
A semi closed-form expression of the Fisher information matrix in the context of K-distributed observations with parameterized mean is given and related to the classical, i.e. Gaussian case. this connection is done vi...
详细信息
ISBN:
(纸本)9781479914814
A semi closed-form expression of the Fisher information matrix in the context of K-distributed observations with parameterized mean is given and related to the classical, i.e. Gaussian case. this connection is done via a simple multiplicative factor, which only depends on the intrinsic parameters of the texture and the size of the observation vector. Finally, numerical simulation is provided to corroborate the theoretical analysis.
the generic fixed-value efficiency (FVE) method is proposed in order to study the scalability of parallel algorithms with multiple components of work. the generic FVE method is based on the isoefficiency method. Unlik...
详细信息
暂无评论