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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Srikant, R., Agrawal, R.: Fast algorithms for mining association rules. In: The International Conference on Very Large Databases (VLDB), pp. 487–499 (1994)
Zaki, O., Parthasarathy, S., Li, W.: New algorithms for fast discovery of association rules. In: Heckerman, D., Mannila, H., Pregibon, D., Uthurusamy, R., Park (eds.) Proceedings of the 3rd International Conference on Knowledge Discovery and Data Miing. AAAI Press, Menlo Park (1997)
Han, P., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data (2000)
Cérin, G., Koskas, Le-Mahec: Efficient data-structures and parallel algorithms for association rules discover. In: 3rd International Conference on Parallel Computing Systems (PCS 2004), Colima, Mexico (September 2004)
Zaki, M.J.: Parallel and distributed association mining: A survey. IEEE Concurrency 7(4), 14–25 (1999)
Cérin, M.J.C., Koskas, M., Fkaier, H.: Improving parallel execution time of sorting on heterogeneous clusters. In: Proc. 16th International Symposium on Computer Architecture and High Performance Computing (SBAC 2004), Foz-do-Iguazu, Brazil (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cérin, C., Koskas, M. (2005). Mining Traces of Large Scale Systems. In: Hobbs, M., Goscinski, A.M., Zhou, W. (eds) Distributed and Parallel Computing. ICA3PP 2005. Lecture Notes in Computer Science, vol 3719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564621_15
Download citation
DOI: https://doi.org/10.1007/11564621_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29235-7
Online ISBN: 978-3-540-32071-5
eBook Packages: Computer ScienceComputer Science (R0)