scholarly journals Analysis and Research of Sorting Algorithm in Data Structure Based on C Language

2020 ◽  
Vol 1544 ◽  
pp. 012002
Author(s):  
Zhi-Gang Zhu
Keyword(s):  
Data Structure ◽  
Sorting Algorithm ◽  
C Language

ON FINDING A HAMILTONIAN PATH IN A TOURNAMENT USING SEMI-HEAP

2000 ◽  
Vol 10 (04) ◽  
pp. 279-294
Author(s):  
JIE WU
Keyword(s):  
Data Structure ◽  
Parallel Algorithm ◽  
Ordered Set ◽  
Hamiltonian Path ◽  
Linear Ordering ◽  
Sorting Algorithm ◽  
Ranking System ◽  
Special Linear ◽  
Erew Pram ◽  
Pram Model

The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a special linear ordering (also called a generalized sorted sequence) for any intransitive total ordered set, or equivalently, the existence of a Hamiltonian path in a tournament. A new data structure called semi-heap is proposed to construct an optimal Θ(n log n) sorting algorithm. We also provide a cost-optimal parallel algorithm using semi-heap. The run time of this algorithm is Θ(n) with Θ( log n) processors under the EREW PRAM model. The use of a Hamiltonian path (generalized sorting sequence) as an approximation of a ranking system in a tournament is also discussed.

scholarly journals A Study of Integer Sorting on Multicores

2018 ◽  
Vol 28 (04) ◽  
pp. 1850014
Author(s):  
Alexandros V. Gerbessiotis
Keyword(s):  
Multicore Processors ◽  
Sorting Algorithm ◽  
Parallel Sorting ◽  
Memory Hierarchies ◽  
Radix Sort ◽  
C Language ◽  
Programming Effort ◽  
Regular Sampling ◽  
High Level ◽  
Integer Sorting

Integer sorting on multicores and GPUs can be realized by a variety of approaches that include variants of distribution-based methods such as radix-sort, comparison-oriented algorithms such as deterministic regular sampling and random sampling parallel sorting, and network-based algorithms such as Batcher’s bitonic sorting algorithm. In this work we present an experimental study of integer sorting on multicore processors. We have implemented serial and parallel radix-sort for various radixes, deterministic regular oversampling, and random oversampling parallel sorting, including new variants of ours, and also some previously little explored or unexplored variants of bitonic-sort and odd-even transposition sort. The study uses multithreading and multiprocessing parallel programming libraries with the same C language code working under Open MPI, MulticoreBSP, and BSPlib. We first provide some general high-level observations on the performance of these implementations. If we can conclude anything is that accurate prediction of performance by taking into consideration architecture dependent features such as the structure and characteristics of multiple memory hierarchies is difficult and more often than not untenable. To some degree this is affected by the overhead imposed by the high-level library used in the programming effort. Another objective is to model the performance of these algorithms and their implementations under the MBSP (Multi-memory BSP) model. Despite the limitations mentioned above, we can still draw some reliable conclusions and reason about the performance of these implementations using the MBSP model, thus making MBSP useful and usable.

Study on Data Structure of Excavation Monitoring System

2011 ◽  
Vol 105-107 ◽  
pp. 695-700
Author(s):  
Jie Nan Tu ◽  
Ping Ma ◽  
Xiao Hua Pan
Keyword(s):  
Data Structure ◽  
Monitoring System ◽  
Data Types ◽  
Foundation Pit ◽  
Monitoring Point ◽  
C Language ◽  
Building Foundation ◽  
System Data ◽  
Point Types ◽  
Monitoring Information

With the C# language and Access database, Building Foundation Pit Monitoring Information System (BFPMIS) was developed. At the process of developing the excavation monitoring system, the design of the system data structures and the data types are discussed. The excavation monitoring system contains main data structure and assistant data structure. The data structure, data element and data type of projects, bids, sections, monitoring point types, point property, alert values, bore information, pile information and beam information are analyzed emphatically. The application of the tree structure in the main data structure is introduced. And the monitoring points are classified according to the monitoring objects to describe and store the monitoring data. The system set orange alarm and red alarm to every monitoring point.

Sorting Algorithm for Uniform-Distributed Data

2015 ◽  
Vol 713-715 ◽  
pp. 1922-1925
Author(s):  
Yue Jia
Keyword(s):  
Sorting Algorithm ◽  
Distributed Data ◽  
C Language ◽  
Sorting Time ◽  
Ibm Pc

We describe a sorting algorithm,by which uniform-distributed data can be sorted,and sorting time is. This algorithm has been implemented in IBM PC using C language.

scholarly journals Using the bag-of-tasks model with centralized storage for distributed sorting of large data array

2019 ◽  
pp. 199-203
Author(s):  
S V Vostokin ◽  
I V Bobyleva
Keyword(s):  
Data Exchange ◽  
Directed Acyclic Graph ◽  
Programming Model ◽  
Large Data ◽  
Sorting Algorithm ◽  
Data Array ◽  
C Language ◽  
Technical Requirements ◽  
Software And Hardware ◽  
Algorithmic Structure

The article discusses the application of the bag of tasks programming model for the problem of sorting a large data array. The choice is determined by the generality of its algorithmic structure with various problems from the field of data analysis including correlation analysis, frequency analysis, and data indexation. The sorting algorithm is a blockby-block sorting, followed by the pairwise merging of the blocks. At the end of the sorting, the data in the blocks form an ordered sequence. The order of sorting and merging tasks is set by a static directed acyclic graph. The sorting algorithm is implemented using MPI library in C ++ language with centralized storing of data blocks on the manager process. A feature of the implementation is the transfer of blocks between the master and the worker MPI processes for each task. Experimental study confirmed the hypothesis that the intensive data exchange resulting from the centralized nature of the bag of task model does not lead to a loss of performance. The data processing model makes it possible to weaken the technical requirements for the software and hardware.

An Efficient Algorithm for Suffix Sorting

2016 ◽  
Vol 30 (06) ◽  
pp. 1659018 ◽  
Author(s):  
Zhan Peng ◽  
Yuping Wang ◽  
Xingsi Xue ◽  
Jingxuan Wei
Keyword(s):  
Data Structure ◽  
Efficient Algorithm ◽  
String Matching ◽  
Suffix Array ◽  
Experimental Results ◽  
Sorting Algorithm ◽  
Lexicographical Order ◽  
Sorting Algorithms ◽  
Primary Problem

The Suffix Array (SA) is a fundamental data structure which is widely used in the applications such as string matching, text index and computation biology, etc. How to sort the suffixes of a string in lexicographical order is a primary problem in constructing SAs, and one of the widely used suffix sorting algorithms is qsufsort. However, qsufsort suffers one critical limitation that the order of suffixes starting with the same [Formula: see text] characters cannot be determined in the kth round. To this point, in our paper, an efficient suffix sorting algorithm called dsufsort is proposed by overcoming the drawback of the qsufsort algorithm. In particular, our proposal maintains the depth of each unsorted portion of SA, and sorts the suffixes based on the depth in each round. By this means, some suffixes that cannot be sorted by qsufsort in each round can be sorted now, as a result, more sorting results in current round can be utilized by the latter rounds and the total number of sorting rounds will be reduced, which means dsufsort is more efficient than qsufsort. The experimental results show the effectiveness of the proposed algorithm, especially for the text with high repetitions.

Distributed Modeling Of Building Systems Through Cyber-Physical Integration

2019 ◽  
pp. 12-17
Keyword(s):  
Data Structure ◽  
Operating Conditions ◽  
Physical Models ◽  
Distributed Model ◽  
Physical Processes ◽  
Distributed Modeling ◽  
Distributed Models ◽  
Operating Modes ◽  
Building Systems ◽  
Important Practical Application

This article describes the proposed approaches to creating distributed models that can, with given accuracy under given restrictions, replace classical physical models for construction objects. The ability to implement the proposed approaches is a consequence of the cyber-physical integration of building systems. The principles of forming the data structure of designed objects and distributed models, which make it possible to uniquely identify the elements and increase the level of detail of such a model, are presented. The data structure diagram of distributed modeling includes, among other things, the level of formation and transmission of signals about physical processes inside cyber-physical building systems. An enlarged algorithm for creating the structure of the distributed model which describes the process of developing a data structure, formalizing requirements for the parameters of a design object and its operating modes (including normal operating conditions and extreme conditions, including natural disasters) and selecting objects for a complete group that provides distributed modeling is presented. The article formulates the main approaches to the implementation of an important practical application of the cyber-physical integration of building systems - the possibility of forming distributed physical models of designed construction objects and the directions of further research are outlined.

Sign in / Sign up

Export Citation Format

Share Document