Sciweavers

3145 search results - page 312 / 629
» Algebraic Linear Orderings
Sort
View
IPPS
2007
IEEE
16 years 29 days ago
Library Function Selection in Compiling Octave
One way to address the continuing performance problem of high-level domain-specific languages, such as Octave or MATLAB, is to compile them to a relatively lower level language f...
Daniel McFarlin, Arun Chauhan
IPPS
2007
IEEE
16 years 29 days ago
POET: Parameterized Optimizations for Empirical Tuning
The excessive complexity of both machine architectures and applications have made it difficult for compilers to statically model and predict application behavior. This observatio...
Qing Yi, Keith Seymour, Haihang You, Richard W. Vu...
ISPDC
2007
IEEE
16 years 28 days ago
On Grid-based Matrix Partitioning for Heterogeneous Processors
The problem of optimal matrix partitioning for parallel linear algebra on p heterogeneous processors is typically reduced to the geometrical problem of partitioning a unit square ...
Alexey L. Lastovetsky
IPPS
2006
IEEE
16 years 20 days ago
Effecting parallel graph eigensolvers through library composition
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
A. Breuer, Peter Gottschling, Douglas Gregor, Andr...
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
16 years 18 days ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert