重命名问题的介绍

2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings. Pub Date : 2002-12-16 DOI:10.1109/PRDC.2002.1185627

M. Raynal

{"title":"重命名问题的介绍","authors":"M. Raynal","doi":"10.1109/PRDC.2002.1185627","DOIUrl":null,"url":null,"abstract":"The aim of this paper is to provide a brief introduction to the renaming problem for unfamiliar readers. In the renaming problem the processes have to acquire new names from a small bounded space despite possible process crashes and asynchrony. The problem is first introduced. Then two solutions are presented. One considers the shared memory model, while the second considers the message-passing model.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An introduction to the renaming problem\",\"authors\":\"M. Raynal\",\"doi\":\"10.1109/PRDC.2002.1185627\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The aim of this paper is to provide a brief introduction to the renaming problem for unfamiliar readers. In the renaming problem the processes have to acquire new names from a small bounded space despite possible process crashes and asynchrony. The problem is first introduced. Then two solutions are presented. One considers the shared memory model, while the second considers the message-passing model.\",\"PeriodicalId\":362330,\"journal\":{\"name\":\"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PRDC.2002.1185627\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PRDC.2002.1185627","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

本文的目的是为不熟悉的读者提供一个简单的介绍重命名问题。在重命名问题中，进程必须从一个小的有限空间中获取新名称，尽管可能出现进程崩溃和异步。首先介绍了这个问题。提出了两种解决方案。一个考虑共享内存模型，而第二个考虑消息传递模型。

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

查看原文本刊更多论文

An introduction to the renaming problem

The aim of this paper is to provide a brief introduction to the renaming problem for unfamiliar readers. In the renaming problem the processes have to acquire new names from a small bounded space despite possible process crashes and asynchrony. The problem is first introduced. Then two solutions are presented. One considers the shared memory model, while the second considers the message-passing model.

求助全文

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

来源期刊

2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.

自引率

0.00%

发文量