Trading grid services – a multi-attribute combinatorial approach

The Grid is a promising technology for providing access to distributed high-end computational capabilities. Thus, computational tasks can be performed spontaneously by other resources in the Grid that are not under the user’s control. However, one of the key problems in the Grid is deciding which jo...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 187; číslo 3; s. 943 - 961
Hlavní autoři: Schnizler, Björn, Neumann, Dirk, Veit, Daniel, Weinhardt, Christof
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 16.06.2008
Elsevier
Elsevier Sequoia S.A
Edice:European Journal of Operational Research
Témata:
Auctions
Auctions and bidding
Combinatorial exchange
Distributed processing
Grid
Integer programming
Market engineering
Production scheduling
Resource allocation
Simulation
Studies
Integer programming
Combinatorial exchange
Market engineering
Auctions and bidding
Grid
ISSN:0377-2217, 1872-6860
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The Grid is a promising technology for providing access to distributed high-end computational capabilities. Thus, computational tasks can be performed spontaneously by other resources in the Grid that are not under the user’s control. However, one of the key problems in the Grid is deciding which jobs are to be allocated to which resources at what time. In this context, the use of market mechanisms for scheduling and allocating Grid resources is a promising approach toward solving these problems. This paper proposes an auction mechanism for allocating and scheduling computer resources such as processors or storage space which have multiple quality attributes. The mechanism is evaluated according to its economic and computational performance as well as its practical applicability by means of a simulation.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2006.05.049