ACM Transactions on Programming Languages and Systems · 2006 · 13 citations · 23 references
ComputingComputer EngineeringComputer ScienceMessage PassingProgramming LanguagesStorage SystemsConcurrency AnalysisConcurrent ProgrammingInterprocess CommunicationSynchronization PrimitivesConcurrency SemanticsInterprocess SynchronizationLanguage ImplementationMemory ArchitectureMessage-passing AlgorithmsShared-memory ArchitectureStorage AllocationSynchronization
We describe an analysis-driven storage allocation scheme for concurrent systems that use message passing with copying semantics. The basic principle is that in such a system, data which is not part of any message does not need to be allocated in a shared data area. This allows for the deallocation of thread-specific data without requiring global synchronization and often without even triggering garbage collection. On the other hand, data that is part of a message should preferably be allocated on a shared area since this allows for fast ( O (1)) interprocess communication that does not require actual copying. In the context of a dynamically typed, higher-order concurrent functional language, we present a static message analysis which guides the allocation. As shown by our performance evaluation, conducted using a production-quality language implementation, the analysis is effective enough to discover most data which is to be used as a message, and to allow the allocation scheme to combine the best performance characteristics of both a process-centric and a communal memory architecture.
23
Region-Based Memory Management
Mads Tofte, Jean-Pierre Talpin · Information and Computation · 1997 · 617 citations
The essence of compiling with continuations
Cormac Flanagan, Amr Sabry, Bruce F. Duba et al. · 1993 · 533 citations
Control flow analysis in scheme
Olin Shivers · ACM SIGPLAN Notices · 1988 · 279 citations