Accessibility navigation

A novel string representation and kernel function for the comparison of I/O access patterns

Torres, R., Kunkel, J. M., Dolz, M. F. and Ludwig, T. (2017) A novel string representation and kernel function for the comparison of I/O access patterns. In: Malyshkin, V. (ed.) Parallel Computing Technologies: 14th International Conference, PaCT 2017, Nizhny Novgorod, Russia, September 4-8, 2017, Proceedings. Lecture Notes in Computer Science, 10421 (10421 2017). Springer, Cham, pp. 500-512. ISBN 9783319629315

Text - Accepted Version
· Please see our End User Agreement before downloading.


It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

To link to this item DOI: 10.1007/978-3-319-62932-2_48


Parallel I/O access patterns act as fingerprints of a parallel program. In order to extract meaningful information from these patterns, they have to be represented appropriately. Due to the fact that string objects can be easily compared using Kernel Methods, a conversion to a weighted string representation is proposed in this paper, together with a novel string kernel function called Kast Spectrum Kernel. The similarity matrices, obtained after applying the mentioned kernel over a set of examples from a real application, were analyzed using Kernel Principal Component Analysis (Kernel PCA) and Hierarchical Clustering. The evaluation showed that 2 out of 4 I/O access pattern groups were completely identified, while the other 2 conformed a single cluster due to the intrinsic similarity of their members. The proposed strategy can be promisingly applied to other similarity problems involving tree-like structured data.

Item Type:Book or Report Section
Divisions:Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science
ID Code:77671


Downloads per month over past year

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation