Sciweavers

25 search results - page 2 / 5
» Localizing Non-Affine Array References
Sort
View
ICS
1999
Tsinghua U.
13 years 11 months ago
Nonlinear array layouts for hierarchical memory systems
Programming languages that provide multidimensional arrays and a flat linear model of memory must implement a mapping between these two domains to order array elements in memory....
Siddhartha Chatterjee, Vibhor V. Jain, Alvin R. Le...
ICS
2005
Tsinghua U.
14 years 29 days 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...
TJS
2002
121views more  TJS 2002»
13 years 7 months ago
Precise Data Locality Optimization of Nested Loops
A significant source for enhancing application performance and for reducing power consumption in embedded processor applications is to improve the usage of the memory hierarchy. In...
Vincent Loechner, Benoît Meister, Philippe C...
VLDB
1999
ACM
151views Database» more  VLDB 1999»
13 years 11 months ago
Cache Conscious Indexing for Decision-Support in Main Memory
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
Jun Rao, Kenneth A. Ross
BMCBI
2008
138views more  BMCBI 2008»
13 years 7 months ago
Methods for simultaneously identifying coherent local clusters with smooth global patterns in gene expression profiles
Background: The hierarchical clustering tree (HCT) with a dendrogram [1] and the singular value decomposition (SVD) with a dimension-reduced representative map [2] are popular met...
Yin-Jing Tien, Yun-Shien Lee, Han-Ming Wu, Chun-Ho...