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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
M. S. Desarkar erhielt 2006 den M.Tech.-Abschluss in CSE vom IIT Kanpur. Von 2006 bis 2008 arbeitete er bei Sybase India Pvt. Ltd. als Softwareentwickler. Seit 2008 ist er Forschungsstipendiat in der CSE-Abteilung des IIT Kharagpur. Im Jahr 2009 wurde er mit dem MSR India PhD Fellowship ausgezeichnet. Seine Forschungsinteressen liegen in den Bereichen Data Mining und Information Retrieval.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 64 pp. Englisch. Bestandsnummer des Verkäufers 9783844396089
Anzahl: 2 verfügbar
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. pp. 64. Bestandsnummer des Verkäufers 26128861318
Anzahl: 4 verfügbar
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: New. Print on Demand pp. 64 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam. Bestandsnummer des Verkäufers 131726169
Anzahl: 4 verfügbar
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: New. PRINT ON DEMAND pp. 64. Bestandsnummer des Verkäufers 18128861324
Anzahl: 4 verfügbar
Anbieter: moluna, Greven, Deutschland
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Desarkar Maunendra SankarM. 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. Bestandsnummer des Verkäufers 5477080
Anzahl: Mehr als 20 verfügbar
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 64 pp. Englisch. Bestandsnummer des Verkäufers 9783844396089
Anzahl: 1 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Bestandsnummer des Verkäufers 9783844396089
Anzahl: 1 verfügbar
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: Neu. Multi-parameter Auctions | Truthfulness Conditions and Applications to Page Allocation in Distributed Shared Memory Multiprocessors | Maunendra Sankar Desarkar | Taschenbuch | 64 S. | Englisch | 2011 | LAP LAMBERT Academic Publishing | EAN 9783844396089 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu. Bestandsnummer des Verkäufers 106954937
Anzahl: 5 verfügbar
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
paperback. Zustand: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Bestandsnummer des Verkäufers ERICA829384439608X6
Anzahl: 1 verfügbar