Detection of summative global predicates
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
980 | en_US |
dc.citation.issue |
5 | en_US |
dc.citation.spage |
976 | en_US |
dc.citation.volume |
E86D | en_US |
dc.citation.woscount |
1 | |
dc.contributor.author |
Chen, LB | en_US |
dc.contributor.author |
Wu, IC | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:41:00Z | |
dc.date.available |
2014-12-08T15:41:00Z | |
dc.date.issued |
2003-05-01 | en_US |
dc.description.abstract |
In many distributed systems, tokens are fundamental tools to manage resources shared by processes. Thus, monitoring tokens has become a significant problem in developing the distributed programs. This paper formulates the problems of monitoring tokens in terms of detecting the special global predicates, called summative global predicates. In this paper, several algorithms to detect various summative global predicates are developed and their time complexities are discussed. | en_US |
dc.identifier.issn |
0916-8532 | en_US |
dc.identifier.journal |
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/27932 | |
dc.identifier.wosnumber |
WOS:000183074500024 | |
dc.language.iso |
en_US | en_US |
dc.subject |
distributed debugging | en_US |
dc.subject |
distributed system | en_US |
dc.subject |
global predicate | en_US |
dc.subject |
minimum global snapshot | en_US |
dc.title |
Detection of summative global predicates | en_US |
dc.type |
Letter | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文