In the aerospace sciences we produce huge amounts of data. This data must be arranged in a meaningful order, so that we can analyze or visualize it. In this paper we focus on data that is distributed among computer processes and then needs to be sorted by a single root process for further analysis. We assume that the memory on the root process is too small to hold all sorted data at once, so that we have to perform the sorting and processing of data chunk-wise. We prove the efficiency of our approach in weak scaling tests, where we achieve a near constant bandwidth. Additionally, we obtain a considerable speed up compared to the standard parallel external sort. We also demonstrate the usefulness of our algorithm in a real-life aviation application.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Data-adapted Parallel Merge Sort


    Beteiligte:


    Erscheinungsdatum :

    2019


    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    Video Frame Categorization Using Sort-Merge Feature Selection

    Liu, Y. / Kender, J. R. | British Library Conference Proceedings | 2002


    Formal Verification of a Merge Sort Algorithm in SPARK

    Baity, Ryan / Humphrey, Laura R. / Hopkinson, Kenneth | AIAA | 2021


    FORMAL VERIFICATION OF A MERGE SORT ALGORITHM IN SPARK

    Baity, Ryan / Humphrey, Laura R. / Hopkinson, Kenneth | TIBKAT | 2021