Stream assignment for grid network with joint communication and computation constraints

Dynamic assignment of complex applications´ resource need on a dynamically aggregated computing infrastructure assembled via a network is central to autonomic grid computing and several other netcentric computing paradigms. In this paper we present an algorithm for active flow assignment in autonomic grid system. Active flow refers to the case where the bandwidth requirement between the flow processing elements can change due to active transformation/processing of the flow. We present the algorithm with the help of a dynamically deployable video grid application that is capable of negotiating local network state based rate and let the stream propagate over, grid network with highly asymmetric link and node capacities with minimum delay involved, in two diverse models, MISD and SIMD. The algorithm uses network connectivity graph factorization and thus adheres to the hierarchical nature of the autonomous networks