Fair QOS resource management and non-linear prediction of 3D rendering applications

Doulamis, AD

dc.contributor.author	Doulamis, AD	en
dc.date.accessioned	2014-03-01T02:42:47Z
dc.date.available	2014-03-01T02:42:47Z
dc.date.issued	2004	en
dc.identifier.issn	02714310	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31074
dc.subject	Earliest Deadline First	en
dc.subject	Efficient Algorithm	en
dc.subject	Industrial Application	en
dc.subject	Linear Predictive	en
dc.subject	Quality of Service	en
dc.subject	Resource Allocation	en
dc.subject	Resource Manager	en
dc.subject	Scheduling Problem	en
dc.subject	First Come First Serve	en
dc.subject	Neural Network	en
dc.subject.other	Image rendering	en
dc.subject.other	Ray-tracing algorithms	en
dc.subject.other	Resource management	en
dc.subject.other	Semantic segmentation	en
dc.subject.other	Algorithms	en
dc.subject.other	Bandwidth	en
dc.subject.other	Computational complexity	en
dc.subject.other	Computer architecture	en
dc.subject.other	Computer simulation	en
dc.subject.other	Monte Carlo methods	en
dc.subject.other	Neural networks	en
dc.subject.other	Quality of service	en
dc.subject.other	Scheduling	en
dc.subject.other	Vectors	en
dc.subject.other	Resource allocation	en
dc.title	Fair QOS resource management and non-linear prediction of 3D rendering applications	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/ISCAS.2004.1328890	en
heal.identifier.secondary	http://dx.doi.org/10.1109/ISCAS.2004.1328890	en
heal.publicationDate	2004	en
heal.abstract	Resource management in a Grid has to able to guarantee commercial or industrial applications a personalized Quality of Service (QoS). To implement, however, an efficient resource allocation scheme, prediction of task workload is required. In this paper, we present an efficient algorithm for predicting the workload of 3D rendering tasks based on a constructive neural network architecture. We also consider the QoS scheduling problem whose target is to determine when and on which resource a given job should be executed. We propose a new algorithm for QoS scheduling, which allocates the resources in a fair way, and we compare it to other scheduling schemes such as the Earliest Deadline First and the First Come First Serve policies.	en
heal.journalName	Proceedings - IEEE International Symposium on Circuits and Systems	en
dc.identifier.doi	10.1109/ISCAS.2004.1328890	en
dc.identifier.volume	3	en
dc.identifier.spage	III889	en
dc.identifier.epage	III892	en