期刊名称：International Journal of Advanced Computer Science and Applications(IJACSA)
印刷版ISSN：2158-107X
电子版ISSN：2156-5570
出版年度：2019
卷号：10
期号：12
页码：655-663
出版社：Science and Information Society (SAI)
摘要：Algorithms are commonly perceived as difficult
subjects. Many applications today require complex algorithms.
However, the researchers look for ways to make them as simple
as possible. In high time demanding fields, the process of sorting
represents one of the foremost issues in the data structure for
searching and optimization algorithms. In parallel processing,
we divide program instructions among multiple processors by
breaking problems into modules that can be executed in parallel,
to reduce the execution time. In this paper, we proposed a novel
parallel, re-configurable and adaptive sorting network of the
BulkSort algorithm. Our architecture is based on simple and
elementary operations such as comparison and binary shifting.
The main strength of the proposed solution is the ability to sort
in parallel without memory usage. Experimental results show
that our proposed model is promising according to the required
resources and its ability to perform a high-speed sorting process.
In this study, we take into account the analysis result of the
Simulink design to establish the required hardware resources of
the proposed system.
