JLP
2010
12 years 11 months ago
2010
Abstract. Noting that the usual `propositionally' based way of composing retrenchments can yield many `junk' cases, alternative approaches to composition are introduced (...
MICRO
2010
IEEE
13 years 2 months ago
2010
IEEE
The ever-increasing importance of main memory latency and bandwidth is pushing CMPs towards caches with higher capacity and associativity. Associativity is typically improved by in...
APAL
2010
13 years 4 months ago
2010
Abstract. We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existin...
SODA
2003
ACM
13 years 5 months ago
2003
ACM
We tackle the problem of online paging on two level memories with arbitrary associativity (including victim caches, skewed caches etc.). We show that some important classes of pag...
MICRO
2003
IEEE
13 years 9 months ago
2003
IEEE
Abstract—High-speed routers often use commodity, fully-associative, TCAMs (Ternary Content Addressable Memories) to perform packet classification and routing (IP lookup). We prop...
INFOCOM
2005
IEEE
13 years 10 months ago
2005
IEEE
—IP-Lookup is a challenging problem because of the increasing routing table sizes, increased traffic, and higher speed links. These characteristics lead to the prevalence of hard...