SearcharxivSearch

arXiv subjects

Martin Levesque

Publications and source records attributed to Martin Levesque.

7 recordsLinked to original sources

An asynchronous and task-based implementation of Peridynamics utilizing HPX -- the C++ standard library for parallelism and concurrency

On modern supercomputers, asynchronous many task systems are emerging to address the new architecture of computational nodes. Through this shift of increasing cores per node, a new programming model with the focus on handle the fine-grain parallelism of this increasing amount of cores per computational node is needed. Asynchronous Many Task (AMT) run time systems represent an emerging paradigm for addressing fine-grain parallelism since they handle the increasing amount of threads per node and concurrency. HPX, a open source C++ standard library for parallelism and concurrency, is one AMT which is confirm with the C++ standard. Which means that HPX's Application Programming Interface (API) is confirm with its definition by the C++ standard committee. For example for the concept of futurization the hpx:future can be replaced by std::future without breaking the API. Peridynamics is a non-local generalization of continuum mechanics tailored to address discontinuous displacement fields arising in fracture mechanics. As many non-local approaches, peridynamics requires considerable computing resources to solve practical problems. This paper investigates the implementation of a peridynamics EMU nodal discretization in an asynchronous task-based fashion. The scalability of asynchronous task-based implementation is to be in agreement with theoretical estimations. In addition, to the scalabilty the code is convergent for implicit time integration and recovers theoretical solutions. Explicit time integration, convergence results are presented to showcase the agreement of results with theoretical claims in previous works.

cs.DC

Long term availability of raw experimental data in experimental fracture mechanics

Experimental data availability is a cornerstone for reproducibility in experimental fracture mechanics, which is crucial to the scientific method. This short communication focuses on the accessibility and long term availability of raw experimental data. The corresponding authors of the eleven most cited papers, related to experimental fracture mechanics, for every year from 2000 up to 2016, were kindly asked about the availability of the raw experimental data associated with each publication. For the 187 e-mails sent: 22.46% resulted in outdated contact information, 57.75% of the authors did received our request and did not reply, and 19.79 replied to our request. The availability of data is generally low with only $11$ available data sets (5.9%). The authors identified two main issues for the lacking availability of raw experimental data. First, the ability to retrieve data is strongly attached to the the possibility to contact the corresponding author. This study suggests that institutional e-mail addresses are insufficient means for obtaining experimental data sets. Second, lack of experimental data is also due that submission and publication does not require to make the raw experimental data available. The following solutions are proposed: (1) Requirement of unique identifiers, like ORCID or ResearcherID, to detach the author(s) from their institutional e-mail address, (2) Provide DOIs, like Zenodo or Dataverse, to make raw experimental data citable, and (3) grant providing organizations should ensure that experimental data by public funded projects is available to the public.

cs.DL

ptp++: A Precision Time Protocol Simulation Model for OMNeT++ / INET

Precise time synchronization is expected to play a key role in emerging distributed and real-time applications such as the smart grid and Internet of Things (IoT) based applications. The Precision Time Protocol (PTP) is currently viewed as one of the main synchronization solutions over a packet-switched network, which supports microsecond synchronization accuracy. In this paper, we present a PTP simulation model for OMNeT++ INET, which allows to investigate the synchronization accuracy under different network configurations and conditions. To show some illustrative simulation results using the developed module, we investigate on the network load fluctuations and their impacts on the PTP performance by considering a network with class-based quality-of-service (QoS) support. The simulation results show that the network load significantly affects the network delay symmetry, and investigate a new technique called class probing to improve the PTP accuracy and mitigate the load fluctuation effects.

cs.NI

A Metamodel of Unit Testing for Object-Oriented Programming Languages

A unit test is a method for verifying the accuracy and the proper functioning of a portion of a program. This work consists to study the relation and the approaches to test Object-Oriented Programming (OOP) programs and to propose a metamodel that enables the programmer to write the tests while writing the source code to be tested by exploiting the key features of OOP programming languages such as inheritance, polymorphism, etc.

cs.PL

Graphical Probabilistic Routing Model for OBS Networks with Realistic Traffic Scenario

Burst contention is a well-known challenging problem in Optical Burst Switching (OBS) networks. Contention resolution approaches are always reactive and attempt to minimize the BLR based on local information available at the core node. On the other hand, a proactive approach that avoids burst losses before they occur is desirable. To reduce the probability of burst contention, a more robust routing algorithm than the shortest path is needed. This paper proposes a new routing mechanism for JET-based OBS networks, called Graphical Probabilistic Routing Model (GPRM) that selects less utilized links, on a hop-by-hop basis by using a bayesian network. We assume no wavelength conversion and no buffering to be available at the core nodes of the OBS network. We simulate the proposed approach under dynamic load to demonstrate that it reduces the Burst Loss Ratio (BLR) compared to static approaches by using Network Simulator 2 (ns-2) on NSFnet network topology and with realistic traffic matrix. Simulation results clearly show that the proposed approach outperforms static approaches in terms of BLR.

cs.NI

Adaptive threshold-based decision for efficient hybrid deflection and retransmission scheme in OBS networks

Burst contention is a well-known challenging problem in Optical Burst Switching (OBS) networks. Deflection routing is used to resolve contention. Burst retransmission is used to reduce the Burst Loss Ratio (BLR) by retransmitting dropped bursts. Previous works show that combining deflection and retransmission outperforms both pure deflection and pure retransmission approaches. This paper proposes a new Adaptive Hybrid Deflection and Retransmission (AHDR) approach that dynamically combines deflection and retransmission approaches based on network conditions such as BLR and link utilization. Network Simulator 2 (ns-2) is used to simulate the proposed approach on different network topologies. Simulation results show that the proposed approach outperforms static approaches in terms of BLR by using an adaptive decision threshold.

cs.NI

Adaptive Hybrid Deflection and Retransmission Routing for Optical Burst-Switched Networks

Burst contention is a well known challenging problem in Optical Burst Switching (OBS) networks. Deflection routing is used to resolve contention. Burst retransmission is used to reduce the Burst Loss Ratio (BLR) by retransmitting dropped bursts. Previous works show that combining deflection and retransmission outperforms both pure deflection and pure retransmission approaches. This paper proposes a new Adaptive Hybrid Deflection and Retransmission (AHDR) approach that dynamically combines deflection and retransmission approaches based on network conditions such as BLR and link utilization. Network Simulator 2 (ns-2) is used to simulate the proposed approach on different network topologies. Simulation results show that the proposed approach outperforms static approaches in terms of BLR and goodput.

cs.NI