Resource allocation in a middleware for streaming data

  • Authors:
  • Liang Chen;Gagan Agrawal

  • Affiliations:
  • Ohio State University, Columbus OH;Ohio State University, Columbus OH

  • Venue:
  • MGC '04 Proceedings of the 2nd workshop on Middleware for grid computing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Increasingly, a number of applications rely on, or can potentially benefit from, analysis and monitoring of data streams. To support processing of streaming data in a grid environment, we have been developing a middleware system called GATES (Grid-based AdapTive Execution on Streams). Our target applications are those involving high volume data streams and requiring distributed processing of data arising from a distributed set of sources. This paper addresses the problem of resource allocation in the GATES system. Though resource discovery and resource allocation have been active topics in grid community, the pipelined processing and real-time constraint required by distributed streaming applications pose new challenges. We present a resource allocation algorithm that is based on minimal spanning trees. We evaluate the algorithm experimentally and demonstrate that it results in configurations that are very close to optimal, and significantly better than most other possible configurations.