在超立方体上选择领导者

Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI:10.1109/PARBSE.1990.77181

S. Robbins, K.A. Robbins

{"title":"在超立方体上选择领导者","authors":"S. Robbins, K.A. Robbins","doi":"10.1109/PARBSE.1990.77181","DOIUrl":null,"url":null,"abstract":"The problem of electing a leader via message passing on a network is a fundamental problem in distributed processing. The authors present a simple algorithm for election of a leader on a hypercube with n nodes in O(n) messages.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Choosing a leader on a hypercube\",\"authors\":\"S. Robbins, K.A. Robbins\",\"doi\":\"10.1109/PARBSE.1990.77181\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of electing a leader via message passing on a network is a fundamental problem in distributed processing. The authors present a simple algorithm for election of a leader on a hypercube with n nodes in O(n) messages.<<ETX>>\",\"PeriodicalId\":389644,\"journal\":{\"name\":\"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PARBSE.1990.77181\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PARBSE.1990.77181","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

摘要

通过网络上的消息传递来选举领导者的问题是分布式处理中的一个基本问题。给出了一个在O(n)个消息中，在n个节点的超立方体上选举领导者的简单算法

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

查看原文本刊更多论文

Choosing a leader on a hypercube

The problem of electing a leader via message passing on a network is a fundamental problem in distributed processing. The authors present a simple algorithm for election of a leader on a hypercube with n nodes in O(n) messages.<>

求助全文

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

来源期刊

Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications

自引率

0.00%

发文量