Sciweavers

1929 search results - page 154 / 386
» Load Balancing with Memory
Sort
View
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
15 years 8 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
HPCA
2006
IEEE
16 years 3 months ago
Software-hardware cooperative memory disambiguation
In high-end processors, increasing the number of in-flight instructions can improve performance by overlapping useful processing with long-latency accesses to the main memory. Buf...
Ruke Huang, Alok Garg, Michael C. Huang
MICRO
2006
IEEE
89views Hardware» more  MICRO 2006»
15 years 9 months ago
DMDC: Delayed Memory Dependence Checking through Age-Based Filtering
One of the main challenges of modern processor design is the implementation of a scalable and efficient mechanism to detect memory access order violations as a result of out-of-o...
Fernando Castro, Luis Piñuel, Daniel Chaver...
IS
2008
15 years 3 months ago
Efficient memory representation of XML document trees
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
Giorgio Busatto, Markus Lohrey, Sebastian Maneth
BC
1999
81views more  BC 1999»
15 years 2 months ago
Error tolerant associative memory
Abstract-- This paper surveys two advanced associative memory models[8][5]. The first model was derived from the projection on a closed convex set spanned by patterns. The second m...
Cheng-Yuan Liou, Shao-Kuo Yuan