一种从元素列表中查找最大和第二大元素的高效并行算法

9th International Conference on Information Technology (ICIT'06) Pub Date : 2006-12-18 DOI:10.1109/ICIT.2006.27

B. K. Sarkar, Shahid Jamal, Bhagirath Kumar

{"title":"一种从元素列表中查找最大和第二大元素的高效并行算法","authors":"B. K. Sarkar, Shahid Jamal, Bhagirath Kumar","doi":"10.1109/ICIT.2006.27","DOIUrl":null,"url":null,"abstract":"This paper first presents two sequential algorithms following a new approach for finding the largest and the second largest elements from a list of n elements assuming n is multiple of 3. Another contribution of this paper is an EREW P-RAM(exclusive read and exclusive write-parallel random access machine) version of this sequential approach, runs in time O(logn) using only n/3 processors. This problem is useful to rank the winner and the runner in any event from many individuals.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An efficient parallel algorithm for finding the largest and the second largest elements from a list of elements\",\"authors\":\"B. K. Sarkar, Shahid Jamal, Bhagirath Kumar\",\"doi\":\"10.1109/ICIT.2006.27\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper first presents two sequential algorithms following a new approach for finding the largest and the second largest elements from a list of n elements assuming n is multiple of 3. Another contribution of this paper is an EREW P-RAM(exclusive read and exclusive write-parallel random access machine) version of this sequential approach, runs in time O(logn) using only n/3 processors. This problem is useful to rank the winner and the runner in any event from many individuals.\",\"PeriodicalId\":161120,\"journal\":{\"name\":\"9th International Conference on Information Technology (ICIT'06)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"9th International Conference on Information Technology (ICIT'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIT.2006.27\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"9th International Conference on Information Technology (ICIT'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIT.2006.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文首先给出了两个顺序算法，它们遵循一种新的方法，用于从n个元素的列表中找到最大和第二大元素，假设n是3的倍数。本文的另一个贡献是这种顺序方法的EREW P-RAM(独占读和独占写并行随机存取机)版本，仅使用n/3个处理器，运行时间为O(logn)。这个问题对于从众多个人中选出任何项目的冠军和赛跑者都很有用。

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

查看原文本刊更多论文

An efficient parallel algorithm for finding the largest and the second largest elements from a list of elements

This paper first presents two sequential algorithms following a new approach for finding the largest and the second largest elements from a list of n elements assuming n is multiple of 3. Another contribution of this paper is an EREW P-RAM(exclusive read and exclusive write-parallel random access machine) version of this sequential approach, runs in time O(logn) using only n/3 processors. This problem is useful to rank the winner and the runner in any event from many individuals.

求助全文

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

来源期刊

9th International Conference on Information Technology (ICIT'06)

自引率

0.00%

发文量