Resource Allocation in Streaming Environments

This paper considers resource allocation algorithms for processing streams of events on computational grids. For example, financial trading applications are executed on large computational grids that receive streams of data such as stock ticker prices, commodity prices, foreign-exchange rates and total risk exposure. The economic value of a computation depends on the time taken to execute it; an arbitrage opportunity can disappear in seconds. Given limited resources, it is not possible to process all streams without delay. The more resource available to a computation, the less time it takes to process the input, and thus the more value it generates. Therefore, the scheduling policy should be designed to optimize the net economic value of computations executed on the grid. Computations on these streams often have substantial state; for example, a computation in a trading application maintains the state of the trade. Some operations on streams cannot be moved from one computer to anothe...

• Type: Journal
• Year: 2006
• Where: GRID
• Authors: Lu Tian, K. Mani Chandy
• Keywords: Computational Grids, Distributed And Parallel Computing, Economic Value, GRID 2006, Trading Application