Incentive Engineering for Computational Resource Management
K. Drexler, and M. Miller. Ecology of Computation, Elsevier Science Publishers, (1998)
Abstract
Agoric computation I,II will require market-compatible
mechanisms for the allocation of processor times and storage
space. Recasting processor scheduling as an auction process
yields a flexble priority system. Recasting storage management as
a system of decentralized market negotiations yields a
distributed garbage collection algorithm able to collect
unreferenced loops that cross trust boundaries. Algorithms that
manage processor time and storage in ways that enable both
conventional computation and market-based decision making will be
useful in establishing agoric systems: they lie at the boundary
beween design and evolution. We describe such algorithms in some
detail.
%0 Book Section
%1 DrexlerM1998
%A Drexler, K. Eric
%A Miller, Mark
%B Ecology of Computation
%D 1998
%E Huberman, Bernardo
%I Elsevier Science Publishers
%K imported
%T Incentive Engineering for Computational Resource Management
%X Agoric computation I,II will require market-compatible
mechanisms for the allocation of processor times and storage
space. Recasting processor scheduling as an auction process
yields a flexble priority system. Recasting storage management as
a system of decentralized market negotiations yields a
distributed garbage collection algorithm able to collect
unreferenced loops that cross trust boundaries. Algorithms that
manage processor time and storage in ways that enable both
conventional computation and market-based decision making will be
useful in establishing agoric systems: they lie at the boundary
beween design and evolution. We describe such algorithms in some
detail.
@incollection{DrexlerM1998,
abstract = {Agoric computation {I,II} will require market-compatible
mechanisms for the allocation of processor times and storage
space. Recasting processor scheduling as an auction process
yields a flexble priority system. Recasting storage management as
a system of decentralized market negotiations yields a
distributed garbage collection algorithm able to collect
unreferenced loops that cross trust boundaries. Algorithms that
manage processor time and storage in ways that enable both
conventional computation and market-based decision making will be
useful in establishing agoric systems: they lie at the boundary
beween design and evolution. We describe such algorithms in some
detail.},
added-at = {2006-09-13T17:44:28.000+0200},
author = {Drexler, K. Eric and Miller, Mark},
biburl = {https://www.bibsonomy.org/bibtex/2e40f5c2b59e820397456de6b53999663/jmm},
booktitle = {Ecology of Computation},
description = {JMM master bibtex},
editor = {Huberman, Bernardo},
interhash = {ee5fc01a9795e100b948cc2e1b8b6865},
intrahash = {e40f5c2b59e820397456de6b53999663},
jmm_note = {315},
keywords = {imported},
publisher = {Elsevier Science Publishers},
timestamp = {2006-09-13T17:44:28.000+0200},
title = {Incentive Engineering for Computational Resource Management},
year = 1998
}