Toward Autonomic Grids: Analyzing the Job Flow with Affinity Streaming - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

Toward Autonomic Grids: Analyzing the Job Flow with Affinity Streaming

(1) , (1) , (2) , (1) , (1)
1
2
Xiangliang Zhang
  • Function : Author
  • PersonId : 849671
Cyril Furtlehner
  • Function : Author
  • PersonId : 849672
Julien Perez
  • Function : Author
  • PersonId : 849670
Cécile Germain
Michèle Sebag
  • Function : Author
  • PersonId : 836537

Abstract

The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a dataset, albeit with quadratic computational complexity. This paper, motivated by Autonomic Computing, extends AP to the data streaming framework. Firstly a hierarchical strategy is used to reduce the complexity to O( N^(1+e) ); the distortion loss incurred is analyzed in relation with the dimension of the data items. Secondly, a coupling with a change detection test is used to cope with non-stationary data distribution, and rebuild the model as needed. The presented approach StrAP is applied to the stream of jobs submitted to the EGEE Grid, providing an understandable description of the job flow and enabling the system administrator to spot online some sources of failures.
Fichier principal
Vignette du fichier
sub_sigkdd_v3.pdf (355.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00393825 , version 1 (09-06-2009)

Identifiers

  • HAL Id : inria-00393825 , version 1

Cite

Xiangliang Zhang, Cyril Furtlehner, Julien Perez, Cécile Germain, Michèle Sebag. Toward Autonomic Grids: Analyzing the Job Flow with Affinity Streaming. 15th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), Jun 2009, Paris, France. ⟨inria-00393825⟩
248 View
176 Download

Share

Gmail Facebook Twitter LinkedIn More