Matches in SemOpenAlex for { <https://semopenalex.org/work/W2489760864> ?p ?o ?g. }
Showing items 1 to 61 of
61
with 100 items per page.
- W2489760864 abstract "In this dissertation we study garbage collection (GC) on the Connection Machine (CM). In traditional GC, the objective is to identify memory cells which are no longer being used by the running program, so that those cells may be used again. On the CM, what are being collected are processors. Furthermore, traditional methods are inappropriate, as they would run only on the host machine. Therefore we explore massively GC, in which the CM processors themselves are actively used in discovering which processors are garbage and which are not.Two different classes of GC are studied in this dissertation. In the first, a separate GC phase is applied to what we call binary or B-graphs, which are directed graphs in which the outdegree for nodes is less than or equal to two. If the indegree for nodes is allowed to be greater than one, then the B-graph is said to permit We study B-graphs with and without structure sharing. Counted in of steps, our algorithm has a running time of O(log(n)) in the worst case (the graph is actually a linear list) and O(log(log(n))) in the best case. Here n is the number of nodes in the graph, and a parallel step may be any operation available on the CM, including general communication.The second class of GC studied in this dissertation is GC for Association Graphs (A-graphs), which are a generalization of association lists. A-graphs are directed graphs in which the outdegree of nodes is no greater than one. Unlike conventional association lists, A-graphs may have sharing and cycles. GC for A-graphs does not happen in a separate computational phase--we incorporate it as part of the basic A-graph operations. Its running time is constant (i.e. O(1)). Furthermore, it is constant in a very genuine sense, because A-graph operations use only the CM's broadcast and global-or networks. Although the delay time across these networks would grow logarithmically if the CM were scaled to larger and larger sizes, constant time is a reasonable assumption for the bounded size of todays CMs." @default.
- W2489760864 created "2016-08-23" @default.
- W2489760864 creator A5012629809 @default.
- W2489760864 date "1992-01-01" @default.
- W2489760864 modified "2023-09-22" @default.
- W2489760864 title "Garbage collection algorithms for the connection machine" @default.
- W2489760864 hasPublicationYear "1992" @default.
- W2489760864 type Work @default.
- W2489760864 sameAs 2489760864 @default.
- W2489760864 citedByCount "0" @default.
- W2489760864 crossrefType "journal-article" @default.
- W2489760864 hasAuthorship W2489760864A5012629809 @default.
- W2489760864 hasConcept C105122174 @default.
- W2489760864 hasConcept C11413529 @default.
- W2489760864 hasConcept C114614502 @default.
- W2489760864 hasConcept C118615104 @default.
- W2489760864 hasConcept C132525143 @default.
- W2489760864 hasConcept C173608175 @default.
- W2489760864 hasConcept C199360897 @default.
- W2489760864 hasConcept C33923547 @default.
- W2489760864 hasConcept C41008148 @default.
- W2489760864 hasConcept C75403996 @default.
- W2489760864 hasConcept C80444323 @default.
- W2489760864 hasConceptScore W2489760864C105122174 @default.
- W2489760864 hasConceptScore W2489760864C11413529 @default.
- W2489760864 hasConceptScore W2489760864C114614502 @default.
- W2489760864 hasConceptScore W2489760864C118615104 @default.
- W2489760864 hasConceptScore W2489760864C132525143 @default.
- W2489760864 hasConceptScore W2489760864C173608175 @default.
- W2489760864 hasConceptScore W2489760864C199360897 @default.
- W2489760864 hasConceptScore W2489760864C33923547 @default.
- W2489760864 hasConceptScore W2489760864C41008148 @default.
- W2489760864 hasConceptScore W2489760864C75403996 @default.
- W2489760864 hasConceptScore W2489760864C80444323 @default.
- W2489760864 hasLocation W24897608641 @default.
- W2489760864 hasOpenAccess W2489760864 @default.
- W2489760864 hasPrimaryLocation W24897608641 @default.
- W2489760864 hasRelatedWork W148616101 @default.
- W2489760864 hasRelatedWork W1578168283 @default.
- W2489760864 hasRelatedWork W1969757713 @default.
- W2489760864 hasRelatedWork W2004350101 @default.
- W2489760864 hasRelatedWork W206295951 @default.
- W2489760864 hasRelatedWork W2070569829 @default.
- W2489760864 hasRelatedWork W2089937506 @default.
- W2489760864 hasRelatedWork W2099012404 @default.
- W2489760864 hasRelatedWork W2108386843 @default.
- W2489760864 hasRelatedWork W2160774470 @default.
- W2489760864 hasRelatedWork W2219148196 @default.
- W2489760864 hasRelatedWork W2227329932 @default.
- W2489760864 hasRelatedWork W2266008294 @default.
- W2489760864 hasRelatedWork W2286561570 @default.
- W2489760864 hasRelatedWork W2396766219 @default.
- W2489760864 hasRelatedWork W2613194369 @default.
- W2489760864 hasRelatedWork W2746574808 @default.
- W2489760864 hasRelatedWork W2754152676 @default.
- W2489760864 hasRelatedWork W2765269579 @default.
- W2489760864 hasRelatedWork W2829649674 @default.
- W2489760864 isParatext "false" @default.
- W2489760864 isRetracted "false" @default.
- W2489760864 magId "2489760864" @default.
- W2489760864 workType "article" @default.