Throughput-fairness tradeoff in Best Effort flow control for on-chip architectures
2009 (English)In: IPDPS 2009: Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium, 2009Conference paper (Refereed)
We consider two flow control schemes for Best Effort traffic in on-chip architectures, which can be deemed as the solutions to the boundary extremes of a class of utility maximization problem. At one extreme, we consider the so-called Rate-Sum flow control scheme, which aims at improving the performance of the underlying system by roughly maximizing throughput while satisfying capacity constraints. At the other extreme, we deem the Max-Min flow control, whose concern is to maintain Max-Min fairness in rate allocation by fairly sacrificing the throughput. We then elaborate our argument through a weighting mechanism in order to achieve a balance between the orthogonal goals of performance and fairness. Moreover, we investigate the implementation facets of the presented flow control schemes in on-chip architectures. Finally, we validate the proposed flow control schemes and the subsequent arguments through extensive simulation experiments.
Place, publisher, year, edition, pages
Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:kth:diva-161082DOI: 10.1109/IPDPS.2009.5161186ScopusID: 2-s2.0-70449810244ISBN: 978-1-4244-3750-4OAI: oai:DiVA.org:kth-161082DiVA: diva2:793770
International Workshop on Performance Modeling, Evaluation, and Optimization of Ubiquitous Computing and Networked Systems (PMEO UCNS)
QC 201503102015-03-092015-03-092015-03-10Bibliographically approved