A Data-Centric Tool to Improve the Performance of Multithreaded Program on NUMA

Author(s):  
Dan Zeng ◽  
Liang Zhu ◽  
Xiaofei Liao ◽  
Hai Jin
2010 ◽  
Vol 19 (07) ◽  
pp. 1543-1557
Author(s):  
WEI HU ◽  
TIANZHOU CHEN ◽  
QINGSONG SHI ◽  
SHA LIU

Multithreaded programming has become the dominant paradigm in computer architecture, mainly in the form of multi-core processors. The performance bottleneck of a multithreaded program is its critical path, whose length is its total execution time. As the number of cores within a processor increases, Network-on-Chip (NoC) has been proposed as a promising approach for inter-core communication. In order to optimize the performance of a multithreaded program running on an NoC based multi-core platform, we design and implement the critical-path driven router, which prioritizes inter-thread communication on the critical path when routing packets. The experimental results show that the critical-path driven router improves the execution time of the test case by 14.8% compared to the ordinary router.


Author(s):  
Juraj PANCIK ◽  
Pavel MAXERA

In the paper is described the control electronics for an industrial pneumatic – hydraulic system based on a low-cost PLC. The developed system is a hydraulic pulse system and it generates series of high pressure hydraulic pulses (max. 200 bar). We describe requirements, an overall concept of the embedded control system, user interface, security features and network connectivity. In the description of the software solution we describe implementation of hierarchical ordered program threads (multithreaded program) and main control state machine. At the conclusion, we describe the calibration method of the system and calibration curves and we present the schematic diagram and a photo of a functional prototype of the system.


2014 ◽  
Vol 36 (4) ◽  
pp. 1-29 ◽  
Author(s):  
Alexander Kaiser ◽  
Daniel Kroening ◽  
Thomas Wahl

2018 ◽  
Vol 2018 ◽  
pp. 1-8
Author(s):  
Long Zhang ◽  
Wanxia Qu ◽  
Yinjia Huo ◽  
Yang Guo ◽  
Sikun Li

This paper focused on the safety verification of the multithreaded programs for mobile crowdsourcing networks. A novel algorithm was proposed to find a way to apply IC3, which is typically the fastest algorithm for SAT-based finite state model checking, in a very clever manner to solve the safety problem of multithreaded programs. By computing a series of overapproximation reachability, the safety properties can be verified by the SAT-based model checking algorithms. The results show that the new algorithm outperforms all the recently published works, especially on memory consumption (an advantage that comes from IC3).


Sign in / Sign up

Export Citation Format

Share Document