In the quest to build exascale supercomputers, designers are increasing the number of hierarchical levels that exist among system components. Software developed for these systems must account for the various hierarchi...
详细信息
ISBN:
(纸本)9783642244483
In the quest to build exascale supercomputers, designers are increasing the number of hierarchical levels that exist among system components. Software developed for these systems must account for the various hierarchies to achieve maximum efficiency. The first step in this work is to identify groups of processes that share common resources. We develop, analyze, and test several algorithms that can split millions of processes into groups based on arbitrary, user-defined data. We find that bitonic sort and our new hash-based algorithm best suit the task.
Learning technologies for autonomous study of computer programming abstract concepts are not yet available on a large scale. In this sense we propose an e-learning content design to meet both: the needs of the tutor i...
详细信息
ISBN:
(纸本)9781728106991
Learning technologies for autonomous study of computer programming abstract concepts are not yet available on a large scale. In this sense we propose an e-learning content design to meet both: the needs of the tutor in the class and the needs of the student able to study on his own at home. Theoretical materials based on static text have the advantage of presenting all the notions in details but the drawback of being impossible to exercise with. On the other hand, Auto-Generative Learning Objects are designed for exercising and testing the understanding of abstractions and concepts for computer programming. AGLOs were not created for presenting in detail the theoretical descriptions of concepts. In this sense we propose a design of a mixed learning content including: static text theory, dynamic JavaScript demos, dynamic AGLOs, static code images and proposed exercises to be manually assessed.
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 ...
详细信息
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 Dijkstr...
详细信息
The research primarily examines the significance of pivot selection of the widely used QuickSort algorithm in order to increase the overall performance and efficiency. Quicksort has an average time complexity of O(nlo...
详细信息
algorithms are an essential part of Operations Research (OR) methodology. Therefore, the efficiency of the algorithms must be a consideration. However, traditional approaches to assessing algorithm efficiency do not a...
详细信息
algorithms are an essential part of Operations Research (OR) methodology. Therefore, the efficiency of the algorithms must be a consideration. However, traditional approaches to assessing algorithm efficiency do not always captured the real-world trade-offs involved. This thesis explored the use of a new measure of algorithm efficiency, robustness, and contrasted it with the traditional "big-O" analysis. sorting algorithms were used to illustrate the trade-offs. The use of Dr. Genichi Taguchi's robust design techniques allowed us to take into account the impact of factors which would be uncontrollable in the real world, by measuring how those factors affect the consistency of the results. These factors, which are treated separately by big-O analysis, are incorporated as an integral part of robust analysis. The hypothesis was that robustness is potentially a more useful description of algorithm performance than the more traditional big-O analyses. The results of experimentation supported this hypothesis. Where big-O analysis only considers the average performance, robustness integrates the average performance and the consistency of performance. Most importantly, the robust analysis we performed yielded results that are consistent with actual usage-practitioners prefer quicksort over heap sort, despite the fact that under big-O analysis heap sort dominates quicksort.
NASA Technical Reports Server (Ntrs) 20160005867: Fixing Dataset Search by NASA Technical Reports Server (Ntrs); NASA Technical Reports Server (Ntrs); published by
NASA Technical Reports Server (Ntrs) 20160005867: Fixing Dataset Search by NASA Technical Reports Server (Ntrs); NASA Technical Reports Server (Ntrs); published by
NASA Technical Reports Server (Ntrs) 20000114845: Parallel Implementation of a High Order Implicit Collocation Method for the Heat Equation by NASA Technical Reports Server (Ntrs); published by
NASA Technical Reports Server (Ntrs) 20000114845: Parallel Implementation of a High Order Implicit Collocation Method for the Heat Equation by NASA Technical Reports Server (Ntrs); published by
NASA Technical Reports Server (Ntrs) 19920001075: on the Suitability of the Connection MacHine for Direct Particle Simulation by NASA Technical Reports Server (Ntrs); published by
NASA Technical Reports Server (Ntrs) 19920001075: on the Suitability of the Connection MacHine for Direct Particle Simulation by NASA Technical Reports Server (Ntrs); published by
暂无评论