Multiparameter Auctions: Truthfulness Conditions and Applications to Page Allocation in Distributed Shared Memory Multiprocesso,Used

Multiparameter Auctions: Truthfulness Conditions and Applications to Page Allocation in Distributed Shared Memory Multiprocesso,Used

In Stock
SKU: DADAX384439608X
Brand: LAP Lambert Academic Publishing
Condition: New
Regular price$91.14
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 1–3 business days
  • Estimated Delivery: 3–5 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
  • Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund

Returns accepted within 30 days of delivery.

Damaged or Defective Item

Free return shipping + replacement or full refund

Wrong Item Received

Free return shipping + replacement or full refund

Change of Mind

Return shipping at customer's expense · 25% restocking fee applies

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

Fair resource allocation plays an important role in determining the end performance of any computer system. Depending on the nature of resources and the mode of sharing, usually algorithms are implemented either in hardware or in software to guarantee fairness in resource sharing. These algorithms are generally complex and make the job of design verification difficult. Hence one can think of designing simpler algorithms, those would reduce the difficulty during design verification without losing much on the system performance. One such approach can be to have the competing agents specify their valuations for the resources. A central allocator listens to the valuations and takes allocation decisions accordingly. As the allocation is done solely depending on the valuations given by the agents, one needs to ensure truthfulness of the agents. In such cases we can view the resource allocation problem as a mechanism design problem. We investigate how the problem of page allocation in DSM multiprocessors can be solved using multiparameter auctions. We formulate the page allocation problem as a multiparameter auction and find out truthfulness conditions for such multiparameter auctions.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed