Conference Paper

Performance of Network Subsystems for a Technical Simulation on Linux Clusters.

Conference: International Conference on Parallel and Distributed Computing Systems, PDCS 2005, November 14-16, 2005, Phoenix, AZ, USA
Source: DBLP
Download full-text

Full-text

Available from: Linn Gustavsson Christiernin, Apr 16, 2014
  • Source
    • "The most commonly used message passing environment in the simulation industry is MPI (Boklund, et al., 2005). MPI is a specification of a message passing library that is maintained by the MPI Forum (MpiForum) and it is available for most operating systems and computer architectures. "
    [Show abstract] [Hide abstract]
    ABSTRACT: The focus of this paper is to evaluate the use of two different network topologies for Ethernet networks in small Common Off The Shelf (COTS) clusters. The fully meshed network topology was evaluated and its impact on latency and bandwidth was measured and compared to the more traditional switched network topology. This was done at MPI level by measuring the point-to-point round trip latency (ping-pong) and all-to-alla bandwidth for different sized messages. The results from the experiments are presented and the overall the benefits and drawbacks of the both approaches are discussed.
    Full-text · Conference Paper · May 2006
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The study presented in this paper highlights an important issue that was subject for discussions and research about a decade ago and now have gained new interest with the current advances of grid computing and desktop grids. New techniques are being invented on how to utilize desktop computers for computational tasks but no other study, to our knowledge, has explored the availability of the said resources. The general assumption has been that there are resources and that they are available. The study is based on a survey on the availability of resources in an ordinary office environment. The aim of the study was to determine if there are truly usable under-utilized networked desktop computers available for non-desktop tasks during the off-hours. We found that in more than 96% of the cases the computers in the current investigation was available for the formation of part-time (night and weekend) computer clusters. Finally we compare the performance of a full time and a metamorphosic cluster, based on one hypothetical linear scalable application and a real world welding simulation.
    Full-text · Article · May 2010 · Journal of Circuits System and Computers
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The ability to precisely predict how memory contention degrades performance when co-scheduling programs is critical for reaching high performance levels in cluster, grid and cloud environments. In this paper we present an overview and compare the performance of state-of-the-art characterization methods for memory aware (co-)scheduling. We evaluate the prediction accuracy and co-scheduling performance of four methods: one slowdown-based, two cache-contention based and one based on memory bandwidth usage. Both our regression analysis and scheduling simulations find that the slowdown based method, represented by Memgen, performs better than the other methods. The linear correlation coefficient \(R^2\) of Memgen’s prediction is 0.890. Memgen’s preferred schedules reached 99.53 % of the obtainable performance on average. Also, the memory bandwidth usage method performed almost as well as the slowdown based method. Furthermore, while most prior work promote characterization based on cache miss rate we found it to be on par with random scheduling of programs and highly unreliable.
    Full-text · Article · Apr 2015 · The Journal of Supercomputing