Results 261 to 270 of about 281,251 (291)
Some of the next articles are maybe not open access.
Parallel Merge Sort with Load Balancing
International Journal of Parallel Programming, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Minsoo Jeon, Dongseung Kim
openaire +2 more sources
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 +2 more sources
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 +2 more sources
2014
If there is one thing you should have learned from the chapters on sequential files, it is that your processing options are very limited if a sequential file is not ordered. Solutions based on control breaks, and the file-update problem, are impossible unless the file is ordered on some key field.
openaire +1 more source
If there is one thing you should have learned from the chapters on sequential files, it is that your processing options are very limited if a sequential file is not ordered. Solutions based on control breaks, and the file-update problem, are impossible unless the file is ordered on some key field.
openaire +1 more source
Searching, Merging, and Sorting in Parallel Computation
IEEE Transactions on Computers, 1983We study the number of comparison steps required for searching, merging, and sorting with P processors. We present a merging algorithm that is optimal up to a constant factor when merging two lists of equal size (independent of the number of processors); as a special case, with N processors it merges two lists, each of size N, in 1.893 lg lg N + 4 ...
openaire +1 more source
Merging and Merge-Sort in a Single Hop Radio Network
2006We present two merging algorithms on a single-channel single-hop radio network without collision detection. The simpler of these algorithms merges two sorted sequences of length n in time 4n with energetic cost for each station $\approx {\rm lg} {\it n}$. The energetic cost of broadcasting is constant.
openaire +1 more source
In-Situ Merge Sort Using Hand-Shaking Algorithm
Advances in Intelligent Systems and Computing, 2021exaly