Sciweavers

40 search results - page 7 / 8
» A case for information-bound referencing
Sort
View
LCPC
2000
Springer
13 years 9 months ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips
TJS
2002
121views more  TJS 2002»
13 years 5 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...
SIAMSC
2011
177views more  SIAMSC 2011»
13 years 1 months ago
Computing f(A)b via Least Squares Polynomial Approximations
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...
Jie Chen, Mihai Anitescu, Yousef Saad
ASPLOS
2009
ACM
14 years 6 months ago
Dynamic prediction of collection yield for managed runtimes
The growth in complexity of modern systems makes it increasingly difficult to extract high-performance. The software stacks for such systems typically consist of multiple layers a...
Michal Wegiel, Chandra Krintz
ICTAI
2009
IEEE
14 years 22 days ago
Managing Authorization Provenance: A Modal Logic Based Approach
Abstract—In distributed environments, access control decisions depend on statements of multiple agents rather than only one central trusted party. However, existing policy langua...
Jinwei Hu, Yan Zhang, Ruixuan Li, Zhengding Lu