Sciweavers

2498 search results - page 143 / 500
» Data Structures with Unpredictable Timing
Sort
View
WWIC
2005
Springer
197views Communications» more  WWIC 2005»
15 years 3 months ago
Reducing Memory Fragmentation with Performance-Optimized Dynamic Memory Allocators in Network Applications
The needs for run-time data storage in modern wired and wireless network applications are increasing. Additionally, the nature of these applications is very dynamic, resulting in ...
Stylianos Mamagkakis, Christos Baloukas, David Ati...
MICRO
1998
IEEE
89views Hardware» more  MICRO 1998»
15 years 2 months ago
Load Latency Tolerance in Dynamically Scheduled Processors
This paper provides quantitative measurements of load latency tolerance in a dynamically scheduled processor. To determine the latency tolerance of each memory load operation, our...
Srikanth T. Srinivasan, Alvin R. Lebeck
PR
2006
113views more  PR 2006»
14 years 10 months ago
Face recognition from a single image per person: A survey
One of the main challenges faced by the current face recognition techniques lies in the difficulties of collecting samples. Fewer samples per person mean less laborious effort for...
Xiaoyang Tan, Songcan Chen, Zhi-Hua Zhou, Fuyan Zh...
PVLDB
2010
167views more  PVLDB 2010»
14 years 8 months ago
Runtime Measurements in the Cloud: Observing, Analyzing, and Reducing Variance
One of the main reasons why cloud computing has gained so much popularity is due to its ease of use and its ability to scale computing resources on demand. As a result, users can ...
Jörg Schad, Jens Dittrich, Jorge-Arnulfo Quia...
IPTPS
2003
Springer
15 years 3 months ago
SOMO: Self-Organized Metadata Overlay for Resource Management in P2P DHT
– In this paper, we first describe the concept of data overlay, which is a mechanism to implement arbitrary data structure on top of any structured P2P DHT. With this ion, we dev...
Zheng Zhang, Shuming Shi, Jing Zhu