Sciweavers

146 search results - page 28 / 30
» Two memory allocators that use hints to improve locality
Sort
View
ADHOC
2006
116views more  ADHOC 2006»
13 years 6 months ago
Efficient clustering algorithms for self-organizing wireless sensor networks
Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy reso...
Rajesh Krishnan, David Starobinski
ICS
2005
Tsinghua U.
13 years 11 months ago
Lightweight reference affinity analysis
Previous studies have shown that array regrouping and structure splitting significantly improve data locality. The most effective technique relies on profiling every access to eve...
Xipeng Shen, Yaoqing Gao, Chen Ding, Roch Archamba...
HPCA
2004
IEEE
14 years 6 months ago
Accurate and Complexity-Effective Spatial Pattern Prediction
Recent research suggests that there are large variations in a cache's spatial usage, both within and across programs. Unfortunately, conventional caches typically employ fixe...
Chi F. Chen, Se-Hyun Yang, Babak Falsafi, Andreas ...
INFOCOM
2006
IEEE
14 years 1 days ago
Utility-Optimal Medium Access Control: Reverse and Forward Engineering
— This paper analyzes and designs medium access control (MAC) protocols for wireless ad-hoc networks through the network utility maximization (NUM) framework. We first reverse-e...
Jang-Won Lee, Mung Chiang, A. Robert Calderbank
ANCS
2008
ACM
13 years 8 months ago
On design of bandwidth scheduling algorithms for multiple data transfers in dedicated networks
The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data tran...
Yunyue Lin, Qishi Wu