Resource Allocation in Streaming Environments

Authors:
Lu Tian;K. Chandy
Affiliations:
Computer Science 256-80, California Institute of Technology, Pasadena, California 91125 USA. lutian@cs.caltech.edu;Computer Science 256-80, California Institute of Technology, Pasadena, California 91125 USA. mani@cs.caltech.edu
Venue:
GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing
Year:
2006

Citing 14
Cited 2

Spawn: A Distributed Computational Economy

IEEE Transactions on Software Engineering
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors

Journal of the ACM (JACM)
Fair end-to-end window-based congestion control

IEEE/ACM Transactions on Networking (TON)
A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems

Journal of Parallel and Distributed Computing
Continuous queries over data streams

ACM SIGMOD Record
Timing Analysis for Fixed-Priority Scheduling of Hard Real-Time Systems

IEEE Transactions on Software Engineering
Greedy Heuristics for Resource Allocation in Dynamic Distributed Real-Time Heterogeneous Computing Systems

PDPTA '02 Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications - Volume 2
Resource Co-Allocation in Computational Grids

HPDC '99 Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing
Relational subscription middleware for Internet-scale publish-subscribe

Proceedings of the 2nd international workshop on Distributed event-based systems
Grid resource management in legion

Grid resource management
Analyzing Market-Based Resource Allocation Strategies for the Computational Grid

International Journal of High Performance Computing Applications
Counter-intuitive throughput behaviors in networks under end-to-end control

IEEE/ACM Transactions on Networking (TON)
Fundamental design issues for the future Internet

IEEE Journal on Selected Areas in Communications

Towards a general model of the multi-criteria workflow scheduling on the grid

Future Generation Computer Systems
Double Auction-based Scheduling of Scientific Applications in Distributed Grid and Cloud Environments

Journal of Grid Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. In this paper, we propose two scheduling/resource allocation algorithms for processing streams on computational grids to optimize economic value. Both algorithms are based on market mechanisms; one uses a centralized market and the other decentralized markets. We prove bounds on performance and present measurements to show that the performances of the resource allocation systems are near-optimal and outperform load-balancing heuristics.