Improving the average response time in collective I/O

Chen Jin*, Saba Sehrish, Wei Keng Liao, Alok Choudhary, Karen Schuchardt

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations


In collective I/O, MPI processes exchange requests so that the rearranged requests can result in the shortest file system access time. Scheduling the exchange sequence determines the response time of participating processes. Existing implementations that simply follow the increasing order of file offsets do not necessary produce the best performance. To minimize the average response time, we propose three scheduling algorithms that consider the number of processes per file stripe and the number of accesses per process. Our experimental results demonstrate improvements of up to 50% in the average response time using two synthetic benchmarks and a high-resolution climate application.

Original languageEnglish (US)
Title of host publicationRecent Advances in the Message Passing Interface - 18th European MPI Users' Group Meeting, EuroMPI 2011, Proceedings
Number of pages10
StatePublished - 2011
Event18th European Message Passing Interface Users' Group Meeting, EuroMPI 2011 - Santorini, Greece
Duration: Sep 18 2011Sep 21 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6960 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other18th European Message Passing Interface Users' Group Meeting, EuroMPI 2011

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Improving the average response time in collective I/O'. Together they form a unique fingerprint.

Cite this