Multi-parameter Auctions: Truthfulness Conditions and Applications to Page Allocation in Distributed Shared Memory Multiprocessors - Couverture souple

Desarkar, Maunendra Sankar

 
9783844396089: Multi-parameter Auctions: Truthfulness Conditions and Applications to Page Allocation in Distributed Shared Memory Multiprocessors
Couverture souple
ISBN 10 : 384439608X ISBN 13 : 9783844396089
Editeur : LAP LAMBERT Academic Publishing, 2011

Synopsis

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 multi-parameter auctions. We formulate the page allocation problem as a multi-parameter auction and find out truthfulness conditions for such multi-parameter auctions.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

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 multi-parameter auctions. We formulate the page allocation problem as a multi-parameter auction and find out truthfulness conditions for such multi-parameter auctions.

Biographie de l'auteur

M. S. Desarkar received M.Tech. degree in CSE from IIT Kanpur in 2006. He worked in Sybase India Pvt. Ltd. as a Software Developer from 2006 to 2008. Since 2008 he has been a research scholar in CSE Dept, IIT Kharagpur. He was awarded MSR India PhD Fellowship in 2009. His research interests are in the areas of Data Mining and Information Retrieval.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
LAP LAMBERT Academic Publishing
Date d'édition
2011
Langue
anglais
ISBN 10 
384439608X
ISBN 13 
9783844396089
Reliure
Broché
Nombre de pages
64
Coordonnées du fabricant
non disponible
Personne responsable
KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Allemagne