Real-time processing is becoming more important in modern computer systems, necessitating the use of efficient real-time scheduling techniques, particularly in the context of multi-core architectures. This work provides a comprehensive analysis and comparison of various real-time scheduling techniques specifically tailored for multi-core CPUs. The major aims are to assess their functionality, scalability, and adaptability for handling real-time workloads in a multi-core environment. We will provide performance measures and trial outcomes in tables to clearly outline the advantages and downsides of each algorithm.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Comparative Analysis of Real-Time Scheduling Algorithms on Multi-core Architectures

  • Jyotsna Gaikwad

摘要

Real-time processing is becoming more important in modern computer systems, necessitating the use of efficient real-time scheduling techniques, particularly in the context of multi-core architectures. This work provides a comprehensive analysis and comparison of various real-time scheduling techniques specifically tailored for multi-core CPUs. The major aims are to assess their functionality, scalability, and adaptability for handling real-time workloads in a multi-core environment. We will provide performance measures and trial outcomes in tables to clearly outline the advantages and downsides of each algorithm.