完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Lin, Ji-Cherng | |
| dc.contributor.author | Huang, Tetz C. | |
| dc.contributor.author | Mou, Nathan | |
| dc.date.accessioned | 2009-06-02T08:39:04Z | |
| dc.date.accessioned | 2020-07-05T06:33:39Z | - |
| dc.date.available | 2009-06-02T08:39:04Z | |
| dc.date.available | 2020-07-05T06:33:39Z | - |
| dc.date.issued | 2006-06-14T01:00:13Z | |
| dc.date.submitted | 2003-12-18 | |
| dc.identifier.uri | http://dspace.fcu.edu.tw/handle/2376/1914 | - |
| dc.description.abstract | The problem of locating centers of graphs has a variety of applications in the areas of transportation and communication in distributed systems. In this paper, we design and prove the correctness of a self-stabilizing algorithm which finds the center(s) for a distributed system with a tree topology. The computational model employed in this paper was introduced by Dolev et al. in [6] that assumes the read/write separate atomicity. | |
| dc.description.sponsorship | 逢甲大學,台中市 | |
| dc.format.extent | 10P. | |
| dc.format.extent | 195059 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 中華民國92年全國計算機會議 | |
| dc.subject | Self-stabilizing algorithm | |
| dc.subject | model of computation | |
| dc.subject | read/write separate atomicity | |
| dc.subject | interleaving model | |
| dc.subject.other | 其他領域 | |
| dc.title | A Self-Stabilizing Algorithm for the Center-finding Problem Assuming Read/Write Atomicity | |
| 分類: | 2003年 NCS 全國計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| OT_0212003226.pdf | 190.49 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。