A Binary Array Asynchronous Sorting Algorithm with Using Petri Nets

International Conference on Information Technologies in Business and Industry 2016

计算机科学;经济学;工业技术

Voevoda, A.A.^1 ; Romannikov, D.O.^1

Novosibirsk State Technical University, Karla Marksa ave., 20, Novosibirsk

630073, Russia^1

关键词: Array sorting;    Asynchronization;    Asynchronous system;    Binary arrays;    Elementary methods;    Parallelizations;    Sorting algorithm;    Sorting method;   

Others  :  https://iopscience.iop.org/article/10.1088/1742-6596/803/1/012178/pdf
DOI  :  10.1088/1742-6596/803/1/012178

来源: IOP

【 摘 要 】

Nowadays the tasks of computations speed-up and/or their optimization are actual. Among the approaches on how to solve these tasks, a method applying approaches of parallelization and asynchronization to a sorting algorithm is considered in the paper. The sorting methods are ones of elementary methods and they are used in a huge amount of different applications. In the paper, we offer a method of an array sorting that based on a division into a set of independent adjacent pairs of numbers and their parallel and asynchronous comparison. And this one distinguishes the offered method from the traditional sorting algorithms (like quick sorting, merge sorting, insertion sorting and others). The algorithm is implemented with the use of Petri nets, like the most suitable tool for an asynchronous systems description.