Message analysis-guided allocation and low-pause incremental garbage collection in a concurrent language

Sagonas, K; Wilhelmsson, J

dc.contributor.author	Sagonas, K	en
dc.contributor.author	Wilhelmsson, J	en
dc.date.accessioned	2014-03-01T02:49:40Z
dc.date.available	2014-03-01T02:49:40Z
dc.date.issued	2004	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34673
dc.subject	Concurrent Language	en
dc.subject	Concurrent Programs	en
dc.subject	Functional Language	en
dc.subject	Garbage Collection	en
dc.subject	Large Scale	en
dc.subject	Memory Management	en
dc.subject	Message Passing	en
dc.subject	Real-time Garbage Collection	en
dc.subject	Runtime System	en
dc.subject	Shared Memory	en
dc.subject	Soft Real Time	en
dc.subject	Static Analysis	en
dc.title	Message analysis-guided allocation and low-pause incremental garbage collection in a concurrent language	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1145/1029873.1029875	en
heal.identifier.secondary	http://dx.doi.org/10.1145/1029873.1029875	en
heal.publicationDate	2004	en
heal.abstract	We present a memory management scheme for a concurrent programming language where communication occurs using message-passing with copying semantics. The runtime system is built around process-local heaps, which frees the memory manager from redundant synchronization in a multithreaded implementation and allows the memory reclamation of process-local heaps to be a private business and to often take place without garbage collection.	en
heal.journalName	International Symposium on Memory Management	en
dc.identifier.doi	10.1145/1029873.1029875	en