EUROPAR
2004
Springer
14 years 4 months ago
2004
Springer
In this paper we first present two tagging mechanisms; the SCISM and IA-64; thereafter we describe the mapping of IA-64 ISA to a SCISM configuration without changing or reassigni...
EUROPAR
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. In this paper we report on our experiences with hybrid parallelism in PARDISO, a high-performance sparse linear solver. We start with the OpenMP-parallel numerical factor...
EUROPAR
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. Ever-increasing demand for computing capability is driving the construction of ever-larger computer clusters, soon to be reaching tens of thousands of processors. Many fu...
EUROPAR
2004
Springer
14 years 4 months ago
2004
Springer
EUROPAR
2004
Springer
14 years 4 months ago
2004
Springer
We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of cl...
EUROPAR
2004
Springer
14 years 4 months ago
2004
Springer
Since embedded systems require ever more compute power, SMT processors are viable candidates for future high performance embedded processors. However, SMTs exhibit unpredictable pe...
EUROPAR
2004
Springer
14 years 4 months ago
2004
Springer
High scalability in Peer-to-Peer (P2P) systems has been achieved with the emergence of the networks based on Distributed Hash Table (DHT). Most of the DHTs can be regarded as expon...
EUROPAR
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. We study in this paper several scheduling heuristics for GridRPC middlewares. When dealing with performance issue, the scheduling strategy is one of the most important fe...
EUROPAR
2004
Springer
14 years 4 months ago
2004
Springer
Address correlation is a technique that links the addresses that reference the same data values. Using a detailed source-code level analysis, a recent study [1] revealed that diffe...
EUROPAR
2004
Springer
14 years 4 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...