Results 181 to 190 of about 196,748 (236)
Some of the next articles are maybe not open access.
SIAM Journal on Computing, 1986
Summary: We give a parallel implementation of merge sort on a CREW PRAM that uses n processors and O(log n) time; the constant in the running time is small. We also give a more complex version of the algorithm for the EREW PRAM; it also uses n processors and O(log n) time. The constant in the running time is still moderate, though not as small.
openaire +1 more source
Summary: We give a parallel implementation of merge sort on a CREW PRAM that uses n processors and O(log n) time; the constant in the running time is small. We also give a more complex version of the algorithm for the EREW PRAM; it also uses n processors and O(log n) time. The constant in the running time is still moderate, though not as small.
openaire +1 more source
Correction: Parallel Merge Sort
SIAM Journal on Computing, 1993Correction concerned with ibid. 17, No. 4, 770-785 (1988; Zbl 0651.68077).
openaire +1 more source
Sorting by Merging or Merging by Sorting?
2006In the comparison model the only operations allowed on input elements are comparisons and moves to empty cells of memory. We prove the existence of an algorithm that, for any set of s ≤n sorted sequences containing a total of n elements, computes the whole sorted sequence using O(nlogs) comparisons, O(n) data moves and O(1) auxiliary cells of memory ...
openaire +1 more source
SIAM Journal on Algebraic Discrete Methods, 1982
The need for sorting algorithms which operate in a fixed number of rounds (rather than have each new comparison depend on the outcomes of all previous comparisons) arises in structural modeling. Since all comparisons within a round are evaluated simultaneously, such algorithms have an obvious connection to parallel processing.In an earlier paper (SIAM ...
Haeggkvist, R., Hell, P.
openaire +1 more source
The need for sorting algorithms which operate in a fixed number of rounds (rather than have each new comparison depend on the outcomes of all previous comparisons) arises in structural modeling. Since all comparisons within a round are evaluated simultaneously, such algorithms have an obvious connection to parallel processing.In an earlier paper (SIAM ...
Haeggkvist, R., Hell, P.
openaire +1 more source
1997
Information in a computer system is normally kept in a sorted order of some kind. We looked at sorted lists and sorted tables earlier on in the book and in the last two chapters we considered relative and indexed files in which the records are ordered — relative files by record number and indexed files by a record key item(s).
Roger Hutty, Mary Spence
openaire +1 more source
Information in a computer system is normally kept in a sorted order of some kind. We looked at sorted lists and sorted tables earlier on in the book and in the last two chapters we considered relative and indexed files in which the records are ordered — relative files by record number and indexed files by a record key item(s).
Roger Hutty, Mary Spence
openaire +1 more source
Searching, Sorting and Merging
2015In this chapter, we will explain the following: How to search a list using sequential search How to sort a list using selection sort How to sort a list using insertion sort How to sort a list of strings How to sort parallel arrays How to search a sorted list using binary search How to merge two sorted ...
openaire +1 more source
Merge sort enhanced in place sorting algorithm
2016 International Conference on Advanced Communication Control and Computing Technologies (ICACCCT), 2016This paper aims at introducing a new sorting algorithm which sorts the elements of an array In Place. This algorithm has O(n) best case Time Complexity and O(n log n) average and worst case Time Complexity. We achieve our goal using Recursive Partitioning combined with In Place merging to sort a given array. A comparison is made between this particular
R Vignesh, Tribikram Pradhan
openaire +1 more source
Parallel merge sort with double merging
2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT), 2014Sorting is one of the fundamental problems in computer science. With the proliferation of multi core processors, parallel algorithms for sorting have become very important. In this study, we propose a new parallel merge sort algorithm in which two threads perform the merge operation simultaneously.
openaire +1 more source
Papers presented at the December 13-15, 1960, eastern joint IRE-AIEE-ACM computer conference on - IRE-AIEE-ACM '60 (Eastern), 1960
Designers of generalized library sort packages for the current and future generations of computers are faced with the challenge of developing new techniques that provide more effective use of these computers. The major concern in developing efficient sorting routines in the past has been the internal sorting techniques, that is, the methods of ...
openaire +1 more source
Designers of generalized library sort packages for the current and future generations of computers are faced with the challenge of developing new techniques that provide more effective use of these computers. The major concern in developing efficient sorting routines in the past has been the internal sorting techniques, that is, the methods of ...
openaire +1 more source
Parallel Merge Sort with Load Balancing
International Journal of Parallel Programming, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jeon, Minsoo, Kim, Dongseung
openaire +1 more source