A Petri Net Model for FDDI

Nicoleta Sergent
1997
Rapport ou document de travail

Résumé

Fiber Distributed Data Interface (FDDI) is a high speed local area network operating at 100Mbps using a fiber optic ring transmission medium. The purpose of this paper is to build a Petri net model for the FDDI media access control (MAC) protocol. This model is hierarchically integrated into the Petri net model of the two-phase commitment (2PC) algorithm. By simulating the composed Petri net model we evaluate the latency of the 2PC algorithm. The FDDI model is validated by comparing the data obtained from performance measures and the numerical results derived from simulation.

Official source

https://infoscience.epfl.ch/record/50082?ln=fr

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Concepts associés

Chargement

Publications associées

Chargement

Evaluating Latency of Distributed Algorithms Using Petri Nets

Nicoleta Sergent

Evaluating Latency of Distributed Algorithms Using Petri Nets N. Sergent The time it takes to a distributed algorithm to finish (the distributed algorithm latency) cannot be directly measured in asynchronous systems if the algorithm starts and ends on different processors, since the system has no global time. A simple method to evaluate this latency is to build and simulate a unified model which includes the network and the distributed algorithm sub-models. In this paper we introduce a network model for UDP (User Datagram Protocol) which allows to establish a relationship between the number of messages exchanged in a distributed algorithm and the communication delays. As an application, we consider the two-phase commitment algorithm. Numerical results derived from simulating the model are compared with data obtained from performance measures.

1997

Chargement

Mathematical and numerical aspects of viscoelastic flows are investigated here. Two simplified mathematical models are considered. They are motivated by a splitting algorithm for solving viscoelastic flows with free surfaces. The first model is a simplified Oldroyd-B model. Existence on a fixed time interval is proved in several Banach spaces provided the data are small enough. Short time existence is also proved for arbitrarily large data in Hölder spaces for the time variable. These results are based on the maximal regularity property of the Stokes operator and on the analycity behavior of the corresponding semi-group. A finite element discretization in space is then proposed. Existence of the numerical solution is proved for small data, as well as a priori error estimates, using an implicit function theorem framework. Then, the extension of these results to a stochastic simplified Hookean dumbbells model is discussed. Because of the presence of the Brownian motion, existence in a fixed time interval, provided the data are small enough, is proved only in some of the Banach spaces considered previously. The dumbbells' elongation is split in two parts, one satisfying a standart stochastic differential equation, the other satisfying a partial differential equation with a stochastic source term. A finite element discretization in space is also proposed. Existence of the numerical solution is proved for small data, as well as a priori error estimates. A numerical algorithm for solving viscoelastic flows with free surfaces is also described. This algorithm is based on a splitting method in time and two different meshes are used for the space discretization. Convergence of the numerical model is checked for the pure extensional flow and the filling of a pipe. Then, numerical results are reported for the stretching of a filament and for jet buckling.

EPFL2006

Chargement

An effective algorithm for the generation of patient-specific Purkinje networks in computational electrocardiology

Elena Faggiano, Fabio Nobile, Christian Vergara

The Purkinje network is responsible for the fast and coordinated distribution of the electrical impulse in the ventricle that triggers its contraction. Therefore, it is necessary to model its presence to obtain an accurate patient-specific model of the ventricular electrical activation. In this paper, we present an efficient algorithm for the generation of a patient-specific Purkinje network, driven by measures of the electrical activation acquired on the endocardium. The proposed method provides a correction of an initial network, generated by means of a fractal law, and it is based on the solution of Eikonal problems both in the muscle and in the Purkinje network. We present several numerical results both in an ideal geometry with synthetic data and in a real geometry with patient-specific clinical measures. These results highlight an improvement of the accuracy provided by the patient-specific Purkinje network with respect to the initial one. In particular, a cross-validation test shows an accuracy increase of 19% when only the 3% of the total points are used to generate the network, whereas an increment of 44% is observed when a random noise equal to 20% of the maximum value of the clinical data is added to the measures. (C) 2014 Elsevier Inc. All rights reserved.

Elsevier2015

Chargement