Abstract:
The change of industrial automation towards a highly interconnected architecture is still ongoing. Time-sensitive networking (TSN) is an essential element for this transi...Show MoreMetadata
Abstract:
The change of industrial automation towards a highly interconnected architecture is still ongoing. Time-sensitive networking (TSN) is an essential element for this transition. This paper focuses on TSN end stations, mainly answering how to implement a software-based worst-case execution time (WCET) analyzable buffer management. The two-level segregated fit (TLSF) algorithm was chosen, implemented, and evaluated based on an asymptotic complexity analysis of dynamic storage allocation algorithms. The implemented and improved TLSF algorithm showed similar timing behavior as calculated when executed on a time-predictable platform. The paper concludes by outlining further research.
Date of Conference: 26-28 April 2023
Date Added to IEEE Xplore: 07 June 2023
ISBN Information:
ISSN Information:
Funding Agency:
Keywords assist with retrieval of results and provide a means to discovering other relevant content. Learn more.
- IEEE Keywords
- Index Terms
- End Station ,
- Buffer Management ,
- Fitting Algorithm ,
- Allocation Algorithm ,
- Dynamic Allocation ,
- Asymptotic Complexity ,
- Time Complexity ,
- Uniform Size ,
- Time Slot ,
- Constant Factor ,
- Binary Tree ,
- Memory Space ,
- Buffer Size ,
- Real-time Communication ,
- Free Buffer ,
- Dynamic Management ,
- Free Listing ,
- Memory Management ,
- Static Memory ,
- Memory Allocation ,
- List Length ,
- Network Interface ,
- Data Structure ,
- Space Complexity ,
- Target Platform ,
- Dynamic Memory
- Author Keywords
Keywords assist with retrieval of results and provide a means to discovering other relevant content. Learn more.
- IEEE Keywords
- Index Terms
- End Station ,
- Buffer Management ,
- Fitting Algorithm ,
- Allocation Algorithm ,
- Dynamic Allocation ,
- Asymptotic Complexity ,
- Time Complexity ,
- Uniform Size ,
- Time Slot ,
- Constant Factor ,
- Binary Tree ,
- Memory Space ,
- Buffer Size ,
- Real-time Communication ,
- Free Buffer ,
- Dynamic Management ,
- Free Listing ,
- Memory Management ,
- Static Memory ,
- Memory Allocation ,
- List Length ,
- Network Interface ,
- Data Structure ,
- Space Complexity ,
- Target Platform ,
- Dynamic Memory
- Author Keywords