ProjectileSort - Rule Based Parallel Sorting Algorithm - Architecture for Reconfigurable Multi-Partition Object Arrays

Nandika Liyanage
{"title":"ProjectileSort - Rule Based Parallel Sorting Algorithm - Architecture for Reconfigurable Multi-Partition Object Arrays","authors":"Nandika Liyanage","doi":"10.1109/PDCAT.2017.00031","DOIUrl":null,"url":null,"abstract":"Data can be store as structured, semi-structured or unstructured formats in various distributed environments. Extraction of data from multiple data sources or data warehouse and convert to a proper order is quite time consuming task even using the latest hardware and software technologies. Sorting is one of the key concepts that helps to improve the efficiency of various computational process. Unlike the early single processor or single server operations using monolithic applications, multi-core distributed environments required more advanced computational theories and algorithms. Existing sorting theories are basically derived from linear algorithms and enhanced to support for distributed processing. This research discuss the characteristics of existing parallel sorting algorithms, techniques, limitation. Aim and objective is to introduce a new pure parallel sorting algorithm and sorting architecture that pointing to execute under latest distributed environments. The proposed pattern and the sorting architecture can be used as rule based parallel sorting technique and algorithm to support for any type of distributed environment to sort infinite dataset.","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT.2017.00031","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Data can be store as structured, semi-structured or unstructured formats in various distributed environments. Extraction of data from multiple data sources or data warehouse and convert to a proper order is quite time consuming task even using the latest hardware and software technologies. Sorting is one of the key concepts that helps to improve the efficiency of various computational process. Unlike the early single processor or single server operations using monolithic applications, multi-core distributed environments required more advanced computational theories and algorithms. Existing sorting theories are basically derived from linear algorithms and enhanced to support for distributed processing. This research discuss the characteristics of existing parallel sorting algorithms, techniques, limitation. Aim and objective is to introduce a new pure parallel sorting algorithm and sorting architecture that pointing to execute under latest distributed environments. The proposed pattern and the sorting architecture can be used as rule based parallel sorting technique and algorithm to support for any type of distributed environment to sort infinite dataset.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于规则的并行排序算法。可重构多分区对象数组的体系结构
数据可以以结构化、半结构化或非结构化格式存储在各种分布式环境中。即使使用最新的硬件和软件技术,从多个数据源或数据仓库中提取数据并将其转换为适当的顺序也是非常耗时的任务。排序是帮助提高各种计算过程效率的关键概念之一。与早期使用单片应用程序的单处理器或单服务器操作不同,多核分布式环境需要更先进的计算理论和算法。现有的排序理论基本上是从线性算法衍生出来的,并增强了对分布式处理的支持。本研究讨论了现有并行排序算法的特点、技术、局限性。目的和目标是介绍一种新的纯并行排序算法和排序体系结构,指向在最新的分布式环境下执行。所提出的模式和排序体系结构可以作为基于规则的并行排序技术和算法,支持在任何类型的分布式环境下对无限数据集进行排序。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Implementing Algorithmic Skeletons with Bulk Synchronous Parallel ML Managing Bytecode and ISA Compatibility with an Enhanced Toolchain Improved Online Algorithms for One-Dimensional BinPacking with Advice A Case Study in Higher Education Domain Based on a Prototype for Business Process Models Improvement: BPMoQualAssess NMFDIV: A Nonnegative Matrix Factorization Approach for Search Result Diversification on Attributed Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1