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

26th International Conference on Computer and Information Technology, ICCIT 2023

作者： Disha, Dilara Yasmin Mondal, Md. Nazrul Islam Rajshahi University of Engineering & Technology Departmentof Computer Science and Engineering Rajshahi6240 Bangladesh

ISBN: (纸本)9798350359015

sorting algorithms are fundamental in various computing *** this paper, we introduce a CUDA-based acceleration of the Timsort algorithm, leveraging the parallel processing of GPUs. Our implementation strategically decomposes the sorting process into parallel tasks, effectively surmounting inherent challenges related to synchronization and load balancing. Our experimental findings reveal a substantial speedup compared to CPU-based Timsort implementations. This acceleration renders our approach highly promising for real-world applications. Notably, our results demonstrate that the Timsort algorithm achieves a remarkable speed enhancement ranging from 22x to 48x when employing CUDA, relative to CPU-based executions, across diverse dataset sizes. These findings underscore the efficacy and applicability of our CUDA-accelerated Timsort in addressing the growing demand for faster sorting algorithms in contemporary computing scenarios. © 2023 IEEE.

关键词： CUDA GPU Parallel Processing sorting algorithm Timsort

来源：评论

学校读者我要写书评

暂无评论

A Smart, Data-Driven Approach to Qualify Additively Manufactured Steel Samples for Print-Parameter-Based Imperfections

引用

MATERIALS 2024年第11期17卷 2513页

作者： Alaparthi, Suresh Subadra, Sharath P. Sheikhi, Shahram Univ Appl Sci Hamburg Inst Mat Sci & Joining Technol Berliner Tor 13 D-20099 Hamburg Germany Univ Appl Sci Hamburg Forschungs & Transferzentrum 3i Berliner Tor 13 D-20099 Hamburg Germany

With additive manufacturing (AM) processes such as Wire Arc Additive Manufacturing (WAAM), components with complex shapes or with functional properties can be produced, with advantages in the areas of resource conservation, lightweight construction, and load-optimized production. However, proving component quality is a challenge because it is not possible to produce 100% defect-free components. In addition to this, statistically determined fluctuations in the wire quality, gas flow, and their interaction with process parameters result in a quality of the components that is not 100% reproducible. Complex testing procedures are therefore required to demonstrate the quality of the components, which are not cost-effective and lead to less efficiency. As part of the project "3DPrintFEM", a sound emission analysis is used to evaluate the quality of AM components. Within the scope of the project, an approach was being developed to determine the quality of an AM part dependent not necessarily on its geometry. Samples were produced from WAAM, which were later cut and milled to precision. To determine the frequencies, the samples were put through a resonant frequency test (RFM). The unwanted modes were then removed from the spectrum produced by the experiments by comparing it with FEM simulations. Later, defects were introduced in experimental samples in compliance with the ISO 5817 guidelines. In order to create a database of frequencies related to the degree of the sample defect, they were subjected to RFM. The database was further augmented through frequencies from simulations performed on samples with similar geometries, and, hence, a training set was generated for an algorithm. A machine-learning algorithm based on regression modelling was trained based on the database to sort samples according to the degree of flaws in them. The algorithm's detectability was evaluated using samples that had a known level of flaws which forms the test dataset. Based on the outcome, the a

关键词： additive manufacturing gas metal arc welding microstructure porosity defects quality non-destructive testing acoustics data acquisition sorting algorithm

来源：评论

学校读者我要写书评

暂无评论

FCI: Feature Cross and User Interest Network 1

引用

10th CCF Big Data Conference (BigData)

作者： Lei, Dejun Southwest Petr Univ Sch Comp Sci 8 Xindu Ave Chengdu 610599 Sichuan Peoples R China

ISBN: (数字)9789811983313

ISBN: (纸本)9789811983306;9789811983313

Recommendation systems are widely used on Internet platforms and the Recommendation system is one of the most mature scenarios for data mining applications. Ranking algorithms in recommender systems are the most effective means to increase user clicks. At present, the recommendation system ranking algorithm is mainly divided into two categories. One is based on data mining, such as user features, product features, and scene features and crosses these functions manually or automatically. The second method, by mining the user's behavior sequence, obtains the user's interests and displays the product to the user. The first approach does not mine useful behavioral data. The second method cannot effectively perform feature crossover and loses some crossover information between users and products. This paper proposes a new ranking method for recommender systems. Feature Cross and User Interest Network FCI. It can efficiently and automatically discover cross features based on users, products, and scenarios. At the same time, mining the historical behavior information of users. In this algorithm, firstly our put-forward model resembles a wide-depth structure. Wide structure puts feature intersection network, deep structure puts user historical behavior mining network. Secondly experimental comparisons are made by changing different feature intersection networks and user behavior sequence networks. Finally, by adding the pre-training vector of the product, compare different pre-training methods. This approach greatly improves the CTR in practical recommender systems.

关键词： Recommended system Behavior mining Feature-cross sorting algorithm Recommendation model

来源：评论

学校读者我要写书评

暂无评论

A Wireless Mesh Multipath Routing Protocol Based on sorting Ant Colony algorithm

引用

Procedia Computer Science 2020年 166卷 570-575页

作者： Qi Qian Li Yi Peng School of Information Engineering and Automation Kunming University of Science and Technology Kunming 650500 China

In this paper, the traditional ant colony algorithm has a slow convergence rate for routing optimization of Mesh networks. A multi-path routing protocol based on improved ant colony algorithm, Fortified Ant protocol, is proposed. The protocol first adds a sorting algorithm based on the ant colony algorithm, and introduces the concept of elite ants to improve the speed of routing optimization. Secondly, this paper also studies the multipath transmission of self-organizing networks. The simulation results show that compared with ADOV, DSR and AOC routing algorithms, the algorithm can quickly find multiple paths with better quality, with fast convergence and overhead. Less advantage.

关键词： Wireless Mesh network Ant colony algorithm sorting algorithm Multipath routing Fortified Ant

来源：评论

学校读者我要写书评

暂无评论

High-performance genome sorting program 10

High-performance genome sorting program

引用

10th International Young Scientists Conference in Computational Science (YSC)

作者： Kasilov, Vasily Drobintsev, Pavel Voinov, Nikita Peter Great St Petersburg Polytech Univ Polytech Skaya 29 St Petersburg 195251 Russia

This paper is devoted to the practical application of parallel sorting algorithms and parallel input-output methods for the problem of genome alignment. The paper considers different approaches to the implementation of such algorithms, taking into account the capabilities of high-performance systems. Main purpose of the work is to develop a genome sorting program, the efficiency of which significantly exceeds the efficiency of free software analogues. The genome sorting program is implemented for a supercomputer using the C++ language and the OpenMP and OpenMPI. The developed program demonstrates a significant increase in the speed of operation (up to 10 times) compared to free software analogues due to massive parallel data input and output. Different approaches for data input/output parallelization and data processing considered in the paper can be applied in other subject areas. (C) 2021 The Authors. Published by Elsevier B.V.

关键词： genome sorting algorithm alignment BAM and SAM files OpenMP HPC

来源：评论

学校读者我要写书评

暂无评论

Redesigning the sorting Engine for Persistent Memory 26th

Redesigning the Sorting Engine for Persistent Memory

引用

26th International Conference on Database Systems for Advanced Applications (DASFAA)

作者： Hua, Yifan Huang, Kaixin Zheng, Shengan Huang, Linpeng Shanghai Jiao Tong Univ Shanghai Peoples R China Tsinghua Univ Beijing Peoples R China

ISBN: (纸本)9783030731991;9783030732004

Emerging persistent memory (PM, also termed as nonvolatile memory) technologies can promise large capacity, non-volatility, byte-addressability and DRAM-comparable access latency. Such amazing features have inspired a host of PM-based storage systems and applications that store and access data directly in PM. sorting is an important function for many systems, but how to optimize sorting for PM-based systems has not been systematically studied yet. In this paper, we conduct extensive experiments for many existing sorting methods, including both conventional sorting algorithms adapted for PM and recently-proposed PM-friendly sorting techniques, on a real PM platform. The results indicate that these sorting methods all have drawbacks for various workloads. Some of the results are even counterintuitive compared to running on a DRAM-simulated platform in their papers. To the best of our knowledge, we are the first to perform a systematic study on the sorting issue for persistent memory. Based on our study, we propose an adaptive sorting engine, namely SmartSort, to optimize the sorting performance for different conditions. The experimental results demonstrate that SmartSort remarkably outperforms existing sorting methods in a variety of cases.

关键词： Persistent memory sorting algorithm Pointer-indirect Wear-leveling

来源：评论

学校读者我要写书评

暂无评论

Engineering faster sorters for small sets of items

引用

SOFTWARE-PRACTICE & EXPERIENCE 2021年第5期51卷 965-1004页

作者： Bingmann, Timo Marianczuk, Jasper Sanders, Peter Karlsruhe Inst Technol Inst Theoret Informat Fasanengarten 5 D-76131 Karlsruhe Germany

sorting a set of items is a task that can be useful by itself or as a building block for more complex operations. That is why a lot of effort has been put into finding sorting algorithms that sort large sets as efficiently as possible. But the more sophisticated and complex the algorithms become, the less efficient they are for small sets of items due to large constant factors. A relatively simple sorting algorithm that is often used as a base case sorter is insertion sort, because it has small code size and small constant factors influencing its execution time. We aim to determine if there is a faster way to sort small sets of items to provide an efficient base case sorter. We looked at sorting networks, at how they can improve the speed of sorting few elements, and how to implement them in an efficient manner using conditional moves. Since sorting networks need to be implemented explicitly for each set size, providing networks for larger sizes becomes less efficient due to increased code sizes. To also enable the sorting of slightly larger base cases, we adapted sample sort to Register Sample Sort, to break down those larger sets into sizes that can in turn be sorted by sorting networks. From our experiments we found that when sorting only small sets of integers, the sorting networks outperform insertion sort by a factor of at least 1.76 for any array size between six and 16, and by a factor of 2.72 on average across all machines and array sizes. When integrating sorting networks as a base case sorter into Quicksort, we achieved far less performance improvements over using insertion sort, which is probably due to the networks having a larger code size and cluttering the L1 instruction cache. The same effect occurs when including Register Sample Sort as a base case sorter for IPS4o. But for x86 machines that have a larger L1 instruction cache of 64 KiB or more, we obtained speedups of 12.7% when using sorting networks as a base case sorter in std::sort, and of 5%-6

关键词： base case sorting sample sort sorter sorting sorting algorithm sorting networks

来源：评论

学校读者我要写书评

暂无评论

Direct AC charging of EV Reconfigurable Cascaded Multilevel Converter

Direct AC charging of EV Reconfigurable Cascaded Multilevel ...

引用

14th Annual IEEE Energy Conversion Congress and Exposition (IEEE ECCE) / IEEE-Industry-Applications-Society (IEEE-IAS) Annual Meeting

作者： Tresca, Giulia Formentini, Andrea Granata, Samuele Leuzzi, Riccardo Zanchetta, Pericle Elect Comp & Biomed Engn Dept Pavia Italy Elect Elect Telecommun Engn & Naval Architect Dep Genoa Italy Elect & Elect Engn Dept Nottingham England

ISBN: (数字)9781728193878

ISBN: (纸本)9781728193878

This paper presents the Reconfigurable Cascaded Multilevel Converter (RCMC), employed for EV powertrain applications, in charging configuration. The converter is directly connected to an AC three-phase power system and the battery modules are charged by dynamically controlling the reconfigurable battery modules. The intrinsic structure of the converter gives the advantage to implement different charging algorithms, according to customizable requirements, without the need of extra middle power stages. Two charging methods are proposed and explained in detail: the first one prioritizes the SOC balancing between the battery modules, the second one the power losses reduction. Finally, a charging time estimation is computed for the RCMC and for a classic battery pack, assuming to increase their initial state of charge of 20%. The computation results show that the Reconfigurable Cascaded Multilevel Converter requires 40% less time than the battery pack.

关键词： AC Charging Charging Time Electric Vehicle Filter design Multilevel converter Reconfigurable Cascaded Multilevel Converter sorting algorithm

来源：评论

学校读者我要写书评

暂无评论

Design and control of battery charger for electric vehicles using modular multilevel converters

引用

IET POWER ELECTRONICS 2021年第1期14卷 140-157页

作者： Quraan, Mahran Abu-Khaizaran, Muhammad Sa'ed, Jaser Hashlamoun, Wael Tricoli, Pietro Birzeit Univ Dept Elect & Comp Engn Ramallah Palestine Univ Birmingham Sch Elect Elect & Syst Engn Birmingham W Midlands England

Double-star modular multilevel converters with embedded battery cells are a ground breaking technology for the power converter of electric vehicles. In this topology, the battery cells are connected in series via half bridge DC-DC buck converter and can be independently discharged and recharged. This paper proposes a novel control system for this converter topology that can charge the battery cells from the grid at unity power factor and instantaneously balance them in terms of their state of charges without affecting the grid voltages and currents. The grid current controller is designed and implemented in the stationary reference frame using a proportional-resonant controller, while the state of charge balancing algorithm is designed using sorting algorithm and circulating current control. The simulation and experimental results have demonstrated that the proposed control strategy can effectively charge the battery cells with a negligible distortion of the grid current and can ensure the balance of cells during the recharge without affecting the grid current.

关键词： power converter power factor electric vehicles double-star modular multilevel converters Control of electric power systems novel control system proportional-resonant controller unity power factor control strategy sorting algorithm half bridge DC-DC buck converter embedded battery cells grid voltages Current control DC-DC power convertors power grids Transportation electric current control power convertors charge balancing algorithm circulating current control Power convertors and power supplies to apparatus battery chargers battery charger converter topology grid current controller Power electronics, supply and supervisory circuits

来源：评论

学校读者我要写书评

暂无评论

B*-Sort: Enabling Write-Once sorting for Nonvolatile Memory

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2020年第12期39卷 4549-4562页

作者： Liang, Yu-Pei Chen, Tseng-Yi Chang, Yuan-Hao Chen, Shuo-Han Wei, Hsin-Wen Shih, Wei-Kuan Natl Tsing Hua Univ Dept Comp Sci Hsinchu 300 Taiwan Acad Sinica Inst Informat Sci Taipei 115 Taiwan Natl Cent Univ Taoyuan 320 Taiwan Natl Cent Univ Dept Comp Sci & Informat Engn Taoyuan 32001 Taiwan Tamkang Univ Dept Elect Engn New Taipei 251 Taiwan

Nonvolatile random access memory (NVRAM) has been regarding a promising technology to replace DRAM as the main memory in embedded systems owing to its nonvolatility and low idle power consumption. However, due to the asymmetric read/write costs and limited lifetime of NVRAM, most of the existing fundamental algorithms are not NVRAM-friendly with their write pattern and write intensiveness. Thus, existing fundamental algorithms for NVRAM embedded devices has been revealed. For instance, as the sorting algorithm is one of the most fundamental algorithms, most of the existing sorting algorithms are not NVRAM-friendly because they impose heavy write traffic [i.e., O(n lg n)] on main memory, where n is the number of unsorted elements. To resolve this issue, this article proposes a write-once sorting algorithm, namely B*-sort, to reduce the amount of write traffic on NVRAM-based main memory. B*sort adopts a brand-new concept, i.e., tree-based sort, inspired by the binary-search-tree structure to achieve the write-once property which can guarantee the optimal endurance during the sorting process. According to the experimental results, B*-sort can achieve significant performance improvement for sorting on NVRAM-based systems.

关键词： Nonvolatile memory read write asymmetry sorting algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：