Sciweavers

2924 search results - page 537 / 585
» Lower Bounds in Distributed Computing
Sort
View
PPOPP
2012
ACM
12 years 3 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
DAC
2009
ACM
14 years 8 months ago
Exploring serial vertical interconnects for 3D ICs
Three-dimensional integrated circuits (3D ICs) offer a promising solution to overcome the on-chip communication bottleneck and improve performance over traditional two-dimensional...
Sudeep Pasricha
ICC
2007
IEEE
164views Communications» more  ICC 2007»
14 years 2 months ago
An Application-Driven Mobility Management Scheme for Hierarchical Mobile IPv6 Networks
— Mobile users are expected to be highly dynamic in next generation mobile networks. Additionally they will be served a wide variety of services with different transmission rates...
Tarik Taleb, Yuji Ikeda, Kazuo Hashimoto, Yoshiaki...
LCN
2006
IEEE
14 years 1 months ago
Performance Limits and Analysis of Contention-based IEEE 802.11 MAC
— Recent advance in IEEE 802.11 based standard has pushed the wireless bandwidth up to 600Mbps while keeping the same wireless medium access control (MAC) schemes for full backwa...
Shao-Cheng Wang, Ahmed Helmy
APPT
2005
Springer
14 years 1 months ago
Static Partitioning vs Dynamic Sharing of Resources in Simultaneous MultiThreading Microarchitectures
Simultaneous MultiThreading (SMT) achieves better system resource utilization and higher performance because it exploits ThreadLevel Parallelism (TLP) in addition to “conventiona...
Chen Liu, Jean-Luc Gaudiot