Abstract
Due to the increase in the number of available cores in current systems, plenty of system software starts to use some of these cores to perform tasks that will help optimize the application behaviour. Unfortunately, current Onload mechanisms are too limited. On the one hand, there is no dynamic way to decide the number of cores that is taken from applications and given to these system helpers. And, on the other hand, the onload mechanisms do not offer enough control over when and where onloading tasks should to be executed. In this paper we propose a new Onload Framework that addresses these issues.
First, we propose DYON, a dynamic and adaptive method to control the amount of extra CPUs offered to the Onload Framework to generate benefits for the whole system.
And second, we propose a submission mechanism that given a task, executes it if there are idle resources or rejects it otherwise. This feature is useful to move the execution of small pieces of code out of the critical path (allowing parallel execution) when this is possible, or discard them and execute a code that will not rely on them.
This work was partially supported by the EU IST program as part of the IOLanes project (contract FP7-248615), by the Marie Curie Initial Training Network grant“SCALing by means of Ubiquitous Storage (SCALUS)”, by the Spanish Ministry of Economy and Competitiveness under the TIN2012-34557 grant, and by the Catalan Government under the 2009-SGR-980 grant. We would also like to thank Neurocom for letting us use their TariffAdvisor application and Alberto Miranda for his help. Source available for kernel 2.6.32 under request at the IOLanes project [1].
Chapter PDF
Similar content being viewed by others
References
FORTH, UPM, BSC, IBM, INTEL, NEUROCOM: IOLanes - Advancing the Scalability and Performance of I/O Subsystems in Multicore Platforms (2010), http://www.iolanes.eu
Nou, R., Giralt, J., Cortes, T.: Automatic i/o scheduler selection through online workload analysis. In: Apduhan, B.O., Hsu, C.H., Dohi, T., Ishida, K., Yang, L.T., Ma, J. (eds.) UIC/ATC, pp. 431–438. IEEE Computer Society (2012)
Bovet, D.P., Cesati, M.: Understanding the linux kernel. O’Reilly (2003)
Love, R.: Linux System Programming: Talking Directly to the Kernel and C Library. O’Reilly Media, Inc. (2007)
Molnar, I.: Inclusion of Work Queues on Linux (2012), http://lwn.net/Articles/11247/
Heo, T.: RFC of Concurrency Managed Workqueues patch (2012), http://lwn.net/Articles/355347/
Klassert, S.: RFC of padata patch (2012), http://www.mail-archive.com/linux-cryptovger.kernel.org/msg03329.html
Heo, T.: RFC of Concurrency Managed Workqueues patch take 2 (2012), http://lwn.net/Articles/367289/
Berry, D.A., Fristedt, B.: Bandit problems: Sequential allocation of experiments. Monographs on Statistics and Applied Probability (1985)
Akram, S., Marazakis, M., Bilas, A.: NUMA Implications for Storage I/O Throughput in Modern Servers. In: 3rd Workshop on Computer Architecture and Operating System co-design, CAOS 2012 (2012)
Neurocom: TariffAdvisor / TariffSuite (2012), http://www.tariffsuite.com
Axboe, J.: fio Flexible IO Tester (2012), http://git.kernel.dk/?p=fio.git
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nou, R., Giralt, J., Cortes, T. (2014). DYON: Managing a New Scheduling Class to Improve System Performance in Multicore Systems. In: an Mey, D., et al. Euro-Par 2013: Parallel Processing Workshops. Euro-Par 2013. Lecture Notes in Computer Science, vol 8374. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54420-0_74
Download citation
DOI: https://doi.org/10.1007/978-3-642-54420-0_74
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-54419-4
Online ISBN: 978-3-642-54420-0
eBook Packages: Computer ScienceComputer Science (R0)