scholarly journals Worst-Case Reaction Time Optimization on Deterministic Multi-Core Architectures with Synchronous Languages

2019 ◽  
Author(s):  
Nicolas Hili ◽  
Alain Girault ◽  
Eric Jenn
Keyword(s):  
Reaction Time ◽  
Synchronous Languages ◽  
Worst Case ◽  
Time Optimization

Reaction Time Optimization Based on Sensor Data-Driven Simulation for Snow Removal Projects

2018 ◽  
Author(s):  
Parinaz Jafari ◽  
Emad Mohamed ◽  
Mostafa Ali ◽  
Ming-Fung Francis Siu ◽  
Simaan Abourizk ◽  
...  
Keyword(s):  
Reaction Time ◽  
Data Driven ◽  
Sensor Data ◽  
Snow Removal ◽  
Time Optimization

PARALLEL REAL-TIME OPTIMIZATION: BEYOND SPEEDUP

1999 ◽  
Vol 09 (04) ◽  
pp. 499-509 ◽  
Author(s):  
SELIM G. AKL ◽  
Stefan D. Bruda
Keyword(s):  
Parallel Algorithm ◽  
Real Time ◽  
Spanning Tree ◽  
Optimization Problems ◽  
Minimum Weight ◽  
Parallel Computer ◽  
Worst Case ◽  
Time Optimization ◽  
Minimum Weight Spanning Tree ◽  
Real Time Optimization

Traditionally, interest in parallel computation centered around the speedup provided by parallel algorithms over their sequential counterparts. In this paper, we ask a different type of question: Can parallel computers, due to their speed, do more than simply speed up the solution to a problem? We show that for real-time optimization problems, a parallel computer can obtain a solution that is better than that obtained by a sequential one. Specifically, a sequential and a parallel algorithm are exhibited for the problem of computing the best-possible approximation to the minimum-weight spanning tree of a connected, undirected and weighted graph whose vertices and edges are not all available at the outset, but instead arrive in real time. While the parallel algorithm succeeds in computing the exact minimum-weight spanning tree, the sequential algorithm can only manage to obtain an approximate solution. In the worst case, the ratio of the weight of the solution obtained sequentially to that of the solution computed in parallel can be arbitrarily large.

Compilation and Worst-Case Reaction Time Analysis for Multithreaded Esterel Processing

2008 ◽  
Vol 2008 (1) ◽  
pp. 594129 ◽  
Author(s):  
Marian Boldt ◽  
Claus Traulsen ◽  
Reinhard von Hanxleden
Keyword(s):  
Reaction Time ◽  
Reaction Time Analysis ◽  
Time Analysis ◽  
Worst Case

scholarly journals Worst Case Reaction Time Analysis of Concurrent Reactive Programs

2008 ◽  
Vol 203 (4) ◽  
pp. 65-79 ◽  
Author(s):  
Marian Boldt ◽  
Claus Traulsen ◽  
Reinhard von Hanxleden
Keyword(s):  
Reaction Time ◽  
Reaction Time Analysis ◽  
Time Analysis ◽  
Worst Case ◽  
Reactive Programs

Comparison of Various DoS Algorithm

2020 ◽  
Vol 14 (1) ◽  
pp. 27-43
Author(s):  
Mainul Hasan ◽  
Amogh Venkatanarayan ◽  
Inder Mohan ◽  
Ninni Singh ◽  
Gunjan Chhabra
Keyword(s):  
Reaction Time ◽  
Resource Utilization ◽  
Denial Of Service ◽  
The Internet ◽  
Dos Attack ◽  
Worst Case ◽  
Denial Of Service Attack ◽  
Service Attack ◽  
The Impact

Denial of service attack is one of the most devastating and ruinous attacks on the internet. The attack can be performed by flooding the victim's machine with any kind of packets. Throughout all these years many methods have been proposed to reduce the impact, but with machines of higher capabilities coming in, the attack has also become more potent, and these proposals are either less effective or less efficient. A DoS attack exhausts the victim's resources affecting the availability of the resource. This paper will be comparing a few methods that have been proposed and published in various papers along with a newly proposed method. The comparison of the methods is done on a number of parameters including resource utilization, reaction time, worst case scenarios, etc. This paper also checks the viability of these methods over various layers of the network. Concluding with the best aspects of all the papers and the best among these for the current real conditions.

Mosaic Mapping: A Means of Tiling Images to Shorten Acquisition Speed for Lower - Magnification SEM Images and Wavelength Dispersive Spectrometers (WDS) X-Ray Maps

1996 ◽  
Vol 54 ◽  
pp. 438-439
Author(s):  
J.D. Geller ◽  
C.R. Herrington
Keyword(s):  
Limiting Factors ◽  
X Rays ◽  
Angular Range ◽  
Acceptance Angle ◽  
Sem Images ◽  
Worst Case ◽  
X Ray ◽  
Focusing Distance ◽  
Layered Crystals ◽  
Working Distance

The minimum magnification for which an image can be acquired is determined by the design and implementation of the electron optical column and the scanning and display electronics. It is also a function of the working distance and, possibly, the accelerating voltage. For secondary and backscattered electron images there are usually no other limiting factors. However, for x-ray maps there are further considerations. The energy-dispersive x-ray spectrometers (EDS) have a much larger solid angle of detection that for WDS. They also do not suffer from Bragg’s Law focusing effects which limit the angular range and focusing distance from the diffracting crystal. In practical terms EDS maps can be acquired at the lowest magnification of the SEM, assuming the collimator does not cutoff the x-ray signal. For WDS the focusing properties of the crystal limits the angular range of acceptance of the incident x-radiation. The range is dependent upon the 2d spacing of the crystal, with the acceptance angle increasing with 2d spacing. The natural line width of the x-ray also plays a role. For the metal layered crystals used to diffract soft x-rays, such as Be - O, the minimum magnification is approximately 100X. In the worst case, for the LEF crystal which diffracts Ti - Zn, ˜1000X is the minimum.

Sign in / Sign up

Export Citation Format

Share Document