A measurement-based simulation study of processor co-allocation in multicluster systems

S. Banen, A.I.D. Bucur, D.H.J. Epema

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    18 Citations (Scopus)
    9 Downloads (Pure)

    Abstract

    In systems consisting of multiple clusters of processors interconnected by relatively slow network connections such as our Distributed ASCI Supercomputer (DAS), applications may benefit from the availability of processors in multiple clusters. However, the performance of single-application multicluster execution may be degraded due to the slow wide-area links. In addition, scheduling policies for such systems have to deal with more restrictions than schedulers for single clusters in that every component of a job has to fit in separate clusters. In this paper we present a measurement study of the total runtime of two applications, and of the communication time of one of them, both on single clusters and on multicluster systems. In addition, we perform simulations of several multicluster scheduling policies based on our measurement results. Our results show that in many cases, restricted forms of co-allocation in multiclusters have better performance than not allowing co-allocation at all.
    Original languageEnglish
    Title of host publicationJob Scheduling Strategies for Parallel Processing (9th International Workshop, JSSPP 2003, Seattle WA, USA, June 24, 2003. Revised Papers)
    EditorsD. Feitelson, L. Rudolph, U. Schweigelshohn
    Place of PublicationBerlin
    PublisherSpringer
    Pages105-128
    ISBN (Print)3-540-20405-9
    DOIs
    Publication statusPublished - 2003

    Publication series

    NameLecture Notes in Computer Science
    Volume2862
    ISSN (Print)0302-9743

    Fingerprint

    Dive into the research topics of 'A measurement-based simulation study of processor co-allocation in multicluster systems'. Together they form a unique fingerprint.

    Cite this