A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Greed sort: optimal deterministic sorting on parallel disks
1995
Journal of the ACM
Preserved Fulltext
Our main result is an elegant, easy-to-implement, optimal, detemzinistic algorithm for external sorting with D disk drives. ...
We present an algorithm for sorting efficiently with parallel two-level memories. ...
In the next section, we answer the open question
posed in Vitter
and Shriver
[1990] and present for the parallel
disk model an optimal
deterministic
sorting
algorithm
called Greed Sort. ...
doi:10.1145/210332.210343
fatcat:yfsc4fhmcvdqdlbzkx7jvrfm2i
Guidesort: Simpler Optimal Deterministic Sorting for the Parallel Disk Model
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
A new algorithm, Guidesort, for sorting in the uniprocessor variant of the parallel disk model (PDM) of Vitter and Shriver is presented. ...
The algorithm is deterministic and executes a number of (parallel) I/O operations that comes within a constant factor C of the optimum. ...
The parallel disk model of Vitter and Shriver [14] tries to capture these characteristics of disk systems and has been used for much of the extensive research on sorting with several disks. ...
arXiv:1807.11328v3
fatcat:uurztw7myfdafjejbpixysqyy4
Page 3222 of Mathematical Reviews Vol. , Issue 97E
[page]
1997
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
.; Vitter, Jeffrey Scott (1-DUKE-C; Durham, NC) Greed sort: optimal deterministic sorting on parallel disks. (English summary )
J. Assoc. Comput. Mach. 42 (1995), no. 4, 919-933. ...
Our main result is an elegant, easy-to- implement, optimal, deterministic algorithm for external sorting with D disk drives. ...
Duality Between Prefetching and Queued Writing with Parallel Disks
2005
SIAM journal on computing (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Another application of this duality gives us the first parallel disk sorting algorithms that are provably optimal up to lower-order terms. ...
Parallel disks promise to be a cost effective means for achieving high bandwidth in applications involving massive data sets, but algorithms for parallel disks can be difficult to devise. ...
Greed sort [21] is an optimal (up to a constant factor) deterministic sorting method based on mergesort; it does it an approximate merge and then finalizes the merge using columnsort. ...
doi:10.1137/s0097539703431573
fatcat:tskw3fqffzauzbq5ym3fvq4u7y
Duality between Prefetching and Queued Writing with Parallel Disks
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Another application of this duality gives us the first parallel disk sorting algorithms that are provably optimal up to lower-order terms. ...
Parallel disks promise to be a cost effective means for achieving high bandwidth in applications involving massive data sets, but algorithms for parallel disks can be difficult to devise. ...
Greed sort [21] is an optimal (up to a constant factor) deterministic sorting method based on mergesort; it does it an approximate merge and then finalizes the merge using columnsort. ...
doi:10.1007/3-540-44676-1_5
fatcat:o674cwdv3jg4lgqkojs5snnq34
Markov analysis of multiple-disk prefetching strategies for external merging
1994
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Closed-form expressions for the average parallelism obtainable for a given cache size and number of disks are derived for both prefetching strategies. ...
Concurrency can be introduced by overlapping I/O requests at different disks and by prefetching additional blocks on each I/O operation. To support this prefetching, a memory cache is required. ...
Vitter and Nodine have discovered an ingenious deterministic, mergesortlike algorithm called greed sort. ...
doi:10.1016/0304-3975(94)90170-8
fatcat:sbvxcgcpazahllgeiinqjb2zrm
Competitive parallel disk prefetching and buffer management
1997
Proceedings of the fifth workshop on I/O in parallel and distributed systems - IOPADS '97
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Given a ¤ -disk parallel I/O system and a globally shared I/O buffer that can hold upto ¥ disk blocks, we derive a lower bound of ¦ § © ¤ on the competitive ratio of any deterministic online prefetching ...
When the buffer is distributed into ¤ portions of ¥ ¤ blocks each, the algorithm GREED based on local lookahead is shown to be optimal, and NOM is within a constant factor of optimal. ...
When P-MIN is restricted to read-once reference strings it behaves like GREED. Hence GREED is optimal. ...
doi:10.1145/266220.266225
dblp:conf/iopads/BarveKVV97
fatcat:ruiupg7l7zembnnrrcojvd3tmy
Competitive Parallel Disk Prefetching and Buffer Management
2000
Journal of Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Given a ¤ -disk parallel I/O system and a globally shared I/O buffer that can hold upto ¥ disk blocks, we derive a lower bound of ¦ § © ¤ on the competitive ratio of any deterministic online prefetching ...
When the buffer is distributed into ¤ portions of ¥ ¤ blocks each, the algorithm GREED based on local lookahead is shown to be optimal, and NOM is within a constant factor of optimal. ...
When P-MIN is restricted to read-once reference strings it behaves like GREED. Hence GREED is optimal. ...
doi:10.1006/jagm.2000.1089
fatcat:4hzqipzwl5e4hd2tkrfgghjyji
External memory algorithms and data structures: dealing with massive data
2001
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The paradigm of disk striping offers an elegant way to use multiple disks in parallel. For sorting, however, ...
For the batched problem of sorting and related problems such as permuting and fast Fourier transform, the key paradigms include distribution and merging. ...
The Greed Sort method of Nodine and Vitter [1995] was the first optimal deterministic EM algorithm for sorting with multiple disks. ...
doi:10.1145/384192.384193
fatcat:tunz4fa3rrgv7hwbk7qsvahd5i
Simple randomized mergesort on parallel disks
1997
Parallel Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Unlike previously proposed optimal sorting algorithms, SRM outperforms DSM even when the number D of parallel disks is small. ...
We consider the problem of sorting a file of N records on the D-disk model of parallel I/O in which there are two sources of parallelism. ...
for external sorting on parallel disks [NV90, NV93] . ...
doi:10.1016/s0167-8191(97)00015-x
fatcat:ajsdkgte3jeofekdhtjeatpjde
Simple randomized mergesort on parallel disks
1996
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures - SPAA '96
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Unlike previously proposed optimal sorting algorithms, SRM outperforms DSM even when the number D of parallel disks is small. ...
We consider the problem of sorting a file of N records on the D-disk model of parallel I/O in which there are two sources of parallelism. ...
for external sorting on parallel disks [NV90, NV93] . ...
doi:10.1145/237502.237513
dblp:conf/spaa/BarveGV96
fatcat:xctithwjazc3le72tyfwzluwfe
Simple randomized Mergesort on parallel disks
[chapter]
1998
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Unlike previously proposed optimal sorting algorithms, SRM outperforms DSM even when the number D of parallel disks is small. ...
We consider the problem of sorting a file of N records on the D-disk model of parallel I/O in which there are two sources of parallelism. ...
for external sorting on parallel disks [NV90, NV93] . ...
doi:10.1090/dimacs/043/01
dblp:conf/dimacs/BarveGV97
fatcat:iyejpy4trjhhlogxazvq2phqlm
Algorithms and Data Structures for External Memory
2006
Foundations and Trends® in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The resulting input/output communication (or I/O) between fast internal memory and slower external memory (such as disks) can be a major performance bottleneck. ...
The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, databases, geographic information systems, and text and string processing. ...
The Greed Sort method of Nodine and Vitter [274] was the first optimal deterministic EM algorithm for sorting with multiple disks. ...
doi:10.1561/0400000014
fatcat:bkfchugd4fbjvcu5zipnh23k6e
Bubble execution
2018
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Typically, such a query execution involves orchestrating the execution of hundreds or thousands of related tasks on cloud scale clusters. ...
This paper introduces Bubble Execution, a new query processing framework for interactive workloads at cloud scale, that balances cost-based query optimization, fault tolerance, optimal resource management ...
Running such engines on expensive high-end nodes, e.g. parallel databases, gives very low query latencies. ...
doi:10.14778/3192965.3192967
fatcat:fll5r6p355hj5eagx6mrcxehfu
A Parallel Algorithm of Multiple String Matching Based on Set-Partition in Multi-core Architecture
2016
International Journal of Security and Its Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present and implement a parallel algorithm of multiple string matching based on multi-core platform. ...
Besides, the proposed algorithm reduces the memory cost on average by 4%-20%. 268 Copyright ⓒ 2016 SERSC proposed parallel algorithm is based on the set partitioning. ...
Our work will optimize the state transition table in the preprocessing phase, and we design a DFA-based parallel algorithm. A deterministic finite automaton A can be described as 5-tuple. ...
doi:10.14257/ijsia.2016.10.4.25
fatcat:zv2i5pj3wjcebhnrbtwijqty5q
« Previous
Showing results 1 — 15 out of 93 results