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

3-DIMENSIONAL DIRECT PARTICLE SIMULATION ON THE CONNECTION MACHINE

JOURNAL OF THERMOPHYSICS AND HEAT TRANSFER 1992年第4期6卷 637-642页

作者： DAGUM, L NASA AMES RES CTR MOFFETT FIELD CA 94035 USA

This paper presents the algorithms necessary for an efficient data parallel implementation of a three-dimensional particle simulation. A general master/slave algorithm and a fast sorting algorithm are described, and the use of these algorithms in a particle simulation is outlined. A particle simulation using these algorithms has been implemented on a 32768 processor connection machine that is capable of simulating over 30 million particles at an average rate of 2.4 mus/particle/step. Results are presented from the simulation of flow over an aeroassisted flight experiment (AFE) geometry at 100 km alt.

关键词： Connection Machine sorting algorithms Freestream Mach Number Number of Particles Stagnation Region Hypervelocity Flow Parallel Algorithm Direct Simulation Monte Carlo Stagnation Streamlines NASA Ames Research Center

来源：评论

学校读者我要写书评

暂无评论

Smart Bubble Sort:A Novel and Dynamic Variant of Bubble Sort Algorithm

引用

Computers, Materials & Continua 2022年第6期71卷 4895-4913页

作者： Mohammad Khalid Imam Rahmani College of Computing and Informatics Saudi Electronic UniversityRiyadhSaudi Arabia

In the present era,a very huge volume of data is being stored in online and offline *** houses,research,medical as well as healthcare organizations,and academic institutions store data in databases and their subsequent retrievals are performed for further *** the required data from a given database within the minimum possible time is one of the key factors in achieving the best possible performance of any computer-based *** the data is already sorted,finding or searching is comparatively *** real-life scenarios,the data collected from different sources may not be in sorted *** algorithms are required to arrange the data in some order in the least possible *** this paper,I propose an intelligent approach towards designing a smart variant of the bubble sort algorithm.I call it Smart Bubble sort that exhibits dynamic footprint:The capability of adapting itself from the average-case to the best-case *** is an in-place sorting algorithm and its best-case time complexity isΩ(n).It is linear and better than bubble sort,selection sort,and merge *** averagecase and worst-case analyses,the complexity estimates are based on its static footprint *** complexity in worst-case is O(n2)and in average-case isΘ(n^(2)).Smart Bubble sort is capable of adapting itself to the best-case scenario from the average-case scenario at any subsequent stages due to its dynamic and intelligent *** Smart Bubble sort outperforms bubble sort,selection sort,and merge sort in the best-case scenario whereas it outperforms bubble sort in the average-case scenario.

关键词： sorting algorithms smart bubble sort footprint dynamic footprint time complexity asymptotic analysis

来源：评论

学校读者我要写书评

暂无评论

Out-of-core computing on mesh connected computers

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2004年第11期64卷 1311-1317页

作者： Rajasekaran, S Univ Connecticut Dept CSE Storrs CT 06269 USA

Several models of parallel disks are found in the literature. These models have been proposed to alleviate the I/O bottleneck arising in handling voluminous data. These models have the general theme of assuming multiple disks. For instance the parallel disks model assumes D disks and a single computer. It is also assumed that a block of data from each of the D disks can be fetched into the main memory in one parallel I/O operation. In this paper, we study a model where there are more than one processors and each processor has an associated disk. In addition to the I/O cost, one also has to account for the inter-processor communication costs. To begin with we study the mesh and we investigate the performance of the mesh with respect to out-of-core computing. As a case study we consider the problem of sorting. The goal of this paper is to study the properties of this model. (C) 2004 Elsevier Inc. All rights reserved.

关键词： out-of-core computing I/O bottleneck parallel models of computing mesh connected computers parallel disks model sorting algorithms packet routing randomized computing

来源：评论

学校读者我要写书评

暂无评论

ALL-OPTICAL COMPARE-AND-EXCHANGE SWITCHES

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 1988年第7期6卷 1273-1279页

作者： ZHANG, L JIN, R STIRK, CW KHITROVA, G ATHALE, RA GIBBS, HM CHOU, HM SPRAGUE, RW MACLEOD, HA BDM CORP MCLEANVA 22102

All-optical compare and exchange is experimentally dem- onstrated using ZnS bistable optical devices. The compare-and-ex- change demonstration utilizes polarization multiplexing and filtering, and latching and bidirectional logic. The combination of 2-D arrays of compare-and-exchange modules with optical perfect-shuffle intercon- nections leads to pipelined optical sorting nefworks that can process large numbers of high-bandwidth signals in parallel. Optical sorting networks with these characteristics are applicable in telecommunica- tion switches, parallel processor interconnections, and database ma- chines.

关键词： .interconnects optical devices sorting algorithms latching Compare-and-Exchange compare and exchange perfect-shuffle Optical sorting networks temporal complexity

来源：评论

学校读者我要写书评

暂无评论

BI-WAY SORTER - A 2-DIMENSIONAL SYSTOLIC ARRAY

引用

IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES 1992年第2期139卷 147-155页

作者： ORTON, GA PEPPARD, LE AKL, SG QUEENS UNIV DEPT COMP & INFORMAT SCIKINGSTON K7L 3N6ONTARIOCANADA

A VLSI implementation of a new two-dimensional systolic array for sorting in a sequential input/output environment is described. The new 'bi-way' sorter allows double the key length in the same chip area than the previously proposed two-way sorter. A 10 bit, 20 number prototype bi-way sorting chip in 3-mu-m CMOS has been tested at 9 MHz. Fast new techniques are described for sorting keys or sequences which exceed in length the capacity of the sorting hardware. A rapid testing procedure is outlined. The two-dimensional systolic sorter described in this paper offers an attractive alternative to non-systolic sorters, especially at future levels of integration.

关键词： DIGITAL COMPUTERS sorting algorithms SYSTOLIC ARRAYS VLSI

来源：评论

学校读者我要写书评

暂无评论

Running time of the Treapsort algorithm

引用

THEORETICAL COMPUTER SCIENCE 2013年 487卷 65-73页

作者： Early, D. Schellekens, M. Natl Univ Ireland Univ Coll Cork Ctr Efficiency Oriented Languages Cork Ireland

We analyse the running time of Treapsort, a sorting algorithm in the MOQA(1) programming language, which acts on treaps. We show that, using the 'partial permutation' model of Banderier et al. (2003) [1], Treapsort has smoothed complexity Theta (sigma(-1)n ln n) for treaps of size n. We also show that the multiset of running times of Treapsort on all treaps of size n is equal to the multiset of running times of Quicksort on all lists of length n. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Average-case analysis of algorithms Smoothed complexity sorting algorithms MOQA

来源：评论

学校读者我要写书评

暂无评论

A new approach to Mergesort algorithm: Divide smart and conquer

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2024年 157卷 330-343页

作者： Amrahov, Sahin Emrah Ar, Yilmaz Tugrul, Bulent Akay, Bekir Emirhan Kartli, Nermin Ankara Univ Dept Comp Engn TR-06830 Golbasi Ankara Turkiye

It is well known that comparison-based algorithms cannot run faster than O ( nlogn ) . Therefore the running times of Mergesort, Heapsort, and Quicksort algorithms are asymptotically optimal. As well as asymptotic running times, how fast sorting algorithms work in practice has gained importance lately. One algorithm is preferred, if it is slightly more efficient than another, due to the rapid increase in data generation. In this study, we consider the Mergesort algorithm with a different approach. Unlike the Mergesort algorithm, we do not perform unconditional division. Instead, we divide the input array into ascending and descending sub-arrays. Then, we merge the sub-arrays obtained as a result of the division by slightly modifying the classical Merge function. As a result of these two operations, we obtain three new sorting algorithms depending on how we get ascending and descending sub-arrays. Among these three algorithms, the third one, which is our main proposed algorithm, is more important both theoretically and practically. In this algorithm, we divide the input array into alternately ascending and descending sub-arrays. Moreover, the terms of the sub-arrays do not have to be consecutive terms of the input array. The asymptotic running time of our proposed algorithm is O ( nlogn ) in the worst case and O ( n ) in the best case. In practice, the proposed algorithm performs better than the classical Mergesort algorithm in arrays with Gaussian and Uniform distributions of various sizes. In an array of four million, it provided a 17% improvement in the Gaussian distribution compared to the classical Mergesort algorithm. In addition, it provided a 29% improvement in the Uniform distribution of the same size. The proposed algorithm performs also much better than traditional sorting algorithms in real data collected from various sources.

关键词： Mergesort sorting algorithms Divide and conquer Complexity analysis Tournament method Quicksort Heapsort

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Formulation and analysis of in-place MSD radix sort algorithms

引用

JOURNAL OF INFORMATION SCIENCE 2005年第6期31卷 467-481页

作者： Al-Darwish, N King Fahd Univ Petr & Minerals ICS Dept Dhahran 31261 Saudi Arabia

We present a unified treatment of a number of related in-place MSD radix sort algorithms with varying radices, collectively referred to here as 'Matesort' algorithms. These algorithms use the idea of in-place partitioning which is a considerable improvement over the traditional linked list implementation of radix sort that uses 0(n) space. The binary Matesort algorithm is a recast of the classical radix-exchange sort, emphasizing the role of in-place partitioning and efficient implementation of bit processing operations. This algorithm is O(k) space and has O(kn) worst-case order of running time, where k is the number of bits needed to encode an element value and n is the number of elements to be sorted. The binary Matesort algorithm is evolved into a number of other algorithms including 'continuous Matesort' for handling floating point numbers, and a number of 'general radix Matesort' algorithms. We present formulation and analysis for three different approaches (sequential, divide-and-conquer and permutation-loop) for partitioning by the general radix Matesort algorithm. The divide-and-conquer approach leads to an elegantly coded algorithm with better performance than the permutation-loop-based American Flag Sort algorithm.

关键词： sorting algorithms radix sort MSD radix sort Matesort general radix Matesort Quicksort

来源：评论

学校读者我要写书评

暂无评论

Identification of tethered satellite with mixed observational data

引用

JOURNAL OF SPACECRAFT AND ROCKETS 2007年第1期44卷 240-245页

作者： Tragesser, Steven G. Faulstich, Mark Univ Colorado Colorado Springs CO 80933 USA Air Force Space Command Schriever AFB CO 80912 USA

Tethered satellite systems present a challenge to tracking systems and software, because the end bodies do not follow Keplerian motion. For very long tethers, the motion of the end body can be more consistent with a suborbital vehicle than an orbiting satellite., Therefore, a robust and efficient algorithm is warranted that can identify if a satellite is tethered. This research develops an approach that estimates the tether length by minimizing an objective function of the residual errors between measured and estimated position. Tethered satellite identification is then based on the estimated tether length. A unique feature of the filter is that it permits mixed observations of either end mass, but there is no a priori knowledge of which body is associated with any given data point. This "data sorting" problem is a necessary component of any practical system. The methodology presented here is tested with data from the Tether Physics and Survivability Experiment.

关键词： Satellites Tether Physics and Survivability Radar Tracking Earth Perifocal Coordinate System sorting algorithms Nearly Circular Orbit Earth Centered Inertial Monte Carlo Simulation Orbit Determination

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：