document: Toward autonomic grids : analyzing the job flow with affinity streaming 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 ( N1 + ε ) ; 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 .
doc_bio_tags: O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O