Bounding worst-case access times in modern multiprocessor systems

被引:1
|
作者
Stohr, J [1 ]
von Bülow, A [1 ]
Färber, G [1 ]
机构
[1] Tech Univ Munich, Inst Real Time Comp Syst, D-8000 Munich, Germany
关键词
D O I
10.1109/ECRTS.2005.10
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
When evaluating worst-case execution times of real-time software on an off-the-shelf multiprocessor system, one should consider the architecture of the underlying hardware. This paper evaluates and discusses the impacts of the chipset of a symmetric multi-processing (SMP) architecture on the execution times of software. It will show how one can obtain worst-case execution times of accesses to main memory and to peripheral devices. This paper will also introduce parameters to describe the different impacts on these access times. These parameters reflect the worst-case execution times of a set of uninterrupted accesses at different load conditions. Depending on the real-time requirements, accesses to main memory or to peripheral devices can be performed at different configuration states of hardware. At each state, the worst-case access times differ This paper will show how these access times can be used for the evaluation of worst-case execution times of real-time software.
引用
收藏
页码:189 / 198
页数:10
相关论文
共 50 条
  • [1] Energy Optimization with Worst-Case Deadline Guarantee for Pipelined Multiprocessor Systems
    Chen, Gang
    Huang, Kai
    Buckl, Christian
    Knoll, Alois
    [J]. DESIGN, AUTOMATION & TEST IN EUROPE, 2013, : 45 - 50
  • [2] ON THE WORST-CASE RATIO OF A COMPOUND MULTIPROCESSOR SCHEDULING ALGORITHM
    KUNDE, M
    STEPPAT, H
    [J]. INFORMATION PROCESSING LETTERS, 1987, 25 (06) : 389 - 396
  • [3] Alternatives to splay trees with O (log n) worst-case access times
    Iacono, J
    [J]. PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 516 - 522
  • [4] Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems
    López, JM
    García, M
    Díaz, JL
    García, DF
    [J]. EUROMICRO RTS 2000: 12TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS, 2000, : 25 - 33
  • [5] Bounding the Worst-Case Execution Time of Static NUCA Caches
    Ding, Yiqiang
    Zhang, Wei
    [J]. 2014 IEEE INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS, 2014 IEEE 6TH INTL SYMP ON CYBERSPACE SAFETY AND SECURITY, 2014 IEEE 11TH INTL CONF ON EMBEDDED SOFTWARE AND SYST (HPCC,CSS,ICESS), 2014, : 1181 - 1184
  • [6] Additive bounding, worst-case analysis, and the breakpoint median problem
    Caprara, A
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2002, 13 (02) : 508 - 519
  • [7] Bounding Worst-Case Response Time for Tasks under PIP
    Ramaprasad, Harini
    Mueller, Frank
    [J]. 15TH IEEE REAL-TIME AND EMBEDDED TECHNOLOGY AND APPLICATION SYMPOSIUM: RTAS 2009, PROCEEDINGS, 2009, : 183 - +
  • [8] PIPELINED PROCESSORS AND WORST-CASE EXECUTION TIMES
    ZHANG, N
    BURNS, A
    NICHOLSON, M
    [J]. REAL-TIME SYSTEMS, 1993, 5 (04) : 319 - 343
  • [9] WORST-CASE CONVERGENCE TIMES FOR HOPFIELD MEMORIES
    FLOREEN, P
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS, 1991, 2 (05): : 533 - 535
  • [10] Worst-case simulation of uncertain systems
    El Ghaoui, L
    Calafiore, G
    [J]. ROBUSTNESS IN IDENTIFICATION AND CONTROL, 1999, 245 : 134 - 146