A two-class parallel system with general service times of the parallel class
A parallel system with two job classes is analyzed. Type-1 jobs require one server for their execution and have exponentially distributed service times while type-2 jobs need two servers and have general service times. The model consists of a single ...
Performance evaluation of supercomputers using HPCC and IMB Benchmarks
- Subhash Saini,
- Robert Ciotti,
- Brian T. N. Gunney,
- Thomas E. Spelce,
- Alice Koniges,
- Don Dossa,
- Panagiotis Adamidis,
- Rolf Rabenseifner,
- Sunil R. Tiyyagura,
- Matthias Mueller
The HPC Challenge (HPCC) Benchmark suite and the Intel MPI Benchmark (IMB) are used to compare and evaluate the combined performance of processor, memory subsystem and interconnect fabric of five leading supercomputers-SGI Altix BX2, Cray X1, Cray ...
A simulator for adaptive parallel applications
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. Detailed simulations can help identify allocation strategies and problem decomposition parameters that increase ...
Analytic performance comparison of hypercubes and star graphs with implementation constraints
Many theoretical-based comparison studies, relying on graph structural and algorithmic properties, have been conducted for the hypercube and the star graph. None of these studies, however, have considered real working conditions and implementation ...
Analysing distributed Internet worm attacks using continuous state-space approximation of process algebra models
Internet worms are classically described using SIR models and simulations, to capture the massive dynamics of the system. Here we are able to generate a differential equation-based model of infection based solely on the underlying process description of ...
A new general method to compute virtual channels occupancy probabilities in wormhole networks
Virtual channels have been proposed to develop deadlock free routing algorithms and to overcome the performance degradation due to chains of blocked messages in wormhole switched networks. Hence, capturing the effect of virtual channels has always been ...
An Adaptive Dynamic Grid-Based approach to DDM for large-scale distributed simulation systems
Data Distribution Management (DDM) plays a key role in traffic volume control of large-scale distributed simulations. In recent years, several solutions have been devised to make DDM more efficient and adaptive to different traffic conditions. Examples ...
A heuristic flow-decomposition approach for generalized processor sharing under self-similar traffic
The well-known Generalized Processor Sharing (GPS) scheduling principle and its variants have received tremendous research efforts due to their appealing properties of fairness, traffic isolation, and work conservation. Traffic self-similarity is highly ...
Comparing job allocation schemes where service demand is unknown
In this paper a novel job allocation scheme in distributed systems (TAGS) is modelled using the Markovian process algebra PEPA. This scheme requires no prior knowledge of job size and has been shown to be more efficient than round robin and random ...
A framework for adaptive collective communications for heterogeneous hierarchical computing systems
Collective communication operations are widely used in MPI applications and play an important role in their performance. However, the network heterogeneity inherent to grid environments represent a great challenge to develop efficient high performance ...