Diet: A scalable toolbox to build network enabled servers on the grid
Among existing grid middleware approaches, one simple, powerful, and flexible approach
consists of using servers available in different administrative domains through the classical …
consists of using servers available in different administrative domains through the classical …
A scalable approach to network enabled servers
This paper presents the architecture of DIET (Distributed Interactive Engineering Toolbox), a
hierarchical set of components to build Network Enabled Server applications in a Grid …
hierarchical set of components to build Network Enabled Server applications in a Grid …
Impact of mixed‐parallelism on parallel implementations of the Strassen and Winograd matrix multiplication algorithms
In this paper we study the impact of the simultaneous exploitation of data‐and task‐
parallelism, so called mixed‐parallelism, on the Strassen and Winograd matrix multiplication …
parallelism, so called mixed‐parallelism, on the Strassen and Winograd matrix multiplication …
Deadline scheduling with priority for client-server systems on the grid
E Caron, PK Chouhan… - Fifth IEEE/ACM …, 2004 - ieeexplore.ieee.org
We present algorithms for the scheduling sequential tasks on a network enabled server
(NES) environment. This article is an extension of the paper:" A Study of Deadline …
(NES) environment. This article is an extension of the paper:" A Study of Deadline …
One-step algorithm for mixed data and task parallel scheduling without data replication
In this paper we propose an original algorithm for mixed data and task parallel scheduling.
The main specificities of this algorithm are to simultaneously perform the allocation and …
The main specificities of this algorithm are to simultaneously perform the allocation and …
Combining building blocks for parallel multi-level matrix multiplication
S Hunold, T Rauber, G Rünger - Parallel Computing, 2008 - Elsevier
This paper presents parallel algorithms for matrix–matrix multiplication which are built up
from several algorithms in a multi-level structure. The upper level consists of Strassen's …
from several algorithms in a multi-level structure. The upper level consists of Strassen's …
Empirical installation of linear algebra shared-memory subroutines for auto-tuning
The introduction of auto-tuning techniques in linear algebra shared-memory routines is
analyzed. Information obtained in the installation of the routines is used at running time to …
analyzed. Information obtained in the installation of the routines is used at running time to …
Automatic deployment for hierarchical network enabled servers
E Caron, PK Chouhan… - 18th International Parallel …, 2004 - ieeexplore.ieee.org
Summary form only given. This article focuses on the deployment of grid infrastructures,
more specifically problem solving environments (PSE) for numerical applications on the grid …
more specifically problem solving environments (PSE) for numerical applications on the grid …
Auto-tuned nested parallelism: A way to reduce the execution time of scientific software in NUMA systems
The most computationally demanding scientific problems are solved with large parallel
systems. In some cases these systems are Non-Uniform Memory Access (NUMA) …
systems. In some cases these systems are Non-Uniform Memory Access (NUMA) …
A hierarchical resource reservation algorithm for network enabled servers
This paper presents the application of the PIF algorithm for resource reservation in a network
enabled server environment with distributed scheduling agents. Hierarchical scheduling is …
enabled server environment with distributed scheduling agents. Hierarchical scheduling is …