We present a new scheme for a compacting garbage collector. The algorithm has been derived from observing the behavior of a function stack and is applied by annotating selected function calls. New memory is always allocated from the top of a stack; when an annotated function returns, its result is compacted and the space of temporary objects is reclaimed. A prototype of the algorithm has been i...

Prompted by claims that garbage collection can outperform stack allocation when sufficient physical memory is available, we present a careful analysis and set of cross-architecture measurements comparing these two approaches for the implementation of continuation (procedure call) frames. When the frames are allocated on a heap they require additional space, increase the amount of data transferr...

The role of obturation in root canal treatment, although considered secondary to debridement and disinfection, still remains a critical stage for a successful outcome. The aim of obturation is to seal the periradicular tissues from the residual microorganisms left in the root canal system after chemomechanical debridement. Obturation of the root canal space has been performed using various tech...

The use of switchgrass (panicum virgatum) as the feedstock for a biofuels complex requires a procedure that coordinates harvesting, drying, storage, and densification techniques with the perpetual availability of process heat from a nuclear reactor and gas from a hydrogen facility. Preparation of feedstock involves assuring a 20% moisture content and compacting the biomass into pellets that can...

This paper presents an effective and robust technique for compacting a large sequence of input vectors into a much smaller input sequence so as to reduce the circuit/gate level simulation time by orders of magnitude and maintain the accuracy of the power estimates. In particular, this paper introduces and characterizes a family of dynamic Markov trees that can model complex spatiotemporal corre...

In this paper we present a novel shared buffer scheme for network on chip applications. The proposed scheme is based on a dynamically allocated multi queue self-compacting buffer. Two physical channels share the same buffer space. This in turn provides a larger available buffer space per channel. The proposed scheme has similar performance using only sixty three percent of the buffer size that ...

Nowadays eager update everywhere replication protocols are widely proposed for replicated databases. They work together with recovery protocols in order to provide highly available and fault-tolerant information systems. This paper proposes two enhancements for reducing the recovery times, minimizing the recovery information to transfer. The idea is to consider on one hand a more realistic fail...

In interest point based human action recognition, local descriptors are used to represent information in the neighbourhood around each extracted space-time interest point. The performance of the action recognition systems highly depends on the invariance and distinctiveness of the local spatiotemporal descriptor adopted. In this paper, we propose a new descriptor based on the Wavelet Transform ...