Arnborg. S. "Optimal Memory Management in a System with Garbage Collection". BIT 1-t (197,t), 375-381. Arvind and Gostelow, K. "Some Relationships. between Asynchronous Interpreters of a Dataflow Language" IFIP Working Conference on Formal Description of Programming Concepts. 31 july to 5 August, 1977. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Actor Systems for Real-Time Computation - Baker, Jr. (1978) (6 citations) (Correct)
....to restrict these domains to be exactly what we want. As a result, our models turn out. to beled on .r c6s. tather taaan sets. Scott [78,79] has considered the problem of such recursive defined domains, and his work is .considered to. put such things on a proper foundation. 14. Will.Clinger [3] and Valdis Berzin [14] have recently discovered th. the discreteness of the combined ordering is independent of a l the other actor axioms. 15. Although arbiters form a scheduling mechanlsm .that is locally fair, an .arbiter cannot ensure that messages which are delayed in ttansmiuioate ....
....If it still is the target of an edge from some accessible cell then it either already has, or will be, traced through that edge. Finally, if either both p and q have been traced or both haye n. ot been, there is obviously no problem. This algorithm can also be proved correct by the methods of DL [31,3], because this partictdar sequence of inerleaying collection with mutation is only one .o the legal execution sequences of the DL algorithm:on a serial machine. Th ei fore, if the DL algorithm is correct, then so is this one. The correspondence is this: Ae nodes are those which resice in ....
[Article contains additional citation context not shown here]
Arnborg. S. "Optimal Memory Management in a System with Garbage Collection". BIT 1-t (197,t), 375-381. Arvind and Gostelow, K. "Some Relationships. between Asynchronous Interpreters of a Dataflow Language" IFIP Working Conference on Formal Description of Programming Concepts. 31 july to 5 August, 1977.
List Processing in Real Time on a Serial Computer - Baker, Jr. (1978) (175 citations) (Correct)
....a real memory computer would use, should give both a fast CONS and a tolerable working set size. The parameter k can also be dynamically adjusted to optimize either running time (including paging) or cost according to some pricing policy by following an analysis similar to that of Hoare and others [2,10,21]. 3) A Database Management System. We conceive of a huge database having millions of records, which may contain pointers to other records, being managed by our algorithm. Examples of such databases are a bill of materials database for the Apollo Project, or a complete semantic dictionary and ....
Arnborg, S. Optimal memory management in a system with garbage collection. BIT 14 (1974), 375-381.
Garbage Collecting The Internet - Abdullahi, Ringwood (Correct)
No context found.
Arnborg S (1974) Optimal memory management in a system with garbage collection, BIT 14, 375-381.
Empirical Studies of Distributed Garbage Collection - Abdullahi (1995) (2 citations) (Correct)
No context found.
Arnborg S: Optimal memory management in a system with garbage collection, BIT 14, 375-381.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC