检索结果-内蒙古大学图书馆

FLiMS: A Fast Lightweight 2-Way Merger for sorting

IEEE TRANSACTIONS ON COMPUTERS 2022年第12期71卷 3215-3226页

作者： Papaphilippou, Philippos Luk, Wayne Brooks, Chris Imperial Coll London Dept Comp London SW7 2BX England Dunnhumby Sci Innovat London W6 7NL England

In this paper, we present FLiMS, a highly-efficient and simple parallel algorithm for merging two sorted lists residing in banked and/or wide memory. On FPGAs, its implementation uses fewer hardware resources than the state-of-the-art alternatives, due to the reduced number of comparators and elimination of redundant logic found on prior attempts. In combination with the distributed nature of the selector stage, a higher performance is achieved for the same amount of parallelism or higher. This is useful in many applications such as in parallel merge trees to achieve high-throughput sorting, where the resource utilisation of the merger is critical for building large trees and internalising the workload for fast computation. Also presented are efficient variations of FLiMS for optimizing throughput for skewed datasets, achieving stable sorting or using fewer dequeue signals. Additionally, FLiMS is shown to perform well as conventional software on modern CPUs supporting single-instruction multiple-data (SIMD) instructions, surpassing the performance of some standard libraries for sorting.

关键词： high-throughput parallel merger merge tree sorting algorithms sorting networks SIMD databases FPGA

来源：评论

学校读者我要写书评

暂无评论

An ASIC design and formal analysis of a novel pipelined and parallel sorting accelerator

引用

INTEGRATION-THE VLSI JOURNAL 2008年第1期41卷 65-75页

作者： Tabrizi, Nozar Bagherzadeh, Nader Kettering Univ Dept Elect & Comp Engn Flint MI 48504 USA Univ Calif Irvine Dept Elect Engn & Comp Sci Irvine CA 92697 USA

sorting, which is widely used in different areas such as database systems, IP routing, bio informatics, and cognitive-processing-based applications, imposes considerable overhead on computing resources. Therefore, an efficient on-chip sorting accelerator may significantly enhance real-time decision-making in such applications. In this paper we introduce a novel pipelined and parallel sorting algorithm with streaming I/O, with the time, logic, and memory complexity of O(n), O(root n), and O(n), respectively. We present a formal analysis to prove the correctness of this algorithm. We then model, verify, and synthesize this unconditional algorithm (in the TSMC 0.13 micron technology) for 4k-word clusters as an ASIC accelerating engine. More specifically, our implementation with 3969-word multiple-bank memory, 63 word-size comparators, 64 word-size multiplexers, and 63 word-size registers only requires some 8k clock cycles to sort an arbitrary 3969-word long array of random data, which arrive at the sorter and also depart it one item at a time. (C) 2007 Elsevier B.V. All rights reserved.

关键词： ASIC design multiprocessor-on-a-chip sorting accelerators sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

A SELECT AND INSERT sorting ALGORITHM

引用

BIT 1988年第4期28卷 726-735页

作者： BECK, I KROGDAHL, S HAIFA UNIV DEPT MATH & COMP SCIIL-31999 HAIFAISRAEL UNIV OSLO DEPT INFORMATN-0316 OSLO 3NORWAY

A general sorting algorithm, having the well knownO(n 2) algorithmsStraight Insertion Sort andSelection Sort as special cases, is described. This algorithm is analyzed in the case that certain choices in the algorithm... 详细信息

A general sorting algorithm, having the well knownO(n ²) algorithmsStraight Insertion Sort andSelection Sort as special cases, is described. This algorithm is analyzed in the case that certain choices in the algorithm are done randomly, and this yields an algorithm that has an average complexity ofO(n ^1.5) and a worst case complexity ofO(n ²). However, making random choices (by some random number generator) is time consuming, and a simple “quasi-random” scheme is therefore implemented. Test runs indicate that also this version has average complexity ofO(n ^1.5), and it even seems to perform better than the version using real random choices (even if we disregard the time used for the random choices). This version also needs very little administrative overhead, and it therefore compares favourably to many other sorting algorithms for small and medium sized arrays.

关键词： F.2.2 G.2.1 sorting algorithms complexity analysis

来源：评论

学校读者我要写书评

暂无评论

A New Modified sorting Algorithm: A Comparison with State of the Art 6

A New Modified Sorting Algorithm: A Comparison with State of...

引用

6th Mediterranean Conference on Embedded Computing (MECO)

作者： Idrizi, Florim Rustemi, Avni Dalipi, Fisnik Tetovo Univ Dept Informat Tetovo Macedonia Linnaeus Univ Dept Comp Sci Vaxjo Sweden

ISBN: (纸本)9781509067428

Choosing the right method to sort numbers has a huge effect on how quickly a computer can process a task The most used sorting algorithms today have been discovered years ago, and to this day, they have been the best for the job as there was no other competitive algorithm. Through this paper, we make an analysis and comparison between the state of the art algorithms in sorting and based on their analogy of functionality, we propose a new modified sorting algorithm. We then present a brief description of the new modified algorithm, conduct comparisons with the state of the art, and finally we give conclusions about the performance of the proposed algorithm versus the most popular sorting algorithms. Moreover, we highlight the benefits of using this algorithm in different fields by various business companies or software developers, in cases when they need faster and easier sorting for their data management.

关键词： sorting algorithms comparison and analyses state of the art experimental setup implementation

来源：评论

学校读者我要写书评

暂无评论

Vertically-parallel method and VLSI-structure for sorting of one-dimensional arrays 13

Vertically-parallel method and VLSI-structure for sorting of...

引用

13th IEEE International Scientific and Technical Conference on Computer Sciences and Information Technologies (CSIT)

作者： Tsmots, Ivan Skorokhoda, Oleksa Antoniv, Volodymyr Rabyk, Vasyl Lviv Polytech Natl Univ Dept Automated Control Syst Lvov Ukraine Ivan Franko Natl Univ Lviv Dept Radio Phys & Comp Technol Lvov Ukraine

ISBN: (纸本)9781538664636

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.

关键词： sorting algorithms vertically-parallel calculations VLSI FPGA hardware implementation

来源：评论

学校读者我要写书评

暂无评论

Experience and Guidelines for sorting Algorithm Choices and Their Energy Efficiency 22

Experience and Guidelines for Sorting Algorithm Choices and ...

引用

13th Annual ACM/SPEC International Conference on Performance Engineering (ICPE)

作者： Meissner, Maximilian Kamthania, Supriya Rawtani, Nishant Bucek, James Lange, Klaus-Dieter Kounev, Samuel Univ Wurzburg Wurzburg Germany Hewlett Packard Enterprise Bangalore Karnataka India

ISBN: (纸本)9781450391597

Energy efficiency has become a major concern in the IT sector as the energy demand for data centers is projected to reach 1PWh per year by 2030. While hardware designers improve the energy efficiency of their products, software developers often do not consider or are unaware of the impact their design choices can make on the energy consumption caused by the execution of their applications. Energy efficiency improvements in applications can, to a certain extent, be achieved through compiler optimizations. Nonetheless, software developers should still make reasonable design choices to improve energy efficiency further. In this paper, we present the energy efficiency of common sorting algorithms under different pre-sorted conditions. Previous work in this field considered only randomized data. We expand on this previous work and measure the sorting algorithms' energy efficiency when the data is already partially sorted to 20% and 50%. Our presented experience is a case study intended to demonstrate the effect simple design choices, such as the selection of algorithm as well as its implementation, can make on energy efficiency. It is intended for industry practitioners to aid them in selecting a more energy-efficient algorithm for their problems at hand through helpful guidelines. Our results also can function as an incentive to make energy efficiency a non-functional requirement for tenders, and as a motivation for researchers to include energy efficiency as an additional quality criterion when studying the properties of algorithms.

关键词： Energy Efficiency Software Energy Efficiency Cloud Data Center Green Computing Performance sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

SmartSort Visualizer: Interactive Tool for Optimal Data sorting and Algorithm Recommendation 8

SmartSort Visualizer: Interactive Tool for Optimal Data Sort...

引用

8th IEEE International Conference on Computational System and Information Technology for Sustainable Solutions, CSITSS 2024

作者： Vankayala, Shilpita Shrivastava, Harsda Borikar, Jiya Kanisettypalli, Lohitha Vineetha, K.V. Ullas, S. Amrita School of Computing Amrita Vishwa Vidyapeetham Dept. of Computer Science & Engineering Bengaluru India

ISBN: (纸本)9798331505462

SmartSort Visualizer, integrating Data Structures and algorithms with Java, offers a tool for sorting and algorithm analysis. Users can choose from various algorithms, including Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Radix Sort, Heap Sort, Shell Sort, and Quick Sort, to visualize the sorting process for integers, doubles, and strings. It operates in two modes: sorting Visualization, which shows how algorithms sort data in ascending or descending order, and Optimal sorting Method, which recommends the best algorithm based on performance metrics. This paper introduces a novel sorting recommendation system that evaluates the efficiency of algorithms in real-time, offering the best option for both ascending and descending orders. © 2024 IEEE.

关键词： Best algorithm Execution time sorting algorithms Space Complexity Time complexity Visualization

来源：评论

学校读者我要写书评

暂无评论

Revolutionizing Raisin Processing through Advanced sorting and Visualization with a Deep Learning Based Support Vector Machine Model

Revolutionizing Raisin Processing through Advanced Sorting a...

引用

2024 Asia Pacific Conference on Innovation in Technology, APCIT 2024

作者： Agrawal, Jhalak Singh Gill, Kanwarpartap Chauhan, Rahul Singh Pokhariya, Hemant Chythanya, Kanegonda Ravi Chitkara University Institute of Engineering and Technology Chitkara University Punjab India Graphic Era Hill University Computer Science & Engineering Uttarakhand Dehradun248002 India Graphic Era Deemed to Be University Computer Science & Engineering Uttarakhand Dehradun248002 India SR University School of Computer Science & Artificial Intelligence Warangal India

ISBN: (纸本)9798350361537

By using a Deep Learning-Based Support Vector Machine (SVM) model, this work presents a novel method for the sorting and visualisation of raisins. A vital component of the agricultural sector, the processing of raisins, has historically relied on labour-intensive, human error-prone manual sorting techniques. The suggested approach makes use of deep learning to improve this process' accuracy and efficiency. The Raisins dataset in the form of two classes namely Besni and Kecimen which is extracted from the Kaggle open source environment or platform, is pre-processed using the SVM model and the model is further designed accordingly so that it may predict and accuracy of 92 %. The cultural history of raisins is extensive and rich, going all the way back to antiquity. They are utilized in many different culinary applications, such as savory meals and classic desserts. Vitamins, minerals, and dietary fibre are just a few of the essential components that are concentrated in raisins. They can be used in many dishes as a healthier alternative to processed sugars because of their natural sweetness. In the context of food processing, this work investigates the use of a deep learning-based Support Vector Machine (SVM) model for sorting and displaying raisins. The manufacturing of raisins entails complex quality control procedures that have historically relied on labour-intensive techniques. This study automates the categorization of raisins according to quality factors in an effort to improve sorting accuracy and efficiency by utilizing SVMs. Known for its resilience in classification tasks, the SVM model is used to identify intricate patterns in raisin samples, which enhances sorting accuracy. Furthermore, the research delves into the visual element, illuminating the structural features of raisins and offering valuable perspectives on quality criteria. © 2024 IEEE.

关键词： Agricultural technology Automation Deep learning Feature extraction Image recognition Information display Models for machine learning Precision farming Preparing food Quality inspection sorting algorithms Support Vector Machine (SVM)

来源：评论

学校读者我要写书评

暂无评论

A tag feedback based sorting algorithm for social search

A tag feedback based sorting algorithm for social search

引用

2012 International Conference on Systems and Informatics, ICSAI 2012

作者： Jiang, Zongli Li, Jingsheng College of Computer Science and Technology Beijing University of Technology Beijing 100124 China

ISBN: (纸本)9781467301992

The social search use social ability to participate in the screening and sorting of search results in order to make the result to tend to reflect the hopes of the people better. Based on the prototype of social search, the concept of user tag feedback scores is employed. Based on this concept, a tag-based feedback web ranking algorithm is designed. The algorithm can efficiently use the user's feedback. Finally, a variety of evaluation methods are used to analyze the search results of different sort. The experiments show that the new sorting algorithm can meet the user's real needs better. © 2012 IEEE.

关键词： feedback labels social search sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

NASA Technical Reports Server (Ntrs) 19920001759: a Fast sorting Algorithm for a Hypersonic Rarefied Flow Particle Simulation on the Connection MacHine

引用

2017年

NASA Technical Reports Server (Ntrs) 19920001759: a Fast sorting Algorithm for a Hypersonic Rarefied Flow Particle Simulation on the Connection MacHine by NASA Technical Reports Server (Ntrs); published by

关键词： (ntrs) 19920001759: algorithm algorithms computerized simulation connection dagum, leonardo hypersonic hypersonic flow massively parallel processors nasa technical reports server (ntrs) ranking rarefied gas dynamics sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：