Multi-processor systems have become the standard in current computer architectures. Software developers have the possibility to take advantage of the additional computing power available to concurrent programs. This paper presents a way to automatically use additional processors, by performing memory management concurrently. A new architecture with little explicit synchronization for concurrent lazy cyclic reference counting is described. This architecture was implemented and preliminary performance tests point at significant efficiency improvements over the sequential counterpart
Moving threads is a theoretically interesting approach for mapping the computation of an application...
This paper presents a concurrent execution model and its micro-architecture based on in-order RISC p...
Research supported by EU research grant FP7/2007/215216 Apple-COREWe present a first evaluation of o...
Reference counting is a widely employed memory management technique, in which garbage collection ope...
As an alternative to mark-scan algorithms Lins presents a shared memory architecture for parallel cy...
The notion of counting is central to a number of basic multiprocessor coordination problems, such as...
Reference Counting is the memory management technique of most widespread use today. Very often appli...
The counting problem requires n asynchronous processors to assign themselves successive values. A so...
The notion of counting is central to a number of basic multiprocessor coordination problems, such as...
We present a first evaluation of our novel approach for non- deferred reference counting on the Micr...
AbstractWe present an efficient memory management scheme for concurrent programming languages where ...
This dissertation has two parts, one addressing issues in the area of computer-aided software develo...
There is a broad design space for concurrent computer processors: they can be optimized for low powe...
Manual memory management is error prone. Some of the errors it causes, in particular memory leaks an...
AbstractIn this paper we study implementations of concurrent counters, which count modulo some (larg...
Moving threads is a theoretically interesting approach for mapping the computation of an application...
This paper presents a concurrent execution model and its micro-architecture based on in-order RISC p...
Research supported by EU research grant FP7/2007/215216 Apple-COREWe present a first evaluation of o...
Reference counting is a widely employed memory management technique, in which garbage collection ope...
As an alternative to mark-scan algorithms Lins presents a shared memory architecture for parallel cy...
The notion of counting is central to a number of basic multiprocessor coordination problems, such as...
Reference Counting is the memory management technique of most widespread use today. Very often appli...
The counting problem requires n asynchronous processors to assign themselves successive values. A so...
The notion of counting is central to a number of basic multiprocessor coordination problems, such as...
We present a first evaluation of our novel approach for non- deferred reference counting on the Micr...
AbstractWe present an efficient memory management scheme for concurrent programming languages where ...
This dissertation has two parts, one addressing issues in the area of computer-aided software develo...
There is a broad design space for concurrent computer processors: they can be optimized for low powe...
Manual memory management is error prone. Some of the errors it causes, in particular memory leaks an...
AbstractIn this paper we study implementations of concurrent counters, which count modulo some (larg...
Moving threads is a theoretically interesting approach for mapping the computation of an application...
This paper presents a concurrent execution model and its micro-architecture based on in-order RISC p...
Research supported by EU research grant FP7/2007/215216 Apple-COREWe present a first evaluation of o...