SoC Bus Scheduling With Data Unit Segmentation for Priority Delay
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing bus scheduling algorithms in System on Chip (SOC) result in significant scheduling delays for data with higher priority due to the lack of interruption capabilities, leading to inefficient communication between functional modules.
Innovation Solution
A data processing method that splits incoming data into smaller units based on weight information and priority, allowing simultaneous scheduling of multiple data units within a single cycle, ensuring faster response times for high-priority data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If traditional bus scheduling algorithms are used in SOC, then the bus can transmit data between functional modules, but high-priority data experiences significant scheduling delays due to lack of interruption capabilities
Solution Approach 1:
The patent segments incoming data into multiple data units based on priority levels and weight information. High-priority data is divided into smaller units that can be scheduled independently, allowing the bus to interrupt current transmissions and prioritize critical data units, thereby reducing scheduling delays for high-priority traffic while maintaining overall communication efficiency
Solution Approach 2:
The patent implements dynamic scheduling by continuously adjusting the weight information and priority levels of different data streams based on real-time system conditions. The bus scheduling algorithm dynamically reallocates transmission slots to high-priority data when interruptions are needed, while maintaining fair distribution for lower-priority data during normal operation, thus resolving the contradiction between reducing delay and maintaining productivity
2Speed
If data is split into smaller units based on weight information, then high-priority data can be scheduled faster, but the scheduling algorithm becomes more complex
Solution Approach 1:
The patent manages algorithmic complexity by parameterizing the scheduling decision process through weight information associated with each data stream. Instead of complex real-time analysis, the system uses pre-configured weight parameters that directly determine data unit priority and scheduling order, enabling fast scheduling decisions while keeping the algorithm manageable through parameter-based control rather than complex logic
3Productivity
If multiple data units are scheduled simultaneously in a single cycle, then bus utilization improves, but the scheduling logic becomes more difficult to manage
Solution Approach 1:
The patent structures simultaneous scheduling of multiple data units through periodic scheduling cycles. Each cycle processes data units according to their priority weights, creating a regular, predictable pattern that simplifies management. The periodic nature allows the system to handle multiple data units systematically rather than ad hoc, improving bus utilization while maintaining manageable scheduling logic through rhythmic, cycle-based operation
Data Source
AI summary
A data processing method includes receiving a plurality of pieces of first data using an input port of a current bus, each piece of first data including corresponding weight information, based on a specified unit data amount, splitting each piece of first data into at least one data unit, the unit data amount representing a minimum data amount of a single scheduling of the current bus, based on the weight information corresponding to each piece of first data, determining a corresponding number of data units from each piece of first data as second data corresponding to corresponding first data, and in a next bus scheduling cycle, sequentially sending each piece of second data from the input port of the current bus to a reception target according to a scheduling order.