Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Toward designing a dynamic CPU cap manager for timely dataflow platforms
The University of Sydney, Australia.
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).ORCID iD: 0000-0001-9194-010X
The University of Sydney, Australia.
Show others and affiliations
2018 (English)In: HPC '18 Proceedings of the High Performance Computing Symposium / [ed] Watson L.T., Thacker W.I., Sosonkina M., Rupp K., Weinbub J., ACM Digital Library, 2018, Vol. 50, no 4, p. 60-70, article id 6Conference paper, Published paper (Refereed)
Abstract [en]

In this work, we propose a control-based solution for the problem of CPU resource allocation in data-flow platform that considers the degradation of performance caused by running concurrent data-flow processes. Our aim is to cut the QoS violation incidents for applications belonging to the highest QoS class. The performance of the proposed solution is bench-marked with the famous round robin algorithm. The experimental results confirms that the proposed algorithm can decrease the latency of processing data records for applications by 48% compared to the round robin policy.

Place, publisher, year, edition, pages
ACM Digital Library, 2018. Vol. 50, no 4, p. 60-70, article id 6
Series
Simulation Series, ISSN 0735-9276
Keywords [en]
Distributed data-flow processing engines, Quality of service, Scheduling and resource allocation algorithms, Concurrency control; Data transfer; Quality of service; Resource allocation; Routers; Scheduling algorithms, CPU resources; Data flow; Distributed data flow; QOS class; Resource allocation algorithms; Round Robin; Round Robin algorithms, Data handling
National Category
Computer Systems
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-70335Scopus ID: 2-s2.0-85055261387ISBN: 978-1-5108-6016-2 (print)OAI: oai:DiVA.org:kau-70335DiVA, id: diva2:1266824
Conference
SpringSim-HPC, 2018 April 15–18, Baltimore, Maryland
Available from: 2018-11-29 Created: 2018-11-29 Last updated: 2018-12-13Bibliographically approved

Open Access in DiVA

No full text in DiVA

Scopus

Authority records BETA

Taheri, Javid

Search in DiVA

By author/editor
Taheri, Javid
By organisation
Department of Mathematics and Computer Science (from 2013)
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 17 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf