Fair Scheduling Algorithms in Grids

Doulamis, N; Varvarigos, E; Varvarigou, T

dc.contributor.author	Doulamis, N	en
dc.contributor.author	Varvarigos, E	en
dc.contributor.author	Varvarigou, T	en
dc.date.accessioned	2014-03-01T01:55:59Z
dc.date.available	2014-03-01T01:55:59Z
dc.date.issued	2007	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/27894
dc.subject	3d imaging	en
dc.subject	Earliest Deadline First	en
dc.subject	Fair Scheduling	en
dc.subject	Grid Computing	en
dc.subject	Grid Scheduling	en
dc.subject	Max Min Fairness	en
dc.subject	First Come First Serve	en
dc.subject	Willing To Pay	en
dc.title	Fair Scheduling Algorithms in Grids	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/TPDS.2007.1053	en
heal.identifier.secondary	http://dx.doi.org/10.1109/TPDS.2007.1053	en
heal.publicationDate	2007	en
heal.abstract	In this paper, we propose a new algorithm for fair scheduling, and we compare it to other scheduling schemes such as the earliest deadline first (EDF) and the first come first served (FCFS) schemes. Our algorithm uses a max-min fair sharing approach for providing fair access to users. When there is no shortage of resources, the algorithm assigns to each	en
heal.journalName	IEEE Transactions on Parallel and Distributed Systems	en
dc.identifier.doi	10.1109/TPDS.2007.1053	en