The software lookaside buffler reduces search overhead with linked lists

Gerald Bozman

doi:10.1145/357994.358020

CACM

Paper

01 Mar 1984

The software lookaside buffler reduces search overhead with linked lists

Download paper

Abstract

Acting as the software analog to the hardware cache, the lookaside buffer saves significant overhead when the search distribution against linked lists is sufficiently nonuniform. © 1984, ACM. All rights reserved.

Paper

Tight bounds for delay-sensitive aggregation

Yvonne Anne Pignolet, Stefan Schmid, et al.

Discrete Mathematics and Theoretical Computer Science

Conference paper

Global routing revisited

Michael D. Moffitt

ICCAD 2009

Paper

Iterative Toeplitz solvers with local quadratic convergence

Elliot Linzer, M. Vetterli

Computing

Conference paper

Anomalous interface degradation of a-Si:H TFTs during LCD lifetime

Frank R. Libsch, Takatoshi Tsujimura

Active Matrix Liquid Crystal Displays Technology and Applications 1997

View all publications

Abstract

Related

Tight bounds for delay-sensitive aggregation

Global routing revisited

Iterative Toeplitz solvers with local quadratic convergence

Anomalous interface degradation of a-Si:H TFTs during LCD lifetime