TY - JOUR
T1 - On Walrasian Price of CPU Time
AU - Deng, Xiaotie
AU - Huang, Li-Sha
AU - Li, Minming
PY - 2007/6
Y1 - 2007/6
N2 - We study a Walrasian equilibrium model to determine the price of CPU time. The customers have jobs that require a given length of CPU slot allocation with their valuations dependent on the assigned time slots. The owner of the CPU processing time receives compensation for time slots sold to the customers, subject to the condition that the slots sold to a customer are those that the customer most desires, given the price structure for the time slots. We establish conditions for jobs to have Walrasian equilibrium, and obtain complexity results to determine the Walrasian equilibrium. In particular, the issues of excessive supply of CPU time and price dynamics are discussed under our model.
AB - We study a Walrasian equilibrium model to determine the price of CPU time. The customers have jobs that require a given length of CPU slot allocation with their valuations dependent on the assigned time slots. The owner of the CPU processing time receives compensation for time slots sold to the customers, subject to the condition that the slots sold to a customer are those that the customer most desires, given the price structure for the time slots. We establish conditions for jobs to have Walrasian equilibrium, and obtain complexity results to determine the Walrasian equilibrium. In particular, the issues of excessive supply of CPU time and price dynamics are discussed under our model.
KW - Job scheduling
KW - Price sequence
KW - Walrasian equilibrium
UR - http://www.scopus.com/inward/record.url?scp=34250215658&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-34250215658&origin=recordpage
U2 - 10.1007/s00453-007-0064-9
DO - 10.1007/s00453-007-0064-9
M3 - RGC 21 - Publication in refereed journal
SN - 0178-4617
VL - 48
SP - 159
EP - 172
JO - Algorithmica (New York)
JF - Algorithmica (New York)
IS - 2
ER -