Parallel storage systems distribute data onto several devices. This allows high access bandwidth that is needed for parallel computing systems. It also improves the storage reliability, provided erasure-tolerant coding is applied and the coding is fast enough. In this paper we assume storage systems that apply data ...

A fundamental step in the analysis of a massive graph is to compute its diameter. In the RAM model, the diameter of a connected undirected unweighted graph can be efficiently 2-approximated using a Breadth-First Search (BFS) traversal from an arbitrary node. However, if the graph is stored on disk, even an external memory ...

Job centric monitoring allows to observe jobs on remote computing resources. It may offer visualisation of recorded monitoring data and helps to find faulty or misbehaving jobs. If installations like grids or clouds are observed monitoring data of many thousands of jobs have to be handled. The challenge of job centric ...

We investigate the relation between the spectral sets (i. e., the sets of eigenvalues, disregarding multiplicities) of two d-dimensional networks popular in parallel computing: the Cube-Connected Cycles network CCC(d) and the Shuffle-Exchange network SE(d). We completely characterize their spectral sets. Additionally, ...

We describe a task model and dynamic scheduling and resource allocation mechanism for synchronous parallel tasks to be executed on SPMD-programmed synchronous shared-memory MIMD parallel architectures with uniform, unit-time memory access and strict memory consistency, also known in the literature as PRAMs (Parallel ...

Parallel computing has been a niche for scientific research in academia for decades. However, as common industrial applications become more and more performance demanding and raising the clock frequency of conventional single-core systems is hardly an option due to reaching technological limitations, efficient use of ...

G. Wellein and G. Hager Department for Computer Science and Erlangen Regional Computing Center Friedrich-Alexander-Universität Erlangen-Nürnberg In 1991, David H. Bailey published his insightful 'Twelve Ways to Fool the Masses When Giving Performance Results on Parallel Computers.' In that humorous article, Bailey ...