Advance reservations for distributed real-time workflows with probabilistic service guarantees

Cucinotta, T; Konstanteli, K; Varvarigou, T

dc.contributor.author	Cucinotta, T	en
dc.contributor.author	Konstanteli, K	en
dc.contributor.author	Varvarigou, T	en
dc.date.accessioned	2014-03-01T02:45:56Z
dc.date.available	2014-03-01T02:45:56Z
dc.date.issued	2009	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/32473
dc.subject	Advance reservations	en
dc.subject	Probabilistic service guarantees	en
dc.subject	Real-time interactive workflows	en
dc.subject.other	Admission control tests	en
dc.subject.other	Advance reservation	en
dc.subject.other	Business rules	en
dc.subject.other	Objective functions	en
dc.subject.other	Optimum allocation	en
dc.subject.other	Physical resources	en
dc.subject.other	Problem description	en
dc.subject.other	Service guarantees	en
dc.subject.other	Work-flows	en
dc.subject.other	Management	en
dc.title	Advance reservations for distributed real-time workflows with probabilistic service guarantees	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/SOCA.2009.5410268	en
heal.identifier.secondary	http://dx.doi.org/10.1109/SOCA.2009.5410268	en
heal.identifier.secondary	5410268	en
heal.publicationDate	2009	en
heal.abstract	This paper addresses the problem of optimum allocation of distributed real-time workflows with probabilistic service guarantees over a Grid of physical resources made available by a provider. The discussion focuses on how such a problem may be mathematically formalised, both in terms of constraints and objective function to be optimized, which also accounts for possible business rules for regulating the deployment of the workflows. The presented formal problem constitutes a probabilistic admission control test that may be run by a provider in order to decide whether or not it is worth to admit new workflows into the system, and to decide what the optimum allocation of the workflow to the available resources is. Various options are presented which may be plugged into the formal problem description, depending on the specific needs of individual workflows. ©2009 IEEE.	en
heal.journalName	IEEE International Conference on Service-Oriented Computing and Applications, SOCA' 09	en
dc.identifier.doi	10.1109/SOCA.2009.5410268	en
dc.identifier.spage	254	en
dc.identifier.epage	261	en