A hybrid model for real time simulation of urban traffic

In this paper a hybrid model is presented to predict the behavior of traffic in urban area. Intersections and on/off-ramps are modeled by Colored Timed Petri Nets while road links are modeled by a stochastic discrete time model. It is assumed that vehicle routings at each intersection are stochastic. A Particle Filter algorithm based on the hybrid model is developed to estimate the system state. The validation of the model by using real data is discussed. The limited computational effort required makes the model suitable to be used in simulation-based control schemes for urban traffic.     

An uncoordinated asynchronous checkpointing model for hierarchical scientific workflows

Scientific workflow systems often operate in unreliable environments, and have accordingly incorporated different fault tolerance techniques. One of them is the checkpointing technique combined with its corresponding rollback recovery process. Different checkpointing schemes have been developed and at various levels: task- (or activity-) level and workflow-level. At workflow-level, the usually adopted approach is to establish a checkpointing frequency in the system which determines the moment at which a global workflow checkpoint – a snapshot of the whole workflow enactment state at normal execution (without failures) – has to be accomplished. We describe an alternative workflow-level checkpointing scheme and its corresponding rollback recovery process for hierarchical scientific workflows in which every workflow node in the hierarchy accomplishes its own local checkpoint autonomously and in an uncoordinated way after its enactment. In contrast to other proposals, we utilise the Reference net formalism for expressing the scheme. Reference nets are a particular type of Petri nets which can more effectively provide the abstractions to support and to express hierarchical workflows and their dynamic adaptability.     

An analytical framework for URLLC in hybrid MEC environments

The Journal of Supercomputing - The conventional mobile architecture is unlikely to cope with Ultra-Reliable Low-Latency Communications (URLLC) constraints, being a major cause for its fundamentals...     

A hybrid model for smoke simulation

A smoke simulation approach based on the integration of traditional particle systems and density functions is presented in this paper.By attaching a density function to each particle as its attribute,the diffusion of smoke can be described by the variation of parti-each particle as its attribute ,the diffusion of smoke can be described by the variation of parti-cles‘ density functions ,along with the effect on airflow by controlling particles‘ movement and fragmentation.In addition.a continuous density field for realistic rendering can be generatd quickly through the look-up talbes of particle‘s density functions .Compared with traditional particle systems,this approach can describe smoke diffusion,and provide a continuous density field for realistic rendering with much less computation.A quick rendering scheme is also presented in this paper as a useful preview tool for tuning appropriate parameters in the smoke model.     

An index-based checkpointing algorithm for autonomous distributedsystems

This paper presents an index-based checkpointing algorithm for distributed systems with the aim of reducing the total number of checkpoints while ensuring that each checkpoint belongs to at least one consistent global checkpoint (or recovery line). The algorithm is based on an equivalence relation defined between pairs of successive checkpoints of a process which allows us, in some cases, to advance the recovery line of the computation without forcing checkpoints in other processes. The algorithm is well-suited for autonomous and heterogeneous environments, where each process does not know any private information about other processes and private information of the same type of distinct processes is not related (e.g., clock granularity, local checkpointing strategy, etc.). We also present a simulation study which compares the checkpointing-recovery overhead of this algorithm to the ones of previous solutions     

An efficient protocol for checkpointing recovery in distributedsystems

The authors present an efficient synchronized checkpointing protocol that exploits the dependency relation between processes in distributed systems. In this protocol, a process takes a checkpoint when it knows that all processes on which it computationally depends took their checkpoints, hence the process need not always wait for the decision made by the checkpointing coordinator as in the conventional synchronized protocols. As a result, the checkpointing coordination time is substantially reduced and the possibility of total abort of the checkpointing coordination is reduced     

On rolling back and checkpointing in time warp

In this paper, we present a family of three algorithms which serve to perform checkpoints and to roll back time warp. These algorithms are primarily intended for use in simulations in which there are a large number of LPs and in which events have a small computational granularity. Important representatives of this class are VLSI and computer network simulations. In each of our algorithms, LPs are gathered into clusters via algorithms which are application dependent. In order to examine the performance of our algorithms and to compare them to Time Warp, we made use of two of the largest digital logic circuits available from the ISCAS89 benchmark series of combinational circuits. The execution time, number of states saved, and maximal memory consumption were compared to the same quantities for time warp. Our results indicated that each of the algorithms occupies a different point in the spectrum of possible trade-offs between memory usage and execution time, ranging from substantial memory savings (at a comparable cost in speed) to memory savings and a comparable speed to time warp. Hence, an important benefit of our algorithms is the ability to trade off memory requirements with execution time     

A model for error recovery with global checkpointing

The paper proposes a new technique for providing software fault tolerance in concurrent systems. It combines the traditional global checkpointing mechanism with the recovery block concept in order to come up with an easily implementable error recovery mechanism. This mechanism involves smaller overhead in case of moderate to high process interaction than the schemes considered in past, which are based upon the idea of local checkpointing. A model for computing the optimum checkpointing interval is also presented. A particular distribution is hypothesized for the coverage of the recovery, and the behavior of the model is studied in detail for this case.     

An analytical delay model

Delay consideration has been a major issue in design and test of high performance digital circuits.The assumption of input signal change occurring only when all internal nodes are stable restricts the increas of clock frequency.It is no longer true for wave pipelining circuits.However,previous logical delay models are based on the assumption.In addition,the stable time of a robust delay test generally depends on the longest sensitizable path delay.Thus,a new delay model is desirable.This paper explores th necessity first.Then,Boolean process to analytically describe the logical and timing behavior of a digital circuit is reviewed.The concept of sensitization is redefined precisely in this paper.Based on the new concept of sensitization,an analytical delay model is introduced.As a result,many untestable delay faults under the logical delay model can be tested if the output waveforms can be sampled at more time points.The longest sensitizable path length is computed for circuit design and delay test.     

An analytical model for multi-epidemic information dissemination

Contemporary distributed systems usually involve the spreading of information by means of ad-hoc dialogs between nodes (peers). This paradigm resembles the spreading of a virus in the biological perspective (epidemics). Such abstraction allows us to design and implement information dissemination schemes with increased efficiency. In addition, elementary information generated at a certain node can be further processed to obtain more specific, higher-level and more valuable information. Such information carries specific semantic value that can be further interpreted and exploited throughout the network. This is also reflected in the epidemical framework through the idea of virus transmutation which is a key component in our model. We establish an analytical framework for the study of a multi-epidemical information dissemination scheme in which diverse ‘transmuted epidemics’ are spread. We validate our analytical model through simulations. Key outcomes of this study include the assessment of the efficiency of the proposed scheme and the prediction of the characteristics of the spreading process (multi-epidemical prevalence and decay).     

基于检查点机制的容错实时调度算法CP-PRA

时间冗余作为容错的重要手段被广泛应用于安全关键实时系统中。传统容错调度算法为失败任务的重运行(Re-execute)预留了大量的空闲时间,但是重运行的使用会降低系统的资源利用率。提出了一种基于检查点机制的容错调度算法CP-PRA,通过降低错误恢复需要的时间,可以有效地提高系统的资源利用率。给出了该算法的可调度奈件,并证明了其算法的正确性。     

Nonblocking checkpointing for optimistic parallel simulation: description and an implementation

Describes a nonblocking checkpointing mode in support of optimistic parallel discrete event simulation. This mode allows real concurrency in the execution of state saving and other simulation specific operations (e.g, event list update, event execution) with the aim of removing the cost of recording state information from the completion time of the parallel simulation application. We present an implementation of a C library supporting nonblocking checkpointing on a myrinet based cluster, which demonstrates the practical viability of this checkpointing mode on standard off-the-shelf hardware. By the results of an empirical study on classical parameterized synthetic benchmarks, we show that, except for the case of minimal state granularity applications, nonblocking checkpointing allows improvement of the speed of the parallel execution, as compared to commonly adopted, optimized checkpointing methods based on the classical blocking mode. A performance study for the case of a personal communication system (PCS) simulation is additionally reported to point out the benefits from nonblocking checkpointing for a real world application.     

A hybrid linear-neural model for time series forecasting

This paper considers a linear model with time varying parameters controlled by a neural network to analyze and forecast nonlinear time series. We show that this formulation, called neural coefficient smooth transition autoregressive model, is in close relation to the threshold autoregressive model and the smooth transition autoregressive model with the advantage of naturally incorporating linear multivariate thresholds and smooth transitions between regimes. In our proposal, the neural-network output is used to induce a partition of the input space, with smooth and multivariate thresholds. This also allows the choice of good initial values for the training algorithm.     

An efficient checkpointing method for multicomputers with wormhole routing

Efficient checkpointing and resumption of multicomputer applications is essential if multicomputers are to support time-sharing and the automatic resumption of jobs after a system failure. We present a checkpointing scheme that is transparent, imposes overhead only during checkpoints, requires minimal message logging, and allows for quick resumption of execution from a checkpointed image. Furthermore, the checkpointing algorithm allows each processorp to continue running the application being checkpointed except during the time thatp is actively taking a local snapshot, and requires no global stop or freeze of the multicomputer. Since checkpointing multicomputer applications poses requirements different from those posed by checkpointing general distributed systems, existing distributed checkpointing schemes are inadequate for multicomputer checkpointing. Our checkpointing scheme makes use of special properties of wormhole routing networks to satisfy this new set of requirements.     

An analytical model for manufacturing service supply contracts

The practice of service-based manufacturing, utilized in various industries, particularly in electronics, pharmaceuticals, and automotive, is on the rise as it improves enterprise effectiveness in dynamic markets. The mutual responsibilities between the supplier(s) and user(s) of such services are spelled out in defined-time-horizon contracts. While such contracts define mutual obligations of both parties on a tactical/operational level, the long-term strategic objectives of the parties may be in conflict. This paper is focused on studying the dynamics of manufacturing service contracts. It investigates the factors affecting the shape of the negotiation space for such contracts and also the way the space should be navigated in response to changing market conditions. The paper presents an analytical framework developed to facilitate behavior analysis of the actors involved in the contract.     

An analytical model for source code distributability verification简

ne way to speed up the execution of sequential programs is to divide them into concurrent segments and execute such segments in a parallel manner over a distributed computing environment. We argue that the execution speedup primarily depends on the concurrency degree between the identified segments as well as communication overhead between the segments. To guar-antee the best speedup, we have to obtain the maximum possible concurrency degree between the identified segments, taking communication overhead into consideration. Existing code distributor and multi-threading approaches do not fulfill such re-quirements;hence, they cannot provide expected distributability gains in advance. To overcome such limitations, we propose a novel approach for verifying the distributability of sequential object-oriented programs. The proposed approach enables users to see the maximum speedup gains before the actual distributability implementations, as it computes an objective function which is used to measure different distribution values from the same program, taking into consideration both remote and sequential calls. Experimental results showed that the proposed approach successfully determines the distributability of different real-life software applications compared with their real-life sequential and distributed implementations.     

An analytical QoS service model for delay-based differentiation

The increased need for Quality of Service (QoS) in today’s IP networks has concentrated a lot of research and implementation efforts. Carefully designed and managed priority services are essential for quality-demanding traffic, especially in large-scale IP-based environments where aggregation of flows is extensive and a variety of traffic types co-exist. Although individual mechanisms have been widely investigated, not much related work exists on integrated approaches to QoS provisioning that are also feasible to implement. This work presents a thorough approach to the design, dimensioning and provisioning of a high-priority service for high-quality-demanding traffic over an IP network. Our approach employs efficient scheduling and a dynamic admission control scheme while demonstrating an outstanding performance in terms of the quality offered to QoS-demanding traffic. A novel feature is also introduced: while other existing schemes only focus on provisioning of service rate guarantees, ours achieves in addition differentiation of the end-to-end delay perceived by IP flows.     

An analytical solution for static stability of multi-scale hybrid nanocomposite plates

An analytical answer to the buckling problem of a composite plate consisted of multi-scale hybrid nanocomposites is presented here for the first time. In other words, the constituent material of the structure is made of an epoxy matrix which is reinforced by both macro- and nanosize reinforcements, namely, carbon fiber (CF) and carbon nanotube (CNT). The effective material properties such as Young’s modulus or density are derived utilizing a micromechanical scheme incorporated with the Halpin–Tsai model. To present a more realistic problem, the plate is placed on a two-parameter elastic substrate. Then, on the basis of an energy-based Hamiltonian approach, the equations of motion are derived using the classical theory of plates. Finally, the governing equations are solved analytically to obtain the critical buckling load of the system. Afterward, the normalized form of the results is presented to emphasize the impact of each parameter on the dimensionless buckling load of composite plates. It is worth mentioning that the effects of various boundary conditions are covered, too. To show the efficiency of presented modeling, the results of this article are compared to those of former attempts.