空间计算机上的近似并行排序

RACES '12 Pub Date : 2012-10-21 DOI:10.1145/2414729.2414739

Max OrHai, A. Black

{"title":"空间计算机上的近似并行排序","authors":"Max OrHai, A. Black","doi":"10.1145/2414729.2414739","DOIUrl":null,"url":null,"abstract":"We describe collision sort, a simple distributed sorting algorithm for a spatial computer on a regular lattice, which represents data by mobile particles in an abstract space. Although collision sort produces only approximate results, it tolerates faults, minimizes communication, and adapts easily to simultaneous multi-axis sorting. We show simulations of collision sort in 1 and 2 dimensions, and discuss its scalability properties.","PeriodicalId":137547,"journal":{"name":"RACES '12","volume":"398 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Approximate parallel sorting on a spatial computer\",\"authors\":\"Max OrHai, A. Black\",\"doi\":\"10.1145/2414729.2414739\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe collision sort, a simple distributed sorting algorithm for a spatial computer on a regular lattice, which represents data by mobile particles in an abstract space. Although collision sort produces only approximate results, it tolerates faults, minimizes communication, and adapts easily to simultaneous multi-axis sorting. We show simulations of collision sort in 1 and 2 dimensions, and discuss its scalability properties.\",\"PeriodicalId\":137547,\"journal\":{\"name\":\"RACES '12\",\"volume\":\"398 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"RACES '12\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2414729.2414739\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"RACES '12","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2414729.2414739","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

碰撞排序是一种简单的分布式排序算法，用于空间计算机在规则晶格上的排序，它表示抽象空间中移动粒子的数据。虽然碰撞排序只能产生近似结果，但它可以容忍错误，最小化通信，并且很容易适应同时进行的多轴排序。给出了一维和二维碰撞排序的仿真，并讨论了其可扩展性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Approximate parallel sorting on a spatial computer

We describe collision sort, a simple distributed sorting algorithm for a spatial computer on a regular lattice, which represents data by mobile particles in an abstract space. Although collision sort produces only approximate results, it tolerates faults, minimizes communication, and adapts easily to simultaneous multi-axis sorting. We show simulations of collision sort in 1 and 2 dimensions, and discuss its scalability properties.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

RACES '12

自引率

0.00%

发文量