Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Algorithms pp 468–470Cite as

CPU Time Pricing

  • Reference work entry
  • First Online:

  • 39 Accesses

Years and Authors of Summarized Original Work

2005; Deng, Huang, Li

Problem Definition

This problem is concerned with a Walrasian equilibrium model to determine the prices of CPU time. In a market model of a CPU job scheduling problem, the owner of the CPU processing time sells time slots to customers and the prices of each time slot depends on the seller's strategy and the customers' bids (valuation functions). In a Walrasian equilibrium, the market is clear and each customer is most satisfied according to its valuation function and current prices. The work of Deng, Huang, and Li [1] establishes the existence conditions of Walrasion equilibrium, and obtains complexity results to determine the existence of equilibrium. It also discusses the issues of excessive supply of CPU time and price dynamics.

Notations

Consider a combinatorial auction (\( { \Omega, {I}, V } \)):

  • Commodities: The seller sells m kinds of indivisible commodities. Let \( { \Omega=\left\{\omega_1\times\delta_1,\right....

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Recommended Reading

  1. Deng X, Huang L-S, Li M (2007) On Walrasian price of CPU time. In: Proceedings of COCOON'05, Knming, 16–19 Aug 2005, pp 586–595. Algorithmica 48(2):159–172

    Google Scholar 

  2. Ferguson D, Yemini Y, Nikolaou C (1988) Microeconomic algorithms for load balancing in distributed computer systems. In: Proceedings of DCS'88, San Jose, 13–17 June 1988, pp 419–499

    Google Scholar 

  3. Goldberg AV, Hartline JD, Wright A (2001) Competitive auctions and digital goods. In: Proceedings of SODA'01, Washington, DC, 7–9 Jan 2001, pp 735–744

    Google Scholar 

  4. Kelly FP (1997) Charging and rate control for elastic traffic. Eur Trans Telecommun 8:33–37

    Article  Google Scholar 

  5. Kurose JF, Simha R (1989) A microeconomic approach to optimal resource allocation in distributed computer systems. IEEE Trans Comput 38(5):705–717

    Article  Google Scholar 

  6. Nisan N (2000) Bidding and allocation in combinatorial auctions. In: Proceedings of EC'00, Minneapolis, 17–20 Oct 2000, pp 1–12

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Compurter Science and Technology, Tsinghua University, Beijing, China

    Li-Sha Huang

Authors
  1. Li-Sha Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Huang, LS. (2016). CPU Time Pricing. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_94

Download citation

Publish with us

Policies and ethics

Search

Navigation