thread pool
Recently Published Documents


TOTAL DOCUMENTS

48
(FIVE YEARS 12)

H-INDEX

6
(FIVE YEARS 1)

2022 ◽  
Vol 6 (POPL) ◽  
pp. 1-28
Author(s):  
Pascal Baumann ◽  
Rupak Majumdar ◽  
Ramanathan S. Thinniyam ◽  
Georg Zetzsche

Thread pooling is a common programming idiom in which a fixed set of worker threads are maintained to execute tasks concurrently. The workers repeatedly pick tasks and execute them to completion. Each task is sequential, with possibly recursive code, and tasks communicate over shared memory. Executing a task can lead to more new tasks being spawned. We consider the safety verification problem for thread-pooled programs. We parameterize the problem with two parameters: the size of the thread pool as well as the number of context switches for each task. The size of the thread pool determines the number of workers running concurrently. The number of context switches determines how many times a worker can be swapped out while executing a single task---like many verification problems for multithreaded recursive programs, the context bounding is important for decidability. We show that the safety verification problem for thread-pooled, context-bounded, Boolean programs is EXPSPACE-complete, even if the size of the thread pool and the context bound are given in binary. Our main result, the EXPSPACE upper bound, is derived using a sequence of new succinct encoding techniques of independent language-theoretic interest. In particular, we show a polynomial-time construction of downward closures of languages accepted by succinct pushdown automata as doubly succinct nondeterministic finite automata. While there are explicit doubly exponential lower bounds on the size of nondeterministic finite automata accepting the downward closure, our result shows these automata can be compressed. We show that thread pooling significantly reduces computational power: in contrast, if only the context bound is provided in binary, but there is no thread pooling, the safety verification problem becomes 3EXPSPACE-complete. Given the high complexity lower bounds of related problems involving binary parameters, the relatively low complexity of safety verification with thread-pooling comes as a surprise.


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.


2020 ◽  
Vol 1616 ◽  
pp. 012073 ◽  
Author(s):  
Liangzhou Wang ◽  
Chaobin Wang

Computation ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 48 ◽  
Author(s):  
Stefano Quer ◽  
Andrea Marcelli ◽  
Giovanni Squillero

The maximum common subgraph of two graphs is the largest possible common subgraph, i.e., the common subgraph with as many vertices as possible. Even if this problem is very challenging, as it has been long proven NP-hard, its countless practical applications still motivates searching for exact solutions. This work discusses the possibility to extend an existing, very effective branch-and-bound procedure on parallel multi-core and many-core architectures. We analyze a parallel multi-core implementation that exploits a divide-and-conquer approach based on a thread pool, which does not deteriorate the original algorithmic efficiency and it minimizes data structure repetitions. We also extend the original algorithm to parallel many-core GPU architectures adopting the CUDA programming framework, and we show how to handle the heavily workload-unbalance and the massive data dependency. Then, we suggest new heuristics to reorder the adjacency matrix, to deal with “dead-ends”, and to randomize the search with automatic restarts. These heuristics can achieve significant speed-ups on specific instances, even if they may not be competitive with the original strategy on average. Finally, we propose a portfolio approach, which integrates all the different local search algorithms as component tools; such portfolio, rather than choosing the best tool for a given instance up-front, takes the decision on-line. The proposed approach drastically limits memory bandwidth constraints and avoids other typical portfolio fragility as CPU and GPU versions often show a complementary efficiency and run on separated platforms. Experimental results support the claims and motivate further research to better exploit GPUs in embedded task-intensive and multi-engine parallel applications.


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

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

Author(s):  
Nilushan Costa ◽  
Malith Jayasinghe ◽  
Ajantha Atukorale ◽  
Supun Abeysinghe ◽  
Srinath Perera ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document