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

AIAA Aviation Forum

作者： de Oliveira Silva, George Patton Tomita, Jesuino Takachi Bringhenti, Cleverson Aeronaut Inst Technol Turbomachines Dept BR-12228900 Sao Jose Dos Campos SP Brazil

ISBN: (数字)9781624107047

ISBN: (纸本)9781624107047

The present work investigates the effect of reordering the nodes and elements of a grid according to the Hilbert curves on the cache utilization in an in-house parallel CFD code. A sorting algorithm is proposed based on domain decomposition techniques and the execution times are compared to those obtained by the structured grid format.

关键词： CFD codes sorting algorithms Unstructured Grid Turbomachinery Navier Stokes Equations Finite Volume Method Integrated Circuits Transistors ANSYS Spalart Allmaras Turbulence Model

来源：评论

学校读者我要写书评

暂无评论

Optimizing Search and Sort algorithms: Harnessing Parallel Programming for Efficient Processing of Large Datasets 2

Optimizing Search and Sort Algorithms: Harnessing Parallel P...

引用

2nd International Conference on Automation, Computing and Renewable Systems, ICACRS 2023

作者： Maurya, Ipsit Sinha, Subhratha Suguna, M. School of Computer Science and Engineering Vellore Institute of Technology Chennai India

ISBN: (纸本)9798350340235

This research study investigates the impact of parallel programming techniques on the performance of searching and sorting algorithms. Traditional sequential algorithms have been the foundation of data processing for decades, but the increasing availability of parallel computing resources opens new possibilities for improving efficiency and reducing execution times. By leveraging parallel programming models, such as shared memory and distributed memory systems, this study explores how the parallelization of search and sort algorithms can enhance their speed and scalability. Through comprehensive experimentation and analysis, this study aims to provide valuable insights into the benefits and challenges of parallel programming in the context of searching and sorting algorithms. © 2023 IEEE.

关键词： Parallel programming Performance optimization Scalability analysis Searching algorithms sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

The λNF Problem 2nd

The λNF Problem

引用

2nd International Conference on Cybersecurity and Evolutionary Data Engineering, ICCEDE 2022

作者： Dutta, Anurag Munjal, DeepKiran Department of Computer Science and Engineering Government College of Engineering and Textile Technology Serampore India Department of Computer Applications G L Bajaj Institute of Technology and Management Greater Noida India

ISBN: (纸本)9789819950799

The Dutch National Flag problem—DNF Problem, a Computational Problem proposed by the Dutch Computer Scientist—Edsger Wybe Dijkstra—brought a new edge to the domains of sorting. In this work, we would extend Dijkstra’s Problem to a generalized version, where we would be considering flags with variable numbers of colours and will try to devise an algorithm to arrange them in a monotonic order by its magnitude. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2023.

关键词： Computational complexity Dnf sort Partitioning sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

SAPCo Sort: Optimizing Degree-Ordering for Power-Law Graphs

SAPCo Sort: Optimizing Degree-Ordering for Power-Law Graphs

引用

IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS)

作者： Esfahani, Mohsen Koohi Kilpatrick, Peter Vandierendonck, Hans Queens Univ Belfast Belfast North Ireland

ISBN: (纸本)9781665459549

We introduce the Structure-Aware Parallel Counting (SAPCo) Sort algorithm that optimizes performance of degree-ordering, a key operation in graph analytics. SAPCo leverages the skewed degree distribution to accelerate sorting. The evaluation for graphs of up to 3.6 billion vertices shows that SAPCo sort is, on average, 1.7-33.5 times faster than state-of-the-art sorting algorithms such as counting sort, radix sort, and sample sort.

关键词： High Performance Computing Graph algorithms Degree-Ordering sorting algorithms Real-World Graphs Structure-Aware algorithms

来源：评论

学校读者我要写书评

暂无评论

Parallelism exploration in sequential algorithms via animation tool

引用

MULTIAGENT AND GRID SYSTEMS 2021年第2期17卷 145-158页

作者： Qawasmeh, Ahmad Taamneh, Salah Aljammal, Ashraf H. Hamadneh, Nabhan Banikhalaf, Mustafa Kharabsheh, Mohammad Hashemite Univ Dept Comp Sci & Applicat Zarqa Jordan Yarmouk Univ Dept Comp Sci Irbid Jordan Hashemite Univ Dept Comp Informat Syst Zarqa Jordan

Different high performance techniques, such as profiling, tracing, and instrumentation, have been used to tune and enhance the performance of parallel applications. However, these techniques do not show how to explore the potential of parallelism in a given application. Animating and visualizing the execution process of a sequential algorithm provide a thorough understanding of its usage and functionality. In this work, an interactive web-based educational animation tool was developed to assist users in analyzing sequential algorithms to detect parallel regions regardless of the used parallel programming model. The tool simplifies algorithms' learning, and helps students to analyze programs efficiently. Our statistical t-test study on a sample of students showed a significant improvement in their perception of the mechanism and parallelism of applications and an increase in their willingness to learn algorithms and parallel programming.

关键词： Algorithm animation educational tool parallel programming performance analysis sorting algorithms algorithms visualization

来源：评论

学校读者我要写书评

暂无评论

sorting an array using the topological sort of a corresponding comparison graph

引用

THEORETICAL COMPUTER SCIENCE 2020年 845卷 76-97页

作者： Behera, Balaram D. Univ Calif Santa Cruz Comp Sci & Engn Dept Santa Cruz CA 95064 USA

The quest for efficient sorting is ongoing, and we will explore a graph-based stable sorting strategy, in particular employing comparison graphs. We use the topological sort to map the comparison graph to a linear domain, and we can manipulate our graph such that the resulting topological sort is the sorted array. By taking advantage of the many relations between Hamiltonian paths and topological sorts in comparison graphs, we design a Divide-and-Conquer algorithm that runs in the optimal O(n logn) time. In the process, we construct a new merge process for graphs with relevant invariant properties for our use. Furthermore, this method is more space-efficient than the famous MERGESORT since we modify our fixed graph only. (C) 2020 Elsevier B.V. All rights reserved.

关键词： Graph algorithms Topological sort sorting algorithms Comparison graphs

来源：评论

学校读者我要写书评

暂无评论

Split Trees - A Unifying Model for Many Important Random Trees of Logarithmic Height: A Brief Survey 1

引用

1st IAPR International Joint Conference on Discrete Geometry and Mathematical Morphology (DGMM)

作者： Holmgren, Cecilia Uppsala Univ Dept Math Uppsala Sweden

ISBN: (数字)9783030766573

ISBN: (纸本)9783030766566;9783030766573

Split trees were introduced by Devroye [28] as a novel approach for unifying many important random trees of logarithmic height. They are interesting not least because of their usefulness as models of sorting algorithms in computer science;for instance the well-known Quicksort algorithm (introduced by Hoare [35,36]) can be depicted as a binary search tree (which is one example of a split tree). A split tree of cardinality n is constructed by distributing n balls (which often represent data items) to a subset of nodes of an infinite tree. In [39], renewal theory was introduced by the author as a novel approach for studying split trees. This approach has proved to be highly useful for investigating such trees and has lead (often in combination with other methods) to several general results valid for all split trees. In this brief survey, we will present split trees, give an introduction to renewal theory in relation to split trees and describe some of the characteristics of split trees including results on the depths for the balls and nodes in the tree, the height (maximal depth) of the tree and the size of the tree in terms of the number of nodes;see [11,17,18,28,39]. Furthermore, we will briefly describe some of our later results for this large class of random trees, e.g. on the total path length [19], number of cuttings [12,21,38] and number of inversions (and more general permutations) [2,20] as well as on the size of the giant and other components after bond percolation [11,13].

关键词： Random trees Split trees sorting algorithms Quicksort Binary search tree Renewal theory Contraction method Limit laws Size Depths Height Total path length Inversions Cuttings Bond percolation

来源：评论

学校读者我要写书评

暂无评论

Travel Kinematics in Virtual Reality Increases Learning Efficiency

Travel Kinematics in Virtual Reality Increases Learning Effi...

引用

IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)

作者： Nersesian, Eric Vinnikov, Margarita Lee, Michael J. New Jersey Inst Technol Dept Informat Newark NJ 07102 USA

ISBN: (纸本)9781665445924

Virtual reality (VR) computer interfaces show promise for improving societal communication and representation of information due to their unique ability to be placed spatially around the user in three-dimensional (3D) space. This opens new possibilities for presentation and user interaction with the target information, and may be especially impactful for the education of science, technology, engineering, and mathematics (STEM) professionals. Simulations and visualizations have been shown in research studies to improve the efficiency of STEM learners compared to the less sensorimotor rich learning mediums of live instruction and textbook reading. Yet, learning science research into immersive computer simulation environments for educational applications remains limited. To address this research gap, we analyzed a fundamental VR interface capability, virtual environmental traversal, and its impact on participants' learning. We altered the traversal ability between two groups of STEM learners within the same virtual environment and compared their performance. Findings point that VR computer interfaces, regardless of environmental traversal, are suitable STEM learning environments, but that environmental traversal can increase learning efficiency.

关键词： virtual reality educational technology computer science education STEM education sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

Formal Verification of a Merge Sort Algorithm in SPARK

Formal Verification of a Merge Sort Algorithm in SPARK

引用

AIAA Science and Technology Forum and Exposition (AIAA SciTech Forum)

作者： Baity, Ryan Humphrey, Laura Hopkinson, Kenneth Air Force Inst Technol Dept Elect & Comp Engn Wright Patterson AFB OH 45433 USA Air Force Inst Technol Aerosp Syst Directorate Wright Patterson AFB OH 45433 USA

ISBN: (数字)9781624106095

ISBN: (纸本)9781624106095

Sophisticated software is enabling new capabilities across a number of different domains, from driverless cars in the automotive industry, to embedded medical devices in the healthcare industry, to autonomous drones in the aerospace industry. Given the safety implications, there is a need for software in these domains to be highly reliable. However, there are concerns that verification through testing alone will be insufficient to demonstrate the required degree of software reliability, since testing will only be able to cover a small portion of all possible software behaviors. An alternative is to analyze software through formal methods, i.e. mathematically-based tools and techniques for design and verification. Formal methods can be used to check many types of properties, including functional correctness of software, i.e. that software complies with a user-generated specification describing its intended behavior. The goal of this paper is to give the reader an impression of what is involved in proving functional correctness of a software module by walking through a simple example in an appropriate tool. To that end, we go through the process of proving functional correctness of a simple well-known merge sort algorithm in SPARK, a programming language with an associated verification toolset that has been used to create highly assured software in a number of domains, including the aerospace domain.

关键词： sorting algorithms Aerospace Industry Software Reliability Worst Case Execution Time Detect and Avoid Service Oriented Architectures Unmanned Aircraft System Autonomous Systems Air Vehicle Ada (Programming Language)

来源：评论

学校读者我要写书评

暂无评论

Parallel Multidimensional Lookahead sorting Algorithm

引用

IEEE ACCESS 2019年 7卷 75446-75463页

作者： Gebali, Fayez Taher, Mohamed Zaki, Ahmed M. El-Kharashi, M. Watheq Tawfik, Ayman Univ Victoria Dept Elect & Comp Engn Victoria BC V8W 3P6 Canada Ain Shams Univ Fac Engn Comp & Syst Engn Dept Cairo 11517 Egypt Ajman Univ Elect Engn Dept Ajman U Arab Emirates

This paper presents a new parallel structured lookahead multidimensional sorting algorithm. Our algorithm can be based on any sequential sorting algorithm. The amount of parallelism can be controlled using several parameters such as the number of threads, word size, memory/processor communication overhead, and the dimension of the algorithm. The proposed technique is ideally suited for general purpose graphic processing units and shared-memory massively parallel processor systems. It ensures that data being processed exhibits temporal and spatial locality to maximize the utilization of processor cache. The algorithm achieves a speedup even when a single processor is used. A lookahead algorithm is also proposed to achieve even higher speedup. The performance of the proposed algorithm is verified numerically and experimentally.

关键词： Lookahead multicore execution parallel algorithms sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：