In this paper, we propose some amendment on Dijkstra's algorithm in order to optimize it by reducing the number of iterations. The main idea is to solve the problem where more than one node satisfies the condition of the second step in the traditional Dijkstra's algorithm. After application of the proposed modifications, the maximum number of iterations of Dijkstra's algorithm is less than the number of the graph's nodes.

No abstract

This paper presents our approach for grid monitoring: A contextual grid monitoring by a model driven approach. Our approach consists in supervising an entity by taking into account the events occurring on its environment of execution and by automating the update of these influences. In this context, we propose a unified grid model by extending the standardized DMTF/CIM model. We formalized influences between the grid components and their execution context by integrating UML Statechart diagram into CIM.