Sciweavers

18 search results - page 2 / 4
» Mechanism Design via Correlation Gap
Sort
View
INFOCOM
2008
IEEE
13 years 11 months ago
Evaluating the Vulnerability of Network Mechanisms to Sophisticated DDoS Attacks
—The design of computer and communication systems has been based, for decades, on the fundamental assumption that the objective of all users is to improve their own performance. ...
Udi Ben-Porat, Anat Bremler-Barr, Hanoch Levy
ISCA
2007
IEEE
145views Hardware» more  ISCA 2007»
13 years 11 months ago
Mechanisms for store-wait-free multiprocessors
Store misses cause significant delays in shared-memory multiprocessors because of limited store buffering and ordering constraints required for proper synchronization. Today, prog...
Thomas F. Wenisch, Anastassia Ailamaki, Babak Fals...
ICS
2009
Tsinghua U.
13 years 12 months ago
Less reused filter: improving l2 cache performance via filtering less reused lines
The L2 cache is commonly managed using LRU policy. For workloads that have a working set larger than L2 cache, LRU behaves poorly, resulting in a great number of less reused lines...
Lingxiang Xiang, Tianzhou Chen, Qingsong Shi, Wei ...
TMC
2012
11 years 7 months ago
Secure Initialization of Multiple Constrained Wireless Devices for an Unaided User
—A number of protocols and mechanisms have been proposed to address the problem of initial secure key deployment in wireless networks. Most existing approaches work either with a...
Toni Perkovic, Mario Cagalj, Toni Mastelic, Nitesh...
ASPLOS
1996
ACM
13 years 9 months ago
Analysis of Branch Prediction Via Data Compression
Branch prediction is an important mechanism in modern microprocessor design. The focus of research in this area has been on designing new branch prediction schemes. In contrast, v...
I-Cheng K. Chen, John T. Coffey, Trevor N. Mudge