Markov Model Prediction of I/O Requests for Scientific Applications

Given the increasing performance disparity between processors and storage devices, exploiting knowledge of spatial and temporal I/O requests is critical to achieving high performance, particularly on parallel systems. Although perfect fore-knowledge of I/O requests is rarely possible, even estimates of request patterns can potentially yield large performance gains. This paper evaluates Markov models to represent the spatial patterns of I/O requests in scientific codes. The paper also proposes three algorithms for I/O prefetching. Evaluation using I/O traces from scientific codes shows that highly accurate prediction of spatial access patterns, resulting in reduced execution times, is possible

Markov model prediction of I/O requests for scientific applications

×�ÒØ Ø� � ×Ô�Ø��Ð Ô�ØØ�ÖÒ × Ó � Á Ç Ö�ÕÙ�×Ø × �Ò × ��ÒØ� ¬ Ó��× Ì� � Ô�Ô�Ö �Ð×Ó ÔÖÓÔÓ×� × Ø�Ö� � �Ð�ÓÖ�Ø�Ñ × �ÓÖ Á Ç ÔÖ���Ø � �Ò � �Ú�ÐÙ�Ø�ÓÒ Ù×�Ò � Á Ç ØÖ � � × �ÖÓÑ × ��ÒØ� ¬ Ó�� × ×�ÓÛ× Ø��Ø ����ÐÝ � ÙÖ�Ø � ÔÖ�� � Ø�ÓÒ Ó � ×Ô�Ø��Ð � �× × Ô�ØØ�ÖÒ× Ö�×ÙÐØ�Ò � �Ò Ö��Ù � � �Ü � ÙØ�ÓÒ Ø�Ñ� × � × ÔÓ××��Ð� Categories and Subject Descriptors � � � �ÇÔ�Ö�Ø�Ò � ËÝ×Ø�Ñ×℄ � È�Ö�ÓÖÑ�Ò ��ÑÓ��Ð�Ò � �Ò