Sciweavers

3148 search results - page 268 / 630
» On the Dynamic Initialization of Parallel Computers
Sort
View
ICPP
1998
IEEE
15 years 8 months ago
A memory-layout oriented run-time technique for locality optimization
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
Yong Yan, Xiaodong Zhang, Zhao Zhang
IPPS
1996
IEEE
15 years 8 months ago
Maximizing Speedup through Self-Tuning of Processor Allocation
We address the problem of maximizing application speedup through runtime, self-selection of an appropriate number of processors on which to run. Automatic, runtime selection of pr...
Thu D. Nguyen, Raj Vaswani, John Zahorjan
PVM
1997
Springer
15 years 8 months ago
Performance of CAP-Specified Linear Algebra Algorithms
The traditional approach to the parallelization of linear algebra algorithms such as matrix multiplication and LU factorization calls for static allocation of matrix blocks to proc...
Marc Mazzariol, Benoit A. Gennart, Vincent Messerl...
PODC
2009
ACM
15 years 10 months ago
Brief announcement: new bounds for the controller problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic distributed tool that an abstraction for managing the consumption of a global resource i...
Yuval Emek, Amos Korman
IPPS
2007
IEEE
15 years 10 months ago
Modeling Modern Micro-architectures using CASL
We overview CASL, the CoGenT Architecture Specification Language, a mixed behavioral-structure architecture description language designed to facilitate fast prototyping and tool ...
Edward K. Walters II, J. Eliot B. Moss, Trek S. Pa...