Global Event Algorithm Experiments

Adam Rifkin, http://www.ifindkarma.com/attic/phd/

Experiment Hypothesis

Algorithms using global events with announce-listen are more efficient than algorithms using messages and sequential unicasting, for the problem of distributed resource management.

Experiment Metric

We will use response time for servicing requests in comparing the global-events-with-multicast approach with the messages-with-unicast approach. We will employ this metric in two ways:

Analysis using closed-form equations for calculating worst-case response time.
Simulation for estimating average-case response time.

Experiment Algorithms

As discussed in our global events with announce-listen paper, our experiments will focus on the development of algorithms for distributed resource management along several axes:

With collaborative or competitive resource providers.
With or without middlemen as proxies between resource consumers and providers for filtering, forwarding, aggregating, and collating requests and responses.

In addition, we will continute to explore algorithms for different types of resource scheduling and reservation, extending the work of our resource reservation paper, in which we investigated the scheduling of specific resources controlled by more than one resource manager, and scheduling by attribute.

And, we will consider using micropayments with the middlemen algorithms, to build an economic model for reducing transaction costs in such systems.

Global Event Algorithm Experiments

Adam Rifkin, http://www.ifindkarma.com/attic/phd/

Experiment Hypothesis

Experiment Metric

Experiment Algorithms

Related Documents