Optimal Average Case Sorting on Arrays
نویسندگان
چکیده
We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architectures that are optimal on average. If one processor has many packets then we asymptotically halve the up to now best running times. For a load of one optimal algorithms are known for the mesh. We improve this to a load of eight without increasing the running time. For tori no optimal algorithms were known even for a load of one. Our algorithm is optimal for every load. Other architectures we consider include meshes with diagonals and reconngurable meshes. Furthermore , the method applies to meshes of arbitrary higher dimensions and also enables optimal solutions for the routing problem.
منابع مشابه
Bidirectional Conditional Insertion Sort algorithm; An efficient progress on the classical insertion sort
In this paper, we proposed a new efficient sorting algorithm based on insertion sort concept. The proposed algorithm called Bidirectional Conditional Insertion Sort (BCIS). It is in-place sorting algorithm and it has remarkably efficient average case time complexity when compared with classical insertion sort (IS). By comparing our new proposed algorithm with the Quicksort algorithm, BCIS indic...
متن کاملA Statistical Comparative Study of Some Sorting Algorithms
This research paper is a statistical comparative study of a few average case asymptotically optimal sorting algorithms namely, Quick sort, Heap sort and Ksort. The three sorting algorithms all with the same average case complexity have been compared by obtaining the corresponding statistical bounds while subjecting these procedures over the randomly generated data from some standard discrete an...
متن کاملVariation in Best-Case and Worst-Case Performance for Sorting Algorithms
This research examines variation in performance for sorting algorithms in "best-case" and "worst case" situations. Our primary focus is on central tendency and dispersion of execution times for six sorting algorithms. Arrays containing fixed integer sequences are initialized in either increasing (already sorted, representing best-case) or decreasing (reverse sorted, representing worst-case) ord...
متن کاملIn-Place Suffix Sorting
Given string T = T [1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T [i, . . . , n] for all i. This problem is central to the construction of suffix arrays and trees with many applications in string processing, computational biology and compression. A bottleneck in these applications is the amount of workspace needed to perform suffix sorting beyond the spac...
متن کاملMulti-Objective Evolutionary Optimization of Aperiodic Symmetrical Linear Arrays
In this paper, a multi-objective approach is applied to the design of aperiodic linear arrays of antennas. The adopted procedure is based on a standard Matlab implementation of the Controlled Elitist Non-Dominated Sorting Genetic Algorithm II. Broadside symmetrical arrays of isotropic radiators are considered with both uniform and non-uniform excitations. The work focuses on whether, and in whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995