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

TIMING RESULTS OF SOME INTERNAL sorting algorithms ON THE IBM-3090

PARALLEL COMPUTING 1988年第1期6卷 115-117页

作者： CARNEVALI, P IBM ECSEC Via Giorgione 159 00147 Roma Italy

The information contained in a paper by Rönsch adn Strauss on the performance of sorting algorithms on vector computers is completed with performance data of the IBM 3090 on sorting. For scalar sorting, the IBM 3090 turns out to be faster than all the machines considered by Rönnsch and Strauss. Due to this high scalar speed, FORTRAN-coded vector sorting is never more efficient than scalar sorting on the IBM 3090, at least for the vector sorting algorithms considered. On the other hand, for optimized library routines the IBM 3090 outperforms the CRAY X-MP (but not the AMDAHL 1200) at most vector lenghts.

关键词： IBM 3090 internal sorting performance analysis sorting algorithms vector computer

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficiency Comparison of Common sorting algorithms 29

Energy-Efficiency Comparison of Common Sorting Algorithms

引用

29th International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)

作者： Schmitt, Norbert Kamthania, Supriya Rawtani, Nishant Mendoza, Luis Lange, Klaus-Dieter Kounev, Samuel Univ Wurzburg Chair Software Engn Wurzburg Germany Hewlett Packard Enterprise Bengaluru India Hewlett Packard Enterprise Houston TX USA

ISBN: (纸本)9781665458382

With the rising demand for information technology comes an increase in energy consumption to power it. Namely, cloud computing is constantly growing, in part due to a rising number of devices using the cloud to provide certain functionality. This growth leads to an increase in energy consumption in data centers and is estimated to climb to over 1PWh in 2030. Hardware manufacturers counter the rising demand for energy in cloud data centers by providing techniques to make servers more energy-efficient. However, the advances cannot fully compensate for the growth. To further increase energy efficiency, software needs to be addressed as well but is often neglected by the developers. In this paper, we compare six sorting algorithms, a common task in most programs, against each other in terms of energy efficiency to allow developers to select the best solution to their problem. We selected well-known algorithms in two variants, and two implementation languages, C and Python. We ran each algorithm on two, out of four, state-of-the-art server systems with different CPUs.

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

来源：评论

学校读者我要写书评

暂无评论

A Generic Approach to the Verification of the Permutation Property of Sequential and Parallel Swap-Based sorting algorithms 16th

A Generic Approach to the Verification of the Permutation Pr...

引用

16th International Conference on Integrated Formal Methods (IFM)

作者： Safari, Mohsen Huisman, Marieke Univ Twente Formal Methods & Tools Enschede Netherlands

ISBN: (纸本)9783030634612;9783030634605

sorting is one of the fundamental operations in computer science, and many sequential and parallel algorithms have been proposed in the literature. Swap-based sorting algorithms are one category of sorting algorithms where elements are swapped repeatedly to achieve the desired order. Since these algorithms are widely used in practice, their (functional) correctness, i.e., proving sortedness and permutation properties, is of utmost importance. However, proving the permutation property using automated program verifiers is much more challenging as the formal definition of this property involves existential quantifiers. In this paper, we propose a generic pattern to verify the permutation property for any sequential and parallel swap-based sorting algorithm automatically. To demonstrate our approach, we use VerCors, a verification tool based on separation logic for concurrent and parallel programs, to verify the permutation property of bubble sort, selection sort, insertion sort, parallel odd-even transposition sort, quick sort, two in-place merge sorts and TimSort for any arbitrary size of input.

关键词： sorting algorithms Deductive verification Separation logic

来源：评论

学校读者我要写书评

暂无评论

Visualize and Learn sorting algorithms in Data Structure Subject in a Game-based Learning 21

Visualize and Learn Sorting Algorithms in Data Structure Sub...

引用

21st IEEE International Symposium on Mixed and Augmented Reality (ISMAR)

作者： Lim, Wee Han Cai, Yiyu Yao, Dezhong Cao, Qi Singapore Univ Social Sci Singapore Singapore Nanyang Technol Univ Singapore Singapore Huazhong Univ Sci & Technol Wuhan Peoples R China Univ Glasgow Glasgow Lanark Scotland

ISBN: (数字)9781665453653

ISBN: (纸本)9781665453653

The Data Structure subject is an essential Computer Science subject. sorting algorithms are important topics in Data Structure where students are expected to learn how various sorting algorithms work and their time complexities. Some sorting algorithms may easily cause confusions to novice students, as they usually find it challenging to understand and memorize these algorithms. There is a need to find a means of technology enhanced learning to improve the learning process of students. Game based learning is a pedagogy where students learn through game playing. This mode of learning could effectively engage students to focus on the learning topics more efficiently. The study uses a sorting algorithm serious game to allow students to learn four types of sorting algorithms: Bubble sort, Selection sort, Insertion sort and Quick sort. The students would carry out self-directed learning lecture materials in the serious game, followed by refreshing their learning using. a visualizer, and lastly reInforce theIr learnIng through playing a sorting serious game. Two groups of students participate in the experiment, a control group and an experiment group. The experIment group that sues the sorting algorithm games achieves better results, compared to the control group who learns without the serious. game. Game-based learning provides a posItIve learnIng experience to the students that could improve the learning effectIveness. Coupled wIth technology such as VR headsets as a future upgrade, it would be a niche factor that would create an immersive learning experience to engage the students and enhance their learning in a virtual environment.

关键词： Game-based learning data structure sorting algorithms learning efficiency serious game

来源：评论

学校读者我要写书评

暂无评论

Learning sorting algorithms through visualization construction

引用

COMPUTER SCIENCE EDUCATION 2016年第1期26卷 27-43页

作者： Cetin, Ibrahim Andrews-Larson, Christine Abant Izzet Baysal Univ Secondary Sci & Math Educ Bolu Turkey Florida State Univ Sch Teacher Educ Tallahassee FL 32306 USA

Recent increased interest in computational thinking poses an important question to researchers: What are the best ways to teach fundamental computing concepts to students? Visualization is suggested as one way of supporting student learning. This mixed-method study aimed to (i) examine the effect of instruction in which students constructed visualizations on students' programming achievement and students' attitudes toward computer programming, and (ii) explore how this kind of instruction supports students' learning according to their self-reported experiences in the course. The study was conducted with 58 pre-service teachers who were enrolled in their second programming class. They expect to teach information technology and computing-related courses at the primary and secondary levels. An embedded experimental model was utilized as a research design. Students in the experimental group were given instruction that required students to construct visualizations related to sorting, whereas students in the control group viewed pre-made visualizations. After the instructional intervention, eight students from each group were selected for semi-structured interviews. The results showed that the intervention based on visualization construction resulted in significantly better acquisition of sorting concepts. However, there was no significant difference between the groups with respect to students' attitudes toward computer programming. Qualitative data analysis indicated that students in the experimental group constructed necessary abstractions through their engagement in visualization construction activities. The authors of this study argue that the students' active engagement in the visualization construction activities explains only one side of students' success. The other side can be explained through the instructional approach, constructionism in this case, used to design instruction. The conclusions and implications of this study can be used by researchers and instruct

关键词： Visualization computational thinking engagement taxonomy sorting algorithms constructionism

来源：评论

学校读者我要写书评

暂无评论

Comparison Criticality in sorting algorithms 44

Comparison Criticality in Sorting Algorithms

引用

44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)

作者： Jones, Thomas B. Ackley, David H. Univ New Mexico Dept Comp Sci Albuquerque NM 87131 USA

ISBN: (纸本)9781479922338

Fault tolerance techniques often presume that the end-user computation must complete flawlessly. Though such strict correctness is natural and easy to explain, it's increasingly unaffordable for extreme-scale computations, and blind to possible preferences among errors, should they prove inevitable. In a case study on traditional sorting algorithms, we present explorations of a criticality measure defined over expected fault damage rather than probability of correctness. We discover novel 'error structure' in even the most familiar algorithms, and observe that different plausible error measures can qualitatively alter criticality relationships, suggesting the importance of explicit error measures and criticality in the wise deployment of the limited spare resources likely to be available in future extreme-scale computers.

关键词： Fault-intolerance fault tolerance criticality sorting algorithms robust-first computing

来源：评论

学校读者我要写书评

暂无评论

Proof Techniques for Synthesis of sorting algorithms

Proof Techniques for Synthesis of Sorting Algorithms

引用

13th International Symposium on Symbolic and Numeric algorithms for Scientific Computing (SYNASC)

作者： Dramnesc, Isabela Jebelean, Tudor West Univ Dept Comp Sci Timisoara Romania Johannes Kepler Univ Linz Symbol Computat Res Inst Linz Austria

ISBN: (纸本)9780769546308

In the context of constructive synthesis of sorting algorithms, starting from the specification of the problem (input and output conditions), the proof of existence of a sorted tuple is performed inductively and we design, implement, and experiment with different proof techniques: First we use a back-chaining mechanism similar to a Prolog engine for first order logic, in which meta-variables are used for finding the existential witnesses. In order to overcome the search space explosion, we introduce various specific prove-solve methods for the theory of tuples. For instance, the equivalence relation on tuples "have same elements" can be treated using a normal form based on multisets - this leads to a very efficient inference rule for rewriting. When reasoning about sorting, we also have an ordering relation between elements. We extend this to an ordering between an element and a tuple, and even between tuples. Ordering relations create specific problems in Prolog style reasoning, because of transitivity and reflexivity. We demonstrate that ordering can be treated very efficiently by decomposing atomic statements into simpler ones (containing only symbols instead of terms), both for goals (backward reasoning) as well as for assumptions (forward reasoning). This leads to an interesting combination of backward and forward inferences which goes beyond and complements Prolog style reasoning. Finally, we develop a solving mechanism for finding sorted tuples, which performs the proof more efficiently, by combining relatively simple inference rules and small searches with goal directed solving rules. The techniques are implemented in the Theorema system and are able to produce automatically proofs and algorithms for various problems: Insertion Sort, Insertion, Merge Sort, and Merge. Besides the special proof techniques, this work also gives useful hints about finding appropriate induction principles for tuples, as well as for the construction of appropriate collections of p

关键词： sorting algorithms synthesis extraction proof techniques induction Theorema

来源：评论

学校读者我要写书评

暂无评论

Examining the Energy Impact of sorting algorithms on Android: An Empirical Study 16

Examining the Energy Impact of Sorting Algorithms on Android...

引用

16th EAI International Conference on Mobile and Ubiquitous Systems - Computing, Networking and Services (MobiQuitous)

作者： Schuler, Andreas Anderst-Kotsis, Gabriele Johannes Kepler Univ Linz Dept Telecooperat Linz Upper Austria Austria Univ Appl Sci Upper Austria RG Adv Informat Syst & Technol AIST Hagenberg Upper Austria Austria

ISBN: (纸本)9781450372831

With the advent of mobile application development a new software quality concern - energy consumption - was introduced. For mobile software developers knowledge about software and algorithm design choices and their implications on energy consumption is crucial. However, software developers either lack this knowledge or tools to support them in estimating the energy consumption of their applications and therefore are unable to reflect on their design choices. In this empirical study we examine the energy consumption of 12 sorting algorithms and the resulting energy impact when used with different data types. We propose a methodology to obtain energy readings and relate them to application execution traces. Our results show that the choice of data type together with algorithm design can have significant impact on the energy profile of an application.

关键词： energy consumption energy profiling software testing mobile application development sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

Minimum average case time complexity for sorting algorithms

引用

Iran Journal of Computer Science 2023年第4期6卷 445-451页

作者： Dutta, Anurag Choudhury, Manan Roy Sharma, Rakesh K. Department of Computer Science and Engineering Government College of Engineering and Textile Technology 12 William Carey Road West Bengal Serampore 712201 India Department of Computer Science and Engineering Technology University of Maryland Eastern Shore Princess Anne 21853 MD United States

There are certainly many sorting algorithms in this modern world of Computers, most of which work in second-order time and some in linearithmic time, but none have achieved more than that. There is none. However, is it even possible to hit the bottom more than that? The minimal temporal complexity that an ordering modus operandi may achieve goes in the order of O(nlog₂n), without considering any modifications to the generalized computer architecture, according to a rigorous mathematical analysis presented in this paper. However, we have also taken into account the average time complexities of the algorithms to disperse throughout the smallest potential time complexity that a sorting algorithm may achieve. Three different search algorithms, namely, Binary, Interpolation, and Jump search, have been used in this article. The interpolation search takes less time if the array’s items are arranged in arithmetic progression, and there are many more similar biased situations where a certain approach produces superior results. sorting algorithms have been proposed herewith, with Searching Techniques as intermediate. The Computational Complexity of the sorting Algorithm amalgamated with Interpolation Search as an Intermediate Step is compared with sorting algorithms amalgamated with Jump Search, Binary Search as an intermediate. © The Author(s), under exclusive licence to Springer Nature Switzerland AG 2023. corrected publication 2023.

关键词： Exponential integral Incomplete gamma function Interpolation search sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

A Novel Computational Model for GPUs with Application to I/O Optimal sorting algorithms 28

A Novel Computational Model for GPUs with Application to I/O...

引用

28th IEEE International Parallel & Distributed Processing Symposium Workshops (IPDPSW)

作者： Koike, Atsushi Sadakane, Kunihiko Natl Inst Informat Principles Informat Res Div Tokyo Japan Grad Univ Adv Studies Dept Informat Tokyo Japan

ISBN: (纸本)9781479941162

We propose a novel computational model for GPU. Known parallel computational models such as the PRAM model are not appropriate for evaluating GPU algorithms. Our model, called AGPU, abstracts the essence of current GPU architectures such as global and shared memory, memory coalescing and bank conflicts. We can therefore evaluate asymptotic behavior of GPU algorithms more accurately than known models and we can develop algorithms that are efficient on many real architectures. As a showcase, we first analyze known comparison-based sorting algorithms using the AGPU model and show that they are not I/O optimal, that is, the number of global memory accesses is more than necessary. Then we propose a new algorithm which uses an asymptotically optimal number of global memory accesses and whose time complexity is also nearly optimal.

关键词： GPU GPGPU parallel computational models sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：