一种改进的并行前缀和算法

Parallel Process. Lett. Pub Date : 2022-09-13 DOI:10.1142/s0129626422500086

H. M. Bahig, Khaled A. Fathy

{"title":"一种改进的并行前缀和算法","authors":"H. M. Bahig, Khaled A. Fathy","doi":"10.1142/s0129626422500086","DOIUrl":null,"url":null,"abstract":"The prefix sums problem for an array [Formula: see text] is to compute all sums [Formula: see text], [Formula: see text]. In this paper, we introduce an improvement for the best previous algorithm that runs in [Formula: see text] time using [Formula: see text] processors on a Sum Concurrent Read Concurrent Write, Parallel Random Access Machine (Sum-CRCW PRAM). The improvements include (1) reducing the total number of operations and (2) reducing the amount of storage required by the algorithm.","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"84 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Improved Parallel Prefix Sums Algorithm\",\"authors\":\"H. M. Bahig, Khaled A. Fathy\",\"doi\":\"10.1142/s0129626422500086\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The prefix sums problem for an array [Formula: see text] is to compute all sums [Formula: see text], [Formula: see text]. In this paper, we introduce an improvement for the best previous algorithm that runs in [Formula: see text] time using [Formula: see text] processors on a Sum Concurrent Read Concurrent Write, Parallel Random Access Machine (Sum-CRCW PRAM). The improvements include (1) reducing the total number of operations and (2) reducing the amount of storage required by the algorithm.\",\"PeriodicalId\":422436,\"journal\":{\"name\":\"Parallel Process. Lett.\",\"volume\":\"84 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Parallel Process. Lett.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s0129626422500086\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Parallel Process. Lett.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0129626422500086","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

数组[公式:见文本]的前缀求和问题是计算所有的和[公式:见文本]，[公式:见文本]。在本文中，我们介绍了在一个Sum- crcw PRAM (Sum- crcw PRAM)上使用[Formula: see text]处理器在[Formula: see text]时间内运行的最佳先前算法的改进。改进包括(1)减少操作总数和(2)减少算法所需的存储量。

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

查看原文本刊更多论文

An Improved Parallel Prefix Sums Algorithm

The prefix sums problem for an array [Formula: see text] is to compute all sums [Formula: see text], [Formula: see text]. In this paper, we introduce an improvement for the best previous algorithm that runs in [Formula: see text] time using [Formula: see text] processors on a Sum Concurrent Read Concurrent Write, Parallel Random Access Machine (Sum-CRCW PRAM). The improvements include (1) reducing the total number of operations and (2) reducing the amount of storage required by the algorithm.

求助全文

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

来源期刊

Parallel Process. Lett.

自引率

0.00%

发文量