Parallel computing in railway research

Wu, Qing; Spiryagin, Maksym; Cole, Colin; McSweeney, Tim

doi:10.1080/23248378.2018.1553115

Cited by 37 publications

(19 citation statements)

References 47 publications

(137 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The communications among different computer cores can be structured and enabled by a number of techniques such as OpenMP, pThreads and MPI as comprehensively reviewed in Wu et al. 48 In this paper, the OpenMP technique was used.…”

Section: Parallel Co-simulation Methodsmentioning

confidence: 99%

Parallel co-simulation of locomotive wheel wear and rolling contact fatigue in a heavy haul train operational environment

Spiryagin

Sun

et al. 2020

Proceedings of the Institution of Mechanical Engineers, Part F:

Self Cite

View full text Add to dashboard Cite

Locomotive wheel wear and rolling contact fatigue simulations that consider both train dynamics and detailed traction control systems have not been reported. This paper developed a parallel co-simulation method to link an in-house longitudinal train dynamics simulator to a commercial software package named GENSYS. An advanced longitudinal train dynamics model, a traction control system model and a wheel–rail contact model were then incorporated into the simulation. Three wear calculation models (T-gamma model, USFD model and Archard model) and two rolling contact fatigue calculation models (T-gamma-based rolling contact fatigue model and shakedown-based rolling contact fatigue model) were implemented. A train with the configuration of 1 locomotive +54 wagons +1 locomotive +54 wagons was simulated. This paper shows that the simulation method is successful and can be used for such more detailed locomotive wheel wear and rolling contact fatigue calculations. Wear and rolling contact fatigue calculation results show that the wear numbers that were calculated using the T-gamma wear model and damage indexes that were calculated using the T-gamma-based rolling contact fatigue model were similar between the leading and remote locomotives. However, wear rates that were calculated using the USFD wear model, wear volumes that were calculated using the Archard model and fatigue indexes that were calculated using the shakedown-based rolling contact fatigue model have evident differences between the leading and remote locomotives. Maximum differences in these results were about 12, 18 and 34%, respectively.

show abstract

Section: Parallel Co-simulation Methodsmentioning

confidence: 99%

Parallel co-simulation of locomotive wheel wear and rolling contact fatigue in a heavy haul train operational environment

Spiryagin

Sun

et al. 2020

Proceedings of the Institution of Mechanical Engineers, Part F:

Self Cite

View full text Add to dashboard Cite

show abstract

“…Research studies that employ concepts of parallel computing in railway research have recently been reviewed in [24]. Though the use of parallel computing for railway rescheduling has been investigated in recent years, e.g., in [1,8,9], research on parallel computing for multi-objective train rescheduling is rather scarce.…”

Section: Related Workmentioning

confidence: 99%

Parallel Computing for Multi-Objective Train Rescheduling

Josyula

Krasemann

Lundberg

2021

IEEE Trans. Emerg. Topics Comput.

View full text Add to dashboard Cite

In railway traffic systems, it is essential to achieve a high punctuality to satisfy the goals of the involved stakeholders. Thus, whenever disturbances occur, it is important to effectively reschedule trains while considering the perspectives of various stakeholders. This typically involves solving a multi-objective train rescheduling problem, which is much more complex than its single-objective counterpart. Solving such a problem in realtime for practically relevant problem sizes is computationally challenging. The reason is that the rescheduling solution(s) of interest are dispersed across a large search tree. The tree needs to be navigated fast while pruning off branches leading to undesirable solutions and exploring branches leading to potentially desirable solutions. The use of parallel computing enables such a fast navigation of the tree. This paper presents a heuristic parallel algorithm to solve the multi-objective train rescheduling problem. The parallel algorithm combines a depth-first search with simultaneous breadth-wise tree exploration while searching the tree for solutions. An existing parallel algorithm for singleobjective train rescheduling has been redesigned, primarily, by (i) pruning based on multiple metrics, and (ii) maintaining a set of upper bounds. The redesign improved the quality of the obtained rescheduling solutions and showed better speedups for several disturbance scenarios.

show abstract

“…Root Mean Squared Error (RM SE) of the two images, p and q is the square root of their M SE, as shown in Equation (6). Unlike M SE, it penalizes more the larger errors.…”

Section: Peak-signal To Noise Ratio (Psnr) Analysismentioning

confidence: 99%

“…Due to these two features, the logistic map based encryption is not affordable for on-line communications and real-time applications [5]. The last decade has witnessed an exponential growth in parallel processing power and paradigms [6]. An efficient logistic map permutation-diffusion-based image cryptosystems are proposed in this paper.…”

Section: Introductionmentioning

confidence: 99%

An Accelerator-based Logistic Map Image Cryptosystems for Grayscale Images

Holla

Pais

Suma

2021

JCSANDM

View full text Add to dashboard Cite

The logistic map is a class of chaotic maps. It is still in use in image cryptography. The logistic map cryptosystem has two stages, namely permutation, and diffusion. These two stages being computationally intensive, the permutation relocates the pixels, whereas the diffusion rescales them. The research on refining the logistic map is progressing to make the encryption more secure. Now there is a need to improve its efficiency to enable such models to fit for high-speed applications. The new invention of accelerators offers efficiency. But the inherent data dependencies hinder the use of accelerators. This paper discusses the novelty of identifying independent data-parallel tasks in a logistic map, handing them over to the accelerators, and improving their efficiency. Among the two accelerator models proposed, the first one achieves peak efficiency using coalesced memory access. The other cryptosystem further improves performance at the cost of more execution resources. In this investigation, it is noteworthy that the parallelly accelerated logistic map achieved a significant speedup to the larger grayscale image used. The objective security estimates proved that the two stages of the proposed systems progressively ensure security.

show abstract

Parallel computing in railway research

Cited by 37 publications

References 47 publications

Parallel co-simulation of locomotive wheel wear and rolling contact fatigue in a heavy haul train operational environment

Parallel co-simulation of locomotive wheel wear and rolling contact fatigue in a heavy haul train operational environment

Parallel Computing for Multi-Objective Train Rescheduling

An Accelerator-based Logistic Map Image Cryptosystems for Grayscale Images

Contact Info

Product

Resources

About