Mining traces of large scale systems

Authors:
Christophe Cérin;Michel Koskas
Affiliations:
LIPN, UMR CNRS 7030, Université de Paris XIII, Villetaneuse, France;LaMFA/CNRS UMR 6140, Université de Picardie Jules Verne, Amiens, France
Venue:
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
Year:
2005

Citing 5
Cited 0

Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Parallel and Distributed Association Mining: A Survey

IEEE Concurrency
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Efficient Data Structures and Parallel Algorithms for Association Rules Discovery

ENC '04 Proceedings of the Fifth Mexican International Conference in Computer Science
Improving Parallel Execution Time of Sorting on Heterogeneous Clusters

SBAC-PAD '04 Proceedings of the 16th Symposium on Computer Architecture and High Performance Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Large scale distributed computing infrastructure captures the use of high number of nodes, poor communication performance and continously varying resources that are not available at any time. In this paper, we focus on the different tools available for mining traces of the activities of such aforementioned architecture. We propose new techniques for fast management of a frequent itemset mining parallel algorithm. The technique allow us to exhibit statistical results about the activity of more that one hundred PCs connected to the web.