729 Hits in 3.9 sec

A Fast Sorting Strategy Based on a Two-way Merge Sort for Balancing the Capacitor Voltages in Modular Multilevel Converters

Fangzhou Zhao, Guochun Xiao, Min Liu, Daoshu Yang
2017 Journal of Power Electronics (JPE)  
In comparison with the commonly used quicksort algorithm, it saves at least two-thirds of the sorting execution time in one arm with 100 SMs, and saves more with a higher number of SMs.  ...  The proposed sorting methods are combined with the features of the MMC-HVDC control strategy, which significantly accelerates the sorting process and reduces the implementation efforts.  ...  In comparison with quicksort, Capacitor voltage variation under different conditions: (a) Capacitor voltage variation of using TWMS with different control periods, (b) Capacitor voltage variation of using  ... 
doi:10.6113/jpe.2017.17.2.346 fatcat:hujlpwytqjecfocckkwht7mafa

An experimental study of sorting and branch prediction

Paul Biggar, Nicholas Nash, Kevin Williams, David Gregg
2008 ACM Journal of Experimental Algorithmics  
We find insertion sort to have the fewest branch mispredictions of any comparison-based sorting algorithm, that bubble and shaker sort operate in a fashion which makes their branches highly unpredictable  ...  We find also that optimizations to quicksort -for example the choice of pivot -have a strong influence on the predictability of its branches.  ...  Comparing (a) with (b), (c) and (d), we see that the insertion branch associated with its insertion sort is slightly less predictable than in the other variations.  ... 
doi:10.1145/1227161.1370599 fatcat:g6cejtvaorgcziwlb7um5e6pb4

Huskysort [article]

R.C. Hillyard, Yunlu Liaozheng, Sai Vineeth K.R
2020 arXiv   pre-print
In Java, the two system sorts are dual-pivot quicksort (for primitives) and Timsort for objects.  ...  We demonstrate that a combination of these two algorithms can run significantly faster than either algorithm alone for the types of objects which are expensive to compare.  ...  ACKNOWLEDGMENTS To Darshan Dedhia, Akshay Bhusare, Kartik Kumar for their help with this project.  ... 
arXiv:2012.00866v1 fatcat:bgrvsjiwbvey7mnms47k7geaj4

Beacon- and Schema-Based Method for Recognizing Algorithms from Students' Source Code

Ahmad Taherkhani, Lauri Malmi
2013 Zenodo  
The method and its performance is demonstrated in the case of basic sorting algorithms and their variations implemented both in various learning resources, that is, textbooks and websites, (N = 209 programs  ...  Schemas are high-level programming knowledge with detailed knowledge abstracted out, and beacons are statements that imply specific structures in a program.  ...  Figure 7 7 shows the implementation of these variations and compares it with a typical implementation of a standard Insertion sort. .  ... 
doi:10.5281/zenodo.3554635 fatcat:moofcjymfrh5boul7saxihr724

Introspective Sorting and Selection Algorithms

1997 Software, Practice & Experience  
Quicksort is the preferred in-place sorting algorithm in many contexts, since its average computing time on uniformly distributed inputs is Θ (N log N) , and it is in fact faster than most other sorting  ...  Using heapsort as the 'stopper' yields a sorting algorithm that is just as fast as quicksort in the average case, but also has an Θ(N log N) worst case time bound.  ...  Stewart suggested the idea for the class of sequences K N . J. Valois and two anonymous referees made many useful comments on an earlier draft of this paper.  ... 
doi:10.1002/(sici)1097-024x(199708)27:8<983::aid-spe117>;2-# fatcat:ry3jci2xfrfqbem5qbau7amxbu

Inversion-sensitive sorting algorithms in practice

Amr Elmasry, Abdelrahman Hammad
2009 ACM Journal of Experimental Algorithmics  
outperformed by Quicksort.  ...  We study the performance of the most practical inversion-sensitive internal sorting algorithms.  ...  Quicksort is adaptive with respect to the number of swaps.  ... 
doi:10.1145/1412228.1455267 fatcat:wph56emfabaqtbpkwc3f4k6eoi

Recursion patterns and time-analysis

Manuel Barbosa, Alcino Cunha, Jorge Sousa Pinto
2005 SIGPLAN notices  
For the latter, we use as case-studies two famous sorting algorithms, mergesort and quicksort.  ...  Even though time analysis is not compositional, we argue that splitting functions to expose the explicit construction of the recursion tree and its later consumption helps with this analysis.  ...  This leads to a quadratic variation of the execution time of this function with respect to the number of tree elements.  ... 
doi:10.1145/1071221.1071226 fatcat:mv2nsbs26vfzlfo64twvvoqx5a

Engineering Radix Sort

Peter M. McIlroy, Keith Bostic, M. Douglas McIlroy
1993 Computing Systems  
Three ways to sort strings by bytes left to right-a stable list sort, a stable two-array sort, and an in-place "American flag" sor¿-are illustrated with practical C programs.  ...  For heavy-duty sorting, all three perform comparably, usually running at least twice as fast as a good quicksort. We recommend American flag sort for general use.  ...  Other experiments show similar variation with hardware. The sensitivity of the pile-span heuristic to key distribution shows up in Figure 5 .1 as a large variation of slope for list-based sort.  ... 
dblp:journals/csys/McIlroyBM93 fatcat:imv3spo6inbzvjb2csq3yjf5rq

Sequential in-core sorting performance for a SQL data service and for parallel sorting on heterogeneous clusters

Christophe Cérin, Michel Koskas, Hazem Fkaier, Mohamed Jemni
2006 Future generations computer systems  
Algorithms are variations of the 3way-Quicksort of Segdewick.  ...  About 50% of the work done in building indexes is devoted to sorting sets of integers. We develop and compare algorithms built to sort with equal keys.  ...  We are currently interfacing our sorting codes with the current release of Zeta-Data.  ... 
doi:10.1016/j.future.2006.02.014 fatcat:7ghwz745djda5fgs37wpdheadi

Cache-conscious sorting of large sets of strings with dynamic tries

Ranjan Sinha, Justin Zobel
2005 ACM Journal of Experimental Algorithmics  
We experimentally compare burstsort to existing string-sorting algorithms on large and small sets of strings with a range of characteristics.  ...  Ongoing changes in computer performance are affecting the efficiency of string sorting algorithms.  ...  It combines the advantages of LSD and MSD radixsort and is a simple and efficient algorithm with good worst-case behavior.  ... 
doi:10.1145/1005813.1041517 fatcat:xdyz5k3ib5ctplt3kfmpv7vzuq

Fringe analysis for Extquick: Anin situ distributive external sorting algorithm

Walter Cunto, Gasto´n H. Gonnet, J. Ian Munro, Patricio V. Poblete
1991 Information and Computation  
Since the computational tree of Quicksort-like sorting algorithms is equivalent to a search tree, techniques that model the time complexity of such a structure are then used for the analysis of Extquick  ...  It is shown that Extquick performs more efficiently than similar in situ sorting algorithms based on Quicksort that appear in the literature.  ...  Rivero, and an anonymous referee for pointing out improvements in the presentation of this paper.  ... 
doi:10.1016/0890-5401(91)90007-o fatcat:ih6xi3qh6fftjbemn3j3tnucry


Theofilos Petsios, Jason Zhao, Angelos D. Keromytis, Suman Jana
2017 Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security - CCS '17  
Such attacks have been known to have serious effects on production systems, take down entire websites, or lead to bypasses of Web Application Firewalls.  ...  When such conditions are met, an attacker can launch Denial-of-Service attacks against a vulnerable application by providing inputs that trigger the worst-case behavior.  ...  Any opinions, ndings, conclusions, or recommendations expressed herein are those of the authors, and do not necessarily re ect those of the US Government, ONR, NSF, or Google.  ... 
doi:10.1145/3133956.3134073 dblp:conf/ccs/PetsiosZKJ17 fatcat:sop7353vf5epzdrlah2xslinam


Surya Sujarwo
2013 CommIT Journal  
The hybrid approach uses various variations of quicksort partition algorithms in combination with cutoff to shellsort using several cutoff elements.  ...  This article describes an empirical study of hybrid approach of quicksort algorithms.  ...  There are many improvements can be done in Quicksort such as cutoff to insertion sort [1, 6] , median-of-three partitioning [1, 7] , median-of-five with or without random index selection [8] , and multiple  ... 
doi:10.21512/commit.v7i2.582 fatcat:kszni3e4tjbnnjpntrfjozubue

Multithreaded architectures and the sort benchmark

Phil Garcia
2005 Proceedings of the 1st international workshop on Data management on new hardware - DAMON '05  
These extra comparisons and writes combined with mergesort's larger memory footprint lead to an interesting combination of the 2 sorts to get the best overall runtime.  ...  We experimented with variations in how the workload is assigned to threads, initially using a round-robin approach to quicksorting and obtaining two sets to merge.  ... 
doi:10.1145/1114252.1114254 fatcat:eo27prg5ivaydljmw5agnfomg4

A guided bibliography to sorting

H. Lorin
1971 IBM Systems Journal  
Each method is a variant of QUICKSORT with or without merging.  ...  A presentation of radix exchange, a nonrecursively encoded form of QUICKSORT, a modified SHELLSORT, and a combined technique derived from SHELLSORT and merging.  ... 
doi:10.1147/sj.103.0244 fatcat:e7sttiwnj5ghzemi74nb6xlds4
« Previous Showing results 1 — 15 out of 729 results