Results 11 to 20 of about 144,621 (325)
Large scale document inversion using a multi-threaded computing system [PDF]
ACM SIGAPP Applied Computing Review, 2017 Current microprocessor architecture is moving towards multi-core/multi-threaded systems. This trend has led to a surge of interest in using multi-threaded computing devices, such as the Graphics Processing Unit (GPU), for general purpose computing. We can utilize the GPU in computation as a massive parallel co-processor because the GPU consists of ...
Sungbo, Jung +2 more
openaire +4 more sources
Parallel Makespan Calculation for Flow Shop Scheduling Problem with Minimal and Maximal Idle Time
Applied Sciences, 2021 In this paper, a flow shop scheduling problem with minimal and maximal machine idle time with the goal of minimizing makespan is considered. The mathematical model of the problem is presented. A generalization of the prefix sum, called the job shift scan,
Jarosław Rudy
doaj +1 more source
GPU-Oriented Parallel Algorithm for Histogram Statistical Image Enhancement [PDF]
Jisuanji kexue yu tansuo, 2022 Histogram statistics has important applications in the fields of image enhancement and target detection. However, with the increasing size of the image and the higher real-time requirements, the processing process of the histogram statistical local ...
XIAO Han, SUN Lupeng, LI Cailin, ZHOU Qinglei
doaj +1 more source
The parallel approach to issue of operational management optimization problem on transport gateway system [PDF]
E3S Web of Conferences, 2020 The universal parallelization software shell for joint data processing, implemented in combination with a distributed computing system, is considered.
Egorov Alexander +2 more
doaj +1 more source
Message progression in parallel computing - to thread or not to thread? [PDF]
2008 IEEE International Conference on Cluster Computing, 2008 Message progression schemes that enable communication and computation to be overlapped have the potential to improve the performance of parallel applications. With currently available high-performance networks there are several options for making progress: manual progression, use of a progress thread, and communication offload. In this paper we analyze
Torsten Hoefler, Andrew Lumsdaine
openaire +1 more source
Data-triggered threads: Eliminating redundant computation [PDF]
2011 IEEE 17th International Symposium on High Performance Computer Architecture, 2011 This paper introduces the concept of data-triggered threads. Unlike threads in parallel programs in conventional programming models, these threads are initiated on a change to a memory location. This enables increased parallelism and the elimination of redundant, unnecessary computation. This paper focuses primarily on the latter.
Hung-Wei Tseng, Dean M. Tullsen
openaire +1 more source
DagTM: An Energy-Efficient Threads Grouping Mapping for Many-Core Systems Based on Data Affinity
Energies, 2016 Many-core processors are becoming mainstream computing platforms nowadays. How to map the application threads to specific processing cores and exploit the abundant hardware parallelism of a many-core processor efficiently has become a pressing need. This
Tao Ju +3 more
doaj +1 more source
Energies, 2019 Improving computing performance and reducing energy consumption are a major concern in heterogeneous many-core systems. The thread count directly influences the computing performance and energy consumption for a multithread application running on a ...
Tao Ju +4 more
doaj +1 more source
Performance Analysis of Thread Block Schedulers in GPGPU and Its Implications
Applied Sciences, 2020 GPGPU (General-Purpose Graphics Processing Unit) consists of hardware resources that can execute tens of thousands of threads simultaneously. However, in reality, the parallelism is limited as resource allocation is performed by the base unit called ...
KyungWoon Cho, Hyokyung Bahn
doaj +1 more source
Maurer Computers with Single-Thread Control
Fundamenta Informaticae, 2007 We investigate basic issues concerning stored threads and their execution, building upon Maurer's model for computers and the thread algebra of Bergstra et al. We show among other things that a single thread can control the execution on a Maurer machine of any executable finite-state thread stored in the memory of the Maurer machine.
Bergstra, J.A., Middelburg, C.A.
openaire +5 more sources