完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Yang, Wuu | en_US |
dc.date.accessioned | 2016-03-28T00:04:12Z | - |
dc.date.available | 2016-03-28T00:04:12Z | - |
dc.date.issued | 2015-11-01 | en_US |
dc.identifier.issn | 1016-2364 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/129405 | - |
dc.description.abstract | The run-time memory of a program may be described with a directed graph in which nodes represent chunks of memory and edges represent references. We define a closed cluster induced by a node n, denoted as CC(n), as the largest set of nodes that are reachable from n but are unreachable from nodes outside the closed cluster. Based on closed clusters, there is a Brouwerian structure under the run-time memory. We present the Brouwerian model and discuss its properties, transformations, and applications. We also propose a two-counter algorithm for calculating CC(n). The two-counter algorithm is never slower than a traditional one-counter algorithm. Our study of the Brouwerian structure is motivated by work on garbage collection. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Brouwerian algebra | en_US |
dc.subject | closed cluster | en_US |
dc.subject | cyclic structure | en_US |
dc.subject | depth-first search | en_US |
dc.subject | graph theory | en_US |
dc.subject | garbage collection | en_US |
dc.subject | reference count | en_US |
dc.subject | run-time memory | en_US |
dc.subject | strongly connected component | en_US |
dc.title | A Brouwerian Model of the Run-Time Memory | en_US |
dc.type | Article | en_US |
dc.identifier.journal | JOURNAL OF INFORMATION SCIENCE AND ENGINEERING | en_US |
dc.citation.volume | 31 | en_US |
dc.citation.spage | 2103 | en_US |
dc.citation.epage | 2124 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000365243700016 | en_US |
dc.citation.woscount | 0 | en_US |
顯示於類別: | 期刊論文 |