Sciweavers

2031 search results - page 308 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
MICRO
2005
IEEE
110views Hardware» more  MICRO 2005»
14 years 3 months ago
Scalable Store-Load Forwarding via Store Queue Index Prediction
Conventional processors use a fully-associative store queue (SQ) to implement store-load forwarding. Associative search latency does not scale well to capacities and bandwidths re...
Tingting Sha, Milo M. K. Martin, Amir Roth
ANCS
2005
ACM
14 years 3 months ago
SSA: a power and memory efficient scheme to multi-match packet classification
New network applications like intrusion detection systems and packet-level accounting require multi-match packet classification, where all matching filters need to be reported. Te...
Fang Yu, T. V. Lakshman, Martin Austin Motoyama, R...
PLDI
2005
ACM
14 years 3 months ago
Garbage collection without paging
Garbage collection offers numerous software engineering advantages, but interacts poorly with virtual memory managers. Existing garbage collectors require far more pages than the ...
Matthew Hertz, Yi Feng, Emery D. Berger
UIST
2005
ACM
14 years 3 months ago
Automation and customization of rendered web pages
On the desktop, an application can expect to control its user interface down to the last pixel, but on the World Wide Web, a content provider has no control over how the client wi...
Michael Bolin, Matthew Webber, Philip Rha, Tom Wil...
ICN
2005
Springer
14 years 3 months ago
Network Traffic Sampling Model on Packet Identification
Spatially coordinated packet sampling can be implemented by using a deterministic function of packet content to determine the selection decision for a given packet. In this way, a...
Guang Cheng, Jian Gong, Wei Ding 0001