Execution Time of Quick Sort on Different C Compilers A Benchmark

2018 ◽  
Vol 6 (9) ◽  
pp. 786-788
Author(s):  
Mehzabeen Kaur ◽  
Surender Jangra
Keyword(s):  
Execution Time ◽  
Quick Sort

scholarly journals Automatic Parallelization using Open MP Directives

2019 ◽  
Vol 8 (11) ◽  
pp. 4059-4063
Keyword(s):  
Parallel Computing ◽  
Execution Time ◽  
Automatic Parallelization ◽  
Linear Search ◽  
Work Sharing ◽  
The Core ◽  
Before And After ◽  
Parallel Code ◽  
Quick Sort

With the increase in the advent of parallel computing, it has become necessary to write OpenMP programs to achieve better speedup and to exploit parallel hardware efficiently. However, to achieve this, the programmers are required to understand OpenMP directives and clauses, the dependencies in their code, etc. A small mistake made by them, such as wrongly analysing a dependency or wrong data scoping of a variable, can result in an incorrect or inefficient program. In this paper, we propose a system which can automate the process of parallelization of a serial C code. The system accepts a serial program as input and generates the corresponding parallel code in OpenMP without altering the core logic of the program. The system has used different data scoping and work sharing constructs available in OpenMP platform.The system designed here aims at parallelizing “for” loops, “while” loops, nested “for” loops and recursive structures.The system has parallelized “for” loop by considering the induction variable. And converted “while” loop to “for” loop for parallelization. The system is tested by providing several programs such as matrix addition, quick sort, linear search etc. as input. The execution time of programs before and after parallelization is determined and a graph is plotted to help visualize the decrease in execution time

scholarly journals Perbandingan Metode Selection Sort dan Insertion Sort Dalam Pengurutan Data Menggunakan Bahasa Program Java

Petir ◽  
2019 ◽  
Vol 12 (2) ◽  
pp. 172-178
Author(s):  
Endang Sunandar
Keyword(s):  
Data Model ◽  
Execution Time ◽  
Sorting Data ◽  
The Difference ◽  
Quick Sort

There are various kinds of sorting data methods that we know of which are Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, Shell Sort, and Heap Sort methods. All of these methods have their respective strengths and weaknesses, the use of which is determined based on needs. Each method has a different algorithm, where the difference in this algorithm affects the execution time. In this paper the authors make a comparison of the 2 methods of sorting data, namely the Sort Sort and Insertion Sort methods, with consideration that the two methods are concise algorithms and have almost the same algorithm pattern. , using the same number and data model. The purpose of this comparison is to provide an overview of the two methods, which method has faster execution time, whether the Selection sort method or the Insertion Sort method.

scholarly journals SA Sorting: A Novel Sorting Technique for Large-Scale Data

2019 ◽  
Vol 2019 ◽  
pp. 1-7
Author(s):  
Mohammad Shabaz ◽  
Ashok Kumar
Keyword(s):  
Big Data ◽  
Data Structures ◽  
Execution Time ◽  
Large Scale ◽  
Special Situation ◽  
Large Scale Data ◽  
Sorting Technique ◽  
Logical Order ◽  
Scale Data ◽  
Quick Sort

Sorting is one of the operations on data structures used in a special situation. Sorting is defined as an arrangement of data or records in a particular logical order. A number of algorithms are developed for sorting the data. The reason behind developing these algorithms is to optimize the efficiency and complexity. The work on creating new sorting approaches is still going on. With the rise in the generation of big data, the concept of big number comes into existence. To sort thousands of records either sorted or unsorted, traditional sorting approaches can be used. In those cases, we can ignore the complexities as very minute difference exists in their execution time. But in case the data are very large, where execution time or processed time of billion or trillion of records is very large, we cannot ignore the complexity at this situation; therefore, an optimized sorting approach is required. Thus, SA sorting is one of the approaches developed to check sorted big numbers as it works better on sorted numbers than quick sort and many others. It can also be used to sort unsorted records as well.

TOP HILL METHOD - A NEW SORTING APPROACH TO REDUCE EXECUTION TIME

2018 ◽  
Vol 12 (4) ◽  
pp. 28
Author(s):  
BHARALI DEBABRAT ◽  
KUMAR SHARMA SANDEEP ◽  
◽  
Keyword(s):  
Execution Time ◽  
Reduce Execution Time

Identifying Possibly Parallel regions Using Average Execution Time of Regions and Data Dependence Profiling

2009 ◽  
Vol 31 (10) ◽  
pp. 1745-1753
Author(s):  
Chao ZHANG ◽  
Lei WANG ◽  
Xiao-Ya XIANG ◽  
Xiao-Bing FENG
Keyword(s):  
Execution Time ◽  
Data Dependence

Security Analysis of Wireless Authentication Protocols

2019 ◽  
Vol 9 (2) ◽  
pp. 247-252 ◽  
Author(s):  
Ashish Joshi ◽  
Amar Kumar Mohapatra
Keyword(s):  
Execution Time ◽  
Communication Systems ◽  
Security Analysis ◽  
Cryptographic Protocols ◽  
Command Line ◽  
Time Analysis ◽  
Authentication Protocols ◽  
Replay Attack ◽  
Peer Communication ◽  
Digital Communication Systems

Background & Objective: Cryptographic protocols had been evident method for ensuring con dentiality, Integrity and authentication in various digital communication systems. However the validation and analysis of such cryptographic protocols was limited to usage of formal mathematical models until few years back. Methods: In this paper, various popular cryptographic protocols have been studied. Some of these protocols (PAP, CHAP, and EAP) achieve security goals in peer to peer communication while others (RADIUS, DIAMETER and Kerberos) can work in multiparty environment. These protocols were validated and analysed over two popular security validation and analysis tools AVISPA and Scyther. The protocols were written according to their documentation using the HLPSL and SPDL for analysis over AVISPA and Scyther respectively. The results of these tools were analysed to nd the possible attack an each protocol. Afterwards The execution time analysis of the protocols were done by repeating the experiment for multiple iterations over the command line versions of these tools.As the literature review suggested, this research also validates that using password based protocols (PAP) is faster in terms of execution time as compared to other methods, Usage of nonces tackles the replay attack and DIAMETER is secure than RADIUS. Results and Conclusion: The results also showed us that DIAMETER is faster than RADIUS. Though Kerberos protocol was found to safe, the results tell us that it is compromisable under particular circumstances.

Sign in / Sign up

Export Citation Format

Share Document