@inproceedings{TAWFIJWSIB a,
	author	 = {Julian Kunkel and Eugen Betke},
	title	 = {{Toward a Workflow for Identifying Jobs with Similar I/O Behavior Utilizing Time Series Analysis}},
	year	 = {To appear},
	booktitle	 = {{High Performance Computing: ISC High Performance 2021 International Workshops, Revised Selected Papers}},
	editor	 = {},
	publisher	 = {Springer},
	series	 = {Lecture Notes in Computer Science},
	conference	 = {ISC HPC},
	location	 = {Frankfurt, Germany},
	abstract	 = {One goal of support staff at a data center is to identify inefficient jobs and to improve their efficiency. Therefore, a data center deploys monitoring systems that capture the behavior of the executed jobs. While it is easy to utilize statistics to rank jobs based on the utilization of computing, storage, and network, it is tricky to find patterns in 100,000 jobs, i.e., is there a class of jobs that aren't performing well. Similarly, when support staff investigates a specific job in detail, e.g., because it is inefficient or highly efficient, it is relevant to identify related jobs to such a blueprint. This allows staff to understand the usage of the exhibited behavior better and to assess the optimization potential. In this article, our goal is to identify jobs similar to an arbitrary reference job. In particular, we sketch a methodology that utilizes temporal I/O similarity to identify jobs related to the reference job. Practically, we apply several previously developed time series algorithms. A study is conducted to explore the effectiveness of the approach by investigating related jobs for a  reference job. The data stem from DKRZ's supercomputer Mistral and include more than 500,000 jobs that have been executed for more than 6 months of operation. Our analysis shows that the strategy and algorithms bear the potential to identify similar jobs, but more testing is necessary.},

  • bibtex.txt
  • Last modified: 2019-01-04 18:02
  • (external edit)