Over the years, scientific applications have become more complex and more data intensive. Especially large scale simulations and scientific experiments in areas such as physics, biology, astronomy and earth sciences demand highly distributed resources to satisfy excessive computational requirements. Increasing data requirements and the distributed nature of the resources made I/O the major bott...

We present a simulation study of several prefetching policies to improve the I/O performance of external merging using parallel I/O. In particular we consider traditional sequential prefetch, forecast-based greedy prefetching, and oblivious prefetching. In conjunction with the prefetching policies we evaluate the bene t of two di erent data placement strategies: run-level striping and block-ran...

We propose a novel method for solving optimal sensor placement problem high-dimensional system using an annealing machine. The points are calculated as maximum clique of the graph, edge weight which is determined by proper orthogonal decomposition mode obtained from data based on fact that usually has low-dimensional representation. Since equivalent to independent set complement solved Fujitsu ...