Please use this identifier to cite or link to this item:
|Title:||Providing end-to-end QoS in distributed computation using non-greedy task synchronization||Authors:||Tolstikov, A.
|Issue Date:||2004||Citation:||Tolstikov, A., Biswas, J., Tham, C.-K. (2004). Providing end-to-end QoS in distributed computation using non-greedy task synchronization. Proceedings - IEEE International Conference on Networks, ICON 1 : 397-402. ScholarBank@NUS Repository. https://doi.org/10.1109/ICON.2004.1409180||Abstract:||End-to-end quality of service (QoS) is difficult to provide even in networks because the input at a server depends on the behavior of all the previous servers. In the case of distributed computation, this dependency becomes even more complicated. In networks, this problem is solved by introducing shapers before servers. In this paper, we propose to use a similar approach to regulate the load offered by a cyclic distributed computation on assigned resources. Delays are introduced to a computation by means of non-greedy synchronization between tasks. This allows the limiting of the minimum computation cycle time, and therefore the maximum rate at which a task requests a service from a server. Our evaluation results show that the scheme provides deadline satisfaction and lower deviation in computation cycle time, compared to the case when no delays are introduced. 1 Grid computing, end-to-end quality of service (QoS), earliest deadline first (EDF) scheduling © 2004 IEEE.||Source Title:||Proceedings - IEEE International Conference on Networks, ICON||URI:||http://scholarbank.nus.edu.sg/handle/10635/84116||ISBN:||078038783X||ISSN:||15312216||DOI:||10.1109/ICON.2004.1409180|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 12, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.