Energy performance of parallel sort algorithms
نویسندگان
چکیده
منابع مشابه
Parallel Genetic Algorithm for Creation of Sort Algorithms
In this paper we present parallel genetic algorithm that was used to the task of evolving imperative sort programs. A variety of interesting lessons were learned. With proper selection of the primitives, sorting programs were evolved that are both general and non-trivial. Unique aspect of our approach is that we represent the individual programs with simple assembler code, rather than usual tre...
متن کاملParallel Algorithms and Structures for Implementation of Merge Sort
I. INTODACTION The development of information technologies is characterized by the expansion of applications, many of which requires parallel sorting of data sets in real-time. You can provide such data sorting by using of specialized tools, which architecture maps the structure of the sorting algorithm on hardware and is oriented on VLSI implementation. Implementation of highly efficient speci...
متن کاملThe Effect of Local Sort on Parallel Sorting Algorithms
We show the importance of sequential sorting in the context of in memory parallel sorting of large data sets of 64 bit keys. First, we analyze several sequential strategies like Straight Insertion, Quick sort, Radix sort and CC-Radix sort. As a consequence of the analysis, we propose a new algorithm that we call Sequential Counting Split Radix sort, SCS-Radix sort. SCS-Radix sort is a combinati...
متن کاملEnergy-Performance Trade-off Analysis of Parallel Algorithms
Energy consumption by computer systems has emerged as an important concern, both at the level of individual devices (limited battery capacity in mobile systems) and at the societal level (the production of Green House Gases). In multicore architectures, applications may be executed on a variable number of cores and these cores may operate at different frequencies. The performance and energy cos...
متن کاملParallel String Sample Sort
We discuss how string sorting algorithms can be parallelized on modern multi-core shared memory machines. As a synthesis of the best sequential string sorting algorithms and successful parallel sorting algorithms for atomic objects, we propose string sample sort. The algorithm makes effective use of the memory hierarchy, uses additional word level parallelism, and largely avoids branch mispredi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology And Control
سال: 2019
ISSN: 2335-884X,1392-124X
DOI: 10.5755/j01.itc.48.3.23696