Data-Driven Resource Allocation
Allocating scarce resources to different tasks is usually a difficult and critical issue in general computing systems. Data-driven resource allocation is an efficient way to allocate resources following the data storage and process. In this chapter, the historical background of data-driven resource allocation is briefly introduced. Meanwhile, applications of data-driven resource allocation, including mature and emerging ones, are categorized and discussed.
- Albonesi DH (1999) Selective cache ways: on-demand cache resource allocation. In: MICRO-32. Proceedings of the 32nd annual ACM/IEEE international symposium on microarchitecture, pp 248–259. https://doi.org/10.1109/MICRO.1999.809463
- Dong M, Guo M, Zheng L, Guo S (2008) Performance analysis of resource allocation algorithms using cache technology for pervasive computing system. In: 2008 the 9th international conference for young computer scientists, pp 671–676. https://doi.org/10.1109/ICYCS.2008.527
- Li H, Guo S, Wu C, Li J (2015b) Fdrc: flow-driven rule caching optimization in software defined networking. In: 2015 IEEE international conference on communications (ICC), pp 5777–5782. https://doi.org/10.1109/ICC.2015.7249243
- Vasudevan SK, Vasudevan S, Velusamy K, Muralidharan S (2015) Modern operating systems, 1st edn. I.K. International Publishing House, New DelhiGoogle Scholar