Tie-Jun Li

Tie-Jun Li

Auto-generated profile, based on publicly available information

Tie-Jun Li

National university of defense technology, Changsha, China

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 February 2010 in International Journal of Automation and Computing
Verified
Journal Article
Closed access
PDF file
TLTie-Jun Li
Tie-Jun Li
Gui-Qiang G. ChenGui-Qiang G. Chen
Gui-Qiang G. Chen
GSGuifang Shao
Guifang Shao

1 November 2021 in Chinese Journal of Electronics
Verified
Journal Article
Open access
PDF file
LTLi Tiejun
Li Tiejun
KMkefan ma
kefan ma
JZJianmin Zhang
Jianmin Zhang
The Boolean Satisfiability (SAT) problem is the key problem in computer theory and application. A parallel multi-thread SAT solver named pprobSAT+ on a configurable hardware is proposed. In the algorithm, multithreads are executed simultaneously to hide the circuit stagnate. In order to improve the working frequency and throughput of the SAT solver, the deep pipeline strategy is adopted. When all data stored in block random access memory of the field programmable gate array, the solver can achieve maximum performance. If partial data are stored in the external memory, the size of the problem instances the SAT solver can be greatly improved. The experimental results show that the speedup of three-thread SAT solver is approximately 2.4 times with single thread, and shows that the pprobSAT+ have achieved substantial improvement while a solution is found.