This work introduces S-buffer, an efficient and memory-friendly gpu-accelerated A-buffer architecture for multifragment rendering. Memory is organized into variable contiguous regions for each pixel, thus avoiding limitations set in linked-lists and fixed-array techniques. S-buffer exploits fragment distribution for precise allocation of the needed storage and pixel sparsity (empty pixel ratio)...

Repeaters are widely used to combat the quadratic delay of long on-chip wires. A conventional repeater is a CMOS inverter placed periodically along the long wire. This design has two drawbacks. The wire must have an even number of repeaters to preserve signal polarity. This forces the designer to sometimes use a suboptimal number of repeaters. It is also awkward when a wire branches because rep...

In this paper, many details of database buffer management including goals, roles, organization, and schemes are discussed. There is a focus on the LRU-K scheme and its features.

Aggregating bandwidth from multiple radio access technologies (RATs) provides an opportunity for network providers to enhance network capacity. This is important for serving applications that require more bandwidth than a single RAT can offer. One of the important elements of bandwidth aggregation is the selection of a suitable set of RATs to achieve efficient aggregation. In this paper, we pro...

Buffered crossbar switches are special crossbar switches with each crosspoint equipped with a small exclusive buffer. The crosspoint buffers decouple input ports and output ports, and simplify switch scheduling. In this paper, we propose a scheduling algorithm called Fair and Localized Asynchronous Packet Scheduling (FLAPS) for buffered crossbar switches, to provide tight performance guarantees...

This paper proposes a new MPEG-4 rate control algorithm for single or multiple object video sequences. The algorithm aims to achieve an accurate bit rate with the maximum picture quality while efficiently handling buffer fullness and scene change. In addition to estimating the bit budget of a frame based on its global coding complexity, the algorithm dynamically distributes the target bits for ...