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 arzd several other netcentric computing paradigms. In this paper we present an algorithm for active flow assignment in autonomic grid system. Active flow refers to rize case where rize bandwidth requirement between the flow processing elements can change due to active transformation/processing of the flow. We present rize algorithm with rize help of a dynamically deployable video grid application that is capable of negotiating local network state based rate arzd let rize stream propagate over. grid network with highly asymmetric link arzd node capacities with minimum delay involved. in two diverse models. MISD arzd SIMD. The algorithm uses network connectivity graph factorization arzd thus adheres to the hierarchical nature of rize autonomous networks.