期刊文献+

Utilization-Aware Data Variable Allocation on NVM- Based SPM in Real-Time Embedded Systems

下载PDF
导出
摘要 With the development of the nonvolatile memory(NVM),using NVM in the design of the cache and scratchpad memory(SPM)has been increased.This paper presents a data variable allocation(DVA)algorithm based on the genetic algorithm for NVM-based SPM to prolong the lifetime.The lifetime can be formulated indirectly as the write counts on each SPM address.Since the differences between global variables and stack variables,our optimization model has three constraints.The constraints of the central processing unit(CPU)utilization and size are used for all variables,while no-overlay constraint is only used for stack variables.To satisfy the constraints of the optimization model,we use the greedy strategy to generate the initial population which can determine whether data variables are allocated to SPM and distribute them evenly on SPM addresses.Finally,we use the Mälardalen worst case executive time(WCET)benchmark to evaluate our algorithm.The experimental results show that the DVA algorithm can not only obtain close-to-optimal solutions,but also prolong the lifetime by 9.17% on average compared with SRAM-based SPM.
出处 《Journal of Electronic Science and Technology》 CAS CSCD 2021年第2期163-172,共10页 电子科技学刊(英文版)
基金 supported by the Research Fund of National Key Laboratory of Computer Architecture under Grant No.CARCH201501 the Open Project Program of the State Key Laboratory of Mathematical Engineering and Advanced Computing under Grant No.2016A09.
  • 相关文献

参考文献1

二级参考文献19

  • 1Guan N, Wang Y, Gu Z, et al. New schedulability test conditions for non-preemptive scheduling on multiprocessor platforms [C] //Proc of the 29th IEEE Int Real-Time Systems Syrup. Piscataway, NJ: IEEE, 2008: 137-146.
  • 2Buttazzo G. Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications [M]. Berlin: Springer, 2011.
  • 3Davis R I, Burns A, Marinho J, et al. Global fixed priority scheduling with deferred pre-emption [C]//Proc of the 19th IEEE Int Conf on Embedded and Real-Time Computing Systems and Applications. Piscataway, N J: IEEE, 2013: 1-11.
  • 4Davis R I, Burns A. A survey of hard real-time scheduling for multiprocessor systems [J]. ACM Computing Surveys, 2011, 43(4): 1-44.
  • 5Bertogna M, Cirinei M, Lipari G. New schedulability tests for real-time task sets scheduled by deadline monotonic on multiprocessors [C]//Proc of the 9th Int Conf on Principles of Distributed Systems. Berlin: Springer, 2005: 306-321.
  • 6Baruah S. Techniques for multiprocessor global schedulability analysis [C] //Proc of the 28th IEEE Int Real- Time Systems Symp. Piscataway, NJ.. IEEE, 2007: 119-128.
  • 7Cho H, Ravindran B, Jensen E D. An optimal real-time scheduling algorithm for multiprocessors [C] //Proc of the 27th IEEE Int Real-Time Systems Symp. Piscataway, NJ: IEEE, 2006:101-110.
  • 8Lundberg L, Lennerstad H. Guaranteeing response times for aperiodic tasks in global multiprocessor scheduling[J]. Real- Time Systems, 2007, 35(2): 135-151.
  • 9Lundberg L, Lennerstad H. Slack-based global multiprocessor scheduling of aperiodic tasks in parallel embedded real-time systems [C] //Proc of the 6th IEEE/ACS Int Conf on Computer Systems and Applications. Piscataway, N J: IEEE, 2008: 465-472.
  • 10Andersson B. Global static-priority preemptive muhiprocessor scheduling with utilization bound 38[C]//Proc of the 12th Int Conf on Principles of Distributed Systems. Berlin: Springer, 20081 73-88.

共引文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部