Sciweavers

53 search results - page 4 / 11
» Explaining Dynamic Cache Partitioning Speed Ups
Sort
View
CLUSTER
2006
IEEE
14 years 1 months ago
Positioning Dynamic Storage Caches for Transient Data
Simulations, experiments and observatories are generating a deluge of scientific data. Even more staggering is the ever growing application demand to process and assimilate these...
Sudharshan S. Vazhkudai, Douglas Thain, Xiaosong M...
PLDI
2005
ACM
14 years 1 months ago
Code placement for improving dynamic branch prediction accuracy
Code placement techniques have traditionally improved instruction fetch bandwidth by increasing instruction locality and decreasing the number of taken branches. However, traditio...
Daniel A. Jiménez
IPPS
2007
IEEE
14 years 2 months ago
Route Table Partitioning and Load Balancing for Parallel Searching with TCAMs
With the continuous advances in optical communications technology, the link transmission speed of Internet backbone has been increasing rapidly. This in turn demands more powerful...
Dong Lin, Yue Zhang 0006, Chengchen Hu, Bin Liu, X...
ICIP
2008
IEEE
14 years 2 months ago
Augmented tree partitioning for interactive image segmentation
In this paper, we propose a new fast semi-supervised image segmentation method based on augmented tree partitioning. Unlike many existing methods that use a graph structure to mod...
Yangqing Jia, Jingdong Wang, Changshui Zhang, Xian...
ICS
2007
Tsinghua U.
14 years 1 months ago
Performance driven data cache prefetching in a dynamic software optimization system
Software or hardware data cache prefetching is an efficient way to hide cache miss latency. However effectiveness of the issued prefetches have to be monitored in order to maximi...
Jean Christophe Beyler, Philippe Clauss