Sciweavers

12670 search results - page 2391 / 2534
» Requirements Modeling
Sort
View
MICRO
2009
IEEE
132views Hardware» more  MICRO 2009»
16 years 28 days ago
EazyHTM: eager-lazy hardware transactional memory
Transactional Memory aims to provide a programming model that makes parallel programming easier. Hardware implementations of transactional memory (HTM) suffer from fewer overhead...
Sasa Tomic, Cristian Perfumo, Chinmay Eishan Kulka...
MICRO
2009
IEEE
168views Hardware» more  MICRO 2009»
16 years 28 days ago
Ordering decoupled metadata accesses in multiprocessors
Hardware support for dynamic analysis can minimize the performance overhead of useful applications such as security checks, debugging, and profiling. To eliminate implementation ...
Hari Kannan
ACNS
2009
Springer
168views Cryptology» more  ACNS 2009»
16 years 27 days ago
How to Extract and Expand Randomness: A Summary and Explanation of Existing Results
Abstract. We examine the use of randomness extraction and expansion in key agreement (KA) protocols to generate uniformly random keys in the standard model. Although existing works...
Yvonne Cliff, Colin Boyd, Juan Manuel Gonzá...
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
16 years 26 days ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
WDAG
2009
Springer
147views Algorithms» more  WDAG 2009»
16 years 26 days ago
Compact Routing in Power-Law Graphs
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
Wei Chen, Christian Sommer 0002, Shang-Hua Teng, Y...
« Prev « First page 2391 / 2534 Last » Next »