About: A Continuous Double Auction Method for Resource Allocation in Computational Grids

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: A Continuous Double Auction Method for Resource Allocation in Computational Grids Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	In this paper, we introduce a continuous double auction method for grid resource allocation in which resources are considered as provider agents and users as consumer agents. In each time step, each provider agent determines its requested value based on its workload and each consumer agent determines its bid value based on two constraints: the remaining time for bidding, and the remaining resources for bidding. We study this method in terms of economic efficiency and system performance. Experimental results show that the proposed method is better than Earliest Deadline First (EDF) method, which is a default strategy in many schedulers. In this paper, we introduce a continuous double auction method for grid resource allocation in which resources are considered as provider agents and users as consumer agents. In each time step, each provider agent determines its requested value based on its workload and each consumer agent determines its bid value based on two constraints: the remaining time for bidding, and the remaining resources for bidding. We study this method in terms of economic efficiency and system performance. Experimental results show that the proposed method is better than Earliest Deadline First (EDF) method, which is a default strategy in many schedulers. (en)
Title	A Continuous Double Auction Method for Resource Allocation in Computational Grids A Continuous Double Auction Method for Resource Allocation in Computational Grids (en)
skos:prefLabel	A Continuous Double Auction Method for Resource Allocation in Computational Grids A Continuous Double Auction Method for Resource Allocation in Computational Grids (en)
skos:notation	RIV/61989100:27240/09:00020954!RIV10-GA0-27240___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GA102/09/1494)
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Snášel, Václav
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoká škola báňská - Technická univerzita Ostrava / Fakulta elektrotechniky a informatiky
http://linked.open...dnocenehoVysledku	301215
http://linked.open...ai/riv/idVysledku	RIV/61989100:27240/09:00020954
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	grid computing; resource allocation (en)
http://linked.open.../riv/klicoveSlovo	resource allocation grid computing
http://linked.open...ontrolniKodProRIV	[501888137EDB]
http://linked.open...v/mistoKonaniAkce	Nashville, TN
http://linked.open...i/riv/mistoVydani	NEW YORK
http://linked.open...i/riv/nazevZdroje	IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN SCHEDULING
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	5 (xsd:int)
http://linked.open...vavai/riv/projekt	New methods od data transmition based on turbo code
http://linked.open...UplatneniVysledku	2009
http://linked.open...iv/tvurceVysledku	Snášel, Václav Abraham, Ajith Izakian, Hesam Ladani, Behrouz Tork Zamanifar, Kamran
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000268921700005
http://linked.open.../riv/zahajeniAkce	2009-03-30 (xsd:date)
number of pages	7 (xsd:int)
http://purl.org/ne...btex#hasPublisher	IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
https://schema.org/isbn	978-1-4244-2757-4
http://localhost/t...ganizacniJednotka	27240
is http://linked.open...avai/riv/vysledek of	A Continuous Double Auction Method for Resource Allocation in Computational Grids A Continuous Double Auction Method for Resource Allocation in Computational Grids A Continuous Double Auction Method for Resource Allocation in Computational Grids A Continuous Double Auction Method for Resource Allocation in Computational Grids

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 85 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software