This paper introduces an efficient sorting algorithm that uses new models of receptors and neurons which apply the time-conditional approach characteristic for nervous systems. These models have been successfully appl...
详细信息
ISBN:
(纸本)9783319590639;9783319590622
This paper introduces an efficient sorting algorithm that uses new models of receptors and neurons which apply the time-conditional approach characteristic for nervous systems. These models have been successfully applied to automatically construct neural graphs that consolidate representation of all sorted objects and relations between them. The introduced parallely working algorithm sorts objects simultaneously for all attributes constructing an active associative neural graph representing all sorted objects in linear time. The sequential version works in linear or sub-linearithmic time. The paper argues that neurons can be used for efficient sorting of objects and the constructed network can be further used to explore relationships between these objects.
Power consumption is one of the most important challenges facing the exascale computing community. Current technology trends will not provide a reasonable power budget for the next generation of exascale supercomputer...
详细信息
ISBN:
(纸本)9781538664070
Power consumption is one of the most important challenges facing the exascale computing community. Current technology trends will not provide a reasonable power budget for the next generation of exascale supercomputers in near future. Finding new ways to improve power efficiency will become a major challenge to exascale computing researchers. This study was motivated by the idea that some algorithms may have power advantages that need to be identified for exascale systems. In this work, we compared the power efficiency of a basic mergesort to the classically optimized 3-way partitioning quicksort. We measured the variations of average power between the two sorts that result from running different types of workloads for each algorithm. The study showed that empirical evidence suggests a generic mergesort has some power efficiency advantage over the 3-way partitioning quicksort.
Re-ranking algorithms have been proposed to improve the effectiveness of content-based image retrieval systems by exploiting contextual information encoded in distance measures and ranked lists. In this paper, we show...
详细信息
Re-ranking algorithms have been proposed to improve the effectiveness of content-based image retrieval systems by exploiting contextual information encoded in distance measures and ranked lists. In this paper, we show how we improved the efficiency of one of these algorithms, called Contextual Spaces Re-Ranking (CSRR). One of our approaches consists in parallelizing the algorithm with OpenCL to use the central and graphics processing units of an accelerated processing unit. The other is to modify the algorithm to a version that, when compared with the original CSRR, not only reduces the total running time of our implementations by a median of 1.6x but also increases the accuracy score in most of our test cases. Combining both parallelization and algorithm modification results in a median speedup of 5.4x from the original serial CSRR to the parallelized modified version. Different implementations for CSRR's Re-sort Ranked Lists step were explored as well, providing insights into graphics processing unit sorting, the performance impact of image descriptors, and the trade-offs between effectiveness and efficiency. Copyright (c) 2016 John Wiley & Sons, Ltd.
The vertically-parallel method for sorting one-dimensional arrays of numbers has been developed. The graph of the algorithm for vertically-parallel sorting of arrays has been built. The structure of the hardware for v...
详细信息
The vertically-parallel method for sorting one-dimensional arrays of numbers has been developed. The graph of the algorithm for vertically-parallel sorting of arrays has been built. The structure of the hardware for vertically-parallel sorting of one-dimensional arrays of large numbers has been designed. Components of the device for vertically-parallel sorting of arrays of numbers using FPGA have been implemented.
This paper offers an exercise for revisiting the main sorting algorithms after they have been taught to students. This is done in a way that emphasizes the relationships between them, and shows how considering abstrac...
详细信息
ISBN:
(纸本)9781450305006
This paper offers an exercise for revisiting the main sorting algorithms after they have been taught to students. This is done in a way that emphasizes the relationships between them, and shows how considering abstraction and extreme cases can lead to the generation of new algorithms. A number of authors (including textbook authors) have noted particular relationships between algorithms, such as an uneven split in merge sort being equivalent to insertion sort. In this paper we use a flexible priority queue, the d-heap, to derive three common sorting algorithms. We combine this with using a BST as a priority queue, plus prior observations in the literature, to show strong relationships between the main sorting algorithms that appear in textbooks. In the process students are able to revisit a number of algorithms and data structures and explore elegant relationships between them. This approach can also lead to exercises and exam questions that go beyond desk-checking to evaluate students' understanding of these algorithms.
NASA Technical Reports Server (Ntrs) 19920001075: on the Suitability of the Connection MacHine for Direct Particle Simulation by NASA Technical Reports Server (Ntrs); published by
NASA Technical Reports Server (Ntrs) 19920001075: on the Suitability of the Connection MacHine for Direct Particle Simulation by NASA Technical Reports Server (Ntrs); published by
NASA Technical Reports Server (Ntrs) 20000114845: Parallel Implementation of a High Order Implicit Collocation Method for the Heat Equation by NASA Technical Reports Server (Ntrs); published by
NASA Technical Reports Server (Ntrs) 20000114845: Parallel Implementation of a High Order Implicit Collocation Method for the Heat Equation by NASA Technical Reports Server (Ntrs); published by
Re-ranking algorithms have been proposed to improve the effectiveness of content-based image retrieval systems by exploiting contextual information encoded in distance measures and ranked lists. In this paper, we show...
详细信息
Re-ranking algorithms have been proposed to improve the effectiveness of content-based image retrieval systems by exploiting contextual information encoded in distance measures and ranked lists. In this paper, we show how we improved the efficiency of one of these algorithms, called Contextual Spaces Re-Ranking (CSRR). One of our approaches consists in parallelizing the algorithm with OpenCL to use the central and graphics processing units of an accelerated processing unit. The other is to modify the algorithm to a version that, when compared with the original CSRR, not only reduces the total running time of our implementations by a median of 1.6x but also increases the accuracy score in most of our test cases. Combining both parallelization and algorithm modification results in a median speedup of 5.4x from the original serial CSRR to the parallelized modified version. Different implementations for CSRR's Re-sort Ranked Lists step were explored as well, providing insights into graphics processing unit sorting, the performance impact of image descriptors, and the trade-offs between effectiveness and efficiency. Copyright (c) 2016 John Wiley & Sons, Ltd.
NASA Technical Reports Server (Ntrs) 20160005867: Fixing Dataset Search by NASA Technical Reports Server (Ntrs); NASA Technical Reports Server (Ntrs); published by
NASA Technical Reports Server (Ntrs) 20160005867: Fixing Dataset Search by NASA Technical Reports Server (Ntrs); NASA Technical Reports Server (Ntrs); published by
NASA Technical Reports Server (Ntrs) 20150000362: Global Assessment of Omi Aerosol Single-Scattering Albedo Using Ground-Based Aeronet and Skynet Inversions by NASA Technical Reports Server (Ntrs); NASA Technical Repo...
详细信息
NASA Technical Reports Server (Ntrs) 20150000362: Global Assessment of Omi Aerosol Single-Scattering Albedo Using Ground-Based Aeronet and Skynet Inversions by NASA Technical Reports Server (Ntrs); NASA Technical Reports Server (Ntrs); published by
暂无评论