Research on non-blocking communication of airport data based on dynamic thread pool

Author(s):  
Cunxi Chang ◽  
Guoqiang Wang ◽  
Wei Shi
Keyword(s):  
2021 ◽  
Vol 5 (4) ◽  
pp. 438
Author(s):  
Siti Salwani Binti Yaacob ◽  
Hairulnizam Bin Mahdin ◽  
Mohammed Saeed Jawad ◽  
Nayef Abdulwahab Mohammed Alduais ◽  
Akhilesh Kumar Sharma ◽  
...  

The globalization of manufacturing has increased the risk of counterfeiting as the demand grows, the production flow increases, and the availability expands. The intensifying counterfeit issues causing a worriment to companies and putting lives at risk. Companies have ploughed a large amount of money into defensive measures, but their efforts have not slowed counterfeiters. In such complex manufacturing processes, decision-making and real-time reactions to uncertain situations throughout the production process are one way to exploit the challenges. Detecting uncertain conditions such as counterfeit and missing items in the manufacturing environment requires a specialized set of technologies to deal with a flow of continuously created data. In this paper, we propose an uncertain detection algorithm (UDA), an approach to detect uncertain events such as counterfeit and missing items in the RFID distributed system for a manufacturing environment. The proposed method is based on the hashing and thread pool technique to solve high memory consumption, long processing time and low event throughput in the current detection approaches. The experimental results show that the execution time of the proposed method is averagely reduced 22% in different tests, and our proposed method has better performance in processing time based on RFID event streams.


2011 ◽  
Vol 4 (3) ◽  
pp. 835-844 ◽  
Author(s):  
P. Hanappe ◽  
A. Beurivé ◽  
F. Laguzet ◽  
L. Steels ◽  
N. Bellouin ◽  
...  

Abstract. We have optimised the atmospheric radiation algorithm of the FAMOUS climate model on several hardware platforms. The optimisation involved translating the Fortran code to C and restructuring the algorithm around the computation of a single air column. Instead of the existing MPI-based domain decomposition, we used a task queue and a thread pool to schedule the computation of individual columns on the available processors. Finally, four air columns are packed together in a single data structure and computed simultaneously using Single Instruction Multiple Data operations. The modified algorithm runs more than 50 times faster on the CELL's Synergistic Processing Element than on its main PowerPC processing element. On Intel-compatible processors, the new radiation code runs 4 times faster. On the tested graphics processor, using OpenCL, we find a speed-up of more than 2.5 times as compared to the original code on the main CPU. Because the radiation code takes more than 60 % of the total CPU time, FAMOUS executes more than twice as fast. Our version of the algorithm returns bit-wise identical results, which demonstrates the robustness of our approach. We estimate that this project required around two and a half man-years of work.


Author(s):  
Daniela L. Freire ◽  
Rafael Z. Frantz ◽  
Fabricia Roos Frantz
Keyword(s):  
Run Time ◽  

2001 ◽  
Vol 36 (8) ◽  
pp. 214-222 ◽  
Author(s):  
Irfan Pyarali ◽  
Marina Spivak ◽  
Ron Cytron ◽  
Douglas C. Schmidt
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document