Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Many applications of parallel I/O perform non-contiguous file accesses: instead of accessing a single (large) block of data in a file, a number of (smaller) blocks of data scattered throughout the file needs to be accessed in each logical I/O operation. Hover, only few file system interfaces directly support this kind of non-contiguous file access. In contrast, the most commonly used parallel programming interface, MPI, incorporates a exible model of parallel I/O through its MPI-IO interface. With MPI-IO, arbitrary non-contiguous file accesses are supported in a uniform fashion by the use of derived MPI datatypes set up by the user to re ect the desired I/O pattern. Despite a considerable amount of recent work in this area, current MPI-IO implementations suffer from low performance of such non-contiguous accesses when compared to the performance of the storage system for contiguous accesses.   analyze an important bottleneck in the efficient handling of non-contiguous access patterns in current implementations of MPI-IO.  present a new technique, termed listless I/O, that can be incorporated into MPI-IO implementations like the ll-known ROMIO implementation, and completely eliminates this bottleneck.  have implemented the technique in MPI/SX, the MPI implementation for the NEC SX-series of parallel vector computers. Results with a synthetic benchmark and an application kernel show that listless I/O is able to increase the bandwidth for non-contiguous file access by sometimes more than a factor of 500 when compared to the traditional approach.
['Joachim Worringen', 'Jesper Larsson Träff', 'Hubert Ritzdorf']
I am writing a research paper on a idea Fast Parallel Non-Contiguous File Access
[{"from": "human", "value": "I am writing a research paper on a idea Fast Parallel Non-Contiguous File Access"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Many applications of parallel I/O perform non-contiguous file accesses: instead of accessing a single (large) block of data in a file, a number of (smaller) blocks of data scattered throughout the file needs to be accessed in each logical I/O operation. Hover, only few file system interfaces directly support this kind of non-contiguous file access. In contrast, the most commonly used parallel programming interface, MPI, incorporates a exible model of parallel I/O through its MPI-IO interface. With MPI-IO, arbitrary non-contiguous file accesses are supported in a uniform fashion by the use of derived MPI datatypes set up by the user to re ect the desired I/O pattern. Despite a considerable amount of recent work in this area, current MPI-IO implementations suffer from low performance of such non-contiguous accesses when compared to the performance of the storage system for contiguous accesses.   analyze an important bottleneck in the efficient handling of non-contiguous access patterns in current implementations of MPI-IO.  present a new technique, termed listless I/O, that can be incorporated into MPI-IO implementations like the ll-known ROMIO implementation, and completely eliminates this bottleneck.  have implemented the technique in MPI/SX, the MPI implementation for the NEC SX-series of parallel vector computers. Results with a synthetic benchmark and an application kernel show that listless I/O is able to increase the bandwidth for non-contiguous file access by sometimes more than a factor of 500 when compared to the traditional approach."}]