A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is
We propose a taxonomy of parallel sorting that encompasses a broad range of array-and file-sorting algorithms. ... Following our discussion of network sorting algorithms, we describe how faster algorithms have been derived from parallel enumeration sorting schemes, where, with a shared memory model of parallel computation ... A Taxonomy o/Parallel In this paper, we propose a taxonomy of parallel sorting that includes both internal and external parallel sorting algorithms. ...doi:10.1145/2514.2516 fatcat:dc2bhjocynep5mfp3ntak3cfrq
Proceedings Fourth International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region
In this paper, we present a taxonomy for parallel sorting in parallel database systems, which covers jive sorting methods: namely parallel merge-all sort. parallel binary-merge sort, parallel redistribution ... on redistribution and repartitioning are new that have not seen discussed in the literature of parallel external sorting. ... A Taxonomy of Parallel External Sort We present five parallel external sort for parallel database systems. ...doi:10.1109/hpc.2000.843555 fatcat:cxnjsyfs6vdf3pbom33kdzcpem
A new approach called Web Supported Query Taxonomy Classifier is introduced in this paper, which generates better searching results. ... In this paper, Query categorization will build bridging classifier in an offline mode at mediator taxonomy integrated with the category selection method for the effectiveness and efficiency of online classification ... In target taxonomy we want query processor to issue many web searches concurrently without overhead of a parallel query processor. ...doi:10.5120/8226-1665 fatcat:h55p3qjw3narhgo5yxnbgosnae
The sort taxonomy is used to specify the well-sorted expressions in a many sorted logic, i.e., to specify the logic description language for a particular domain model. ... The sort taxonomy, as well as the sorts of the predicates arguments are constructed automatically on the basis of facts inputted by the user. ...
This paper deals with the visual representation of a particular kind of structured data: trees where each node is associated with an object (leaf node) of a taxonomy. ... We introduce a new visualization technique that we call Trees In A Treemap. In this visualization edges can either be drawn as straight or orthogonal edges. ... ACKNOWLEDGMENTS Peter Weißgerber gave helpful comments on earlier revisions of this paper. Moreover, he implemented the mining of the SWT sequence rules. ...doi:10.1117/12.643272 dblp:conf/vda/Burch006 fatcat:e3u6zn66gnbjbg2dllgwsixy3e
“We present a taxonomy of languages for multiparty interaction that covers all proposals of which we are aware. ... Sorting networks are theoretically and pedagogically important since they provide insight into complexity issues and the limits of parallel algorithm performance. ...
Finally, we compare the taxonomy to other motive organizations. Lessons from the big five. The Big Five is a comprehensive hierarchical taxonomy of personality traits. ... A major success in personality has been the development of a consensual structure of traits. ... Maslow's hierarchy of needs. There are a number of parallels between Maslow's theoretical classifications of human motivators [8, 60] and our taxonomy. ...doi:10.1371/journal.pone.0172279 pmid:28231252 pmcid:PMC5322894 fatcat:fo2lwigzjfgnfbi3mr2q6vkqwi
In this we present an efficient solution for eliminating false positives in intrusion detection systems using a parallelized version of Genetic Algorithm. ... The complexity of this algorithm is O((N/B) log M/B N 1/3 /3 + N 1/ 3 ) which is very much lesser when compared to other sorting algorithms. ... Cache oblivious sorting is a parallel sorting algorithm requiring at least N 1/3 processors where N is the number of elements. ...doi:10.5120/235-389 fatcat:xguxiskwxjgfrlf43dmryxukka
It is obviously time-saving because it avoids the burdens of taxonomy. However, evaluations of parataxonomic sorting by taxonomic resorting show many overestimations of species numbers. ... Parataxonomic sorting of samples to recognizable taxonomic units (RTUs, morphospecies, morphotypes or, as proposed here: parataxonomic units [PUs]) is generally considered to be a sufficiently reliable ... Such a parallel (pseudo-)system would avoid the time-consuming burdens of taxonomy, but would create a much more severe burden in a much shorter time: Since the PUs are not described and not named according ...doi:10.1023/b:bioc.0000011727.53780.63 fatcat:ujhi7xgw6jhozmyb5e5g2nazua
To optimize query performance for the database, we present a twolevel index scheme that yields speedups of 8.4 ⇥ 74⇥ over a conventional hash table index. ... We present a novel metagenomic analysis pipeline that leverages emerging large address space compute nodes with NVRAM to hold a searchable, memory-mapped "k-mer" database of all known genomes and their ... These files can be stored on any conventional file system, though use of a parallel file system is suitable for the workflow stages running parallel tasks. ...doi:10.1109/ipdpsw.2014.200 dblp:conf/ipps/AmesAHLG14 fatcat:3cwkxgr5cvhzbanjmfbrq4uwt4
a broader view of the "microbiome data space". ... How to precisely and efficiently decipher large-scale of microbiome data and furtherly take advantages from it has become one of the most essential bottlenecks for microbiome research at present. ... Acknowledgement XS acknowledges support of grants 31771463 from National Natural Science Foundation of China. ...doi:10.1016/j.csbj.2020.07.020 pmid:32802279 pmcid:PMC7419250 fatcat:dwtu45xyhzfkhjffdi66op5e3m
, an existing taxonomy of the products. ... We run experiments on a sample of users and provide results including some sample recommendations generated by our parallel algorithm. ... Sorting the affinities can give a ranked list of products that the user has interests in. A path is a list of nodes from the root to the item in a taxonomy. ...doi:10.5281/zenodo.3735337 fatcat:eecvugs5fzektafkxsb6yoggrm
The first four levels constitute a sort of reorganization of the six levels in Bloom's taxonomy, whereas the addition of levels for metacognition (i.e., the metacognitive system) and motivation (i.e., ... Psychomotor proce- dures were not addressed in Bloom's taxonomy, although the authors had intended to address the psychomotor domain in a parallel volume. ...
In this article, we present an updated overview of discretization techniques in conjunction with a complete taxonomy of the leading discretizers. ... The purpose of this article is twofold: a comprehensive taxonomy of discretization techniques to help the practitioners in the use of the algorithms is presented; the article aims is to demonstrate that ... and to build a useful taxonomy. ...doi:10.1002/widm.1173 fatcat:p4j6j24oondubd3aubhthrawcy
As a model of such an integration, changes are proposed to Data Structures and Design and Analysis of Algorithms. ... We examine how parallel and distributed computing concepts can be incorporated across the breadth of the undergraduate curriculum. ... speedup, trade offs Task Graphs C Introduce decomposition, dependencies and pipelines Divide and conquer A Merge Sort, Naive multithreaded and Strassen's matrix multiply Sorting A Parallel Merge ...doi:10.1109/ipdpsw.2012.165 dblp:conf/ipps/Dhawan12 fatcat:dqc3a2fnvvdvhpdznoqsu6jwra
« Previous Showing results 1 — 15 out of 39,498 results