Asynchronous Scheduler Interleaving Standalone and Sequence Operations
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional schedulers, particularly in synchronous systems, are ineffective in optimizing the execution of both standalone and sequence operations in asynchronous contention-based communication systems, leading to high rejection ratios due to unpredictable access requests and inability to preempt operations.
Innovation Solution
An operation scheduler that interleaves the execution of standalone non-preemptable operations and sequences by using FIFO queues, a messaging gateway, and an arbitration unit to manage and schedule requests based on trigger messages and available resources, reducing rejection ratios and optimizing resource utilization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If conventional synchronous schedulers are used in asynchronous contention-based systems, then the system structure remains simple, but the rejection ratio of requests increases and resource utilization deteriorates
Solution Approach 1:
The scheduler dynamically adapts its behavior based on the asynchronous nature of incoming requests. Instead of using fixed time slots as in synchronous systems, the scheduler continuously monitors the contention window and dynamically adjusts scheduling decisions based on when requests actually arrive, transforming a static scheduling approach into a dynamic one that matches the asynchronous environment.
Solution Approach 2:
The scheduler changes its operational parameters to suit asynchronous contention-based systems. It modifies the scheduling interval from fixed time slots to variable intervals based on request arrival patterns, and adjusts priority assignments dynamically based on the state of sequence operations and available resources, thereby optimizing performance for the specific system type.
2Ease of operation
If standalone operations are executed one at a time in sequence, then execution simplicity is maintained, but the overall execution time increases and productivity decreases
Solution Approach 1:
The scheduler segments operations into two distinct categories: standalone operations and sequence operations. This segmentation allows the system to apply different scheduling strategies to each type. Standalone operations can be executed independently when resources are available, while sequence operations are managed as coordinated groups, enabling parallel execution opportunities without compromising the simplicity of individual operation execution.
Solution Approach 2:
The scheduler ensures continuous utilization of execution resources by maintaining a pipeline of operations. When standalone operations are ready, they are executed immediately. When sequence operations are in progress, the scheduler continues to monitor and prepare subsequent operations, ensuring that resources remain productive and idle time is minimized, thereby maintaining continuous useful action throughout the system.
3Stability of the object's composition
If sequence operations are executed without interruption, then operation integrity is maintained, but the ability to handle incoming standalone requests deteriorates and rejection ratio increases
Solution Approach 1:
The scheduler dynamically adjusts the execution state of sequence operations based on system conditions. Sequence operations can be suspended when high-priority standalone requests arrive, and resumed when resources become available. This dynamic state management allows the system to maintain sequence integrity when needed while flexibly responding to incoming requests, preventing permanent loss of sequence coherence.
Solution Approach 2:
The scheduler performs preliminary actions by pre-loading and preparing sequence operations in advance. When a sequence operation is initiated, the scheduler prepares subsequent operations ahead of time, so that when the current operation completes or is suspended, the next operation is ready to execute immediately. This preliminary preparation reduces idle time and enables faster resumption of sequences after interruptions.
Data Source
AI summary
In an operation scheduler adapted to schedule in an asynchronous contention-based system a first FIFO queue is adapted to store one trigger message or one operation request. A message router is coupled to the first FIFO queue and is adapted to route instructions to a second FIFO queue or a memory and locate in the memory the instructions of a suspended operation associated with a trigger message and authorize execution of the suspended operation. An arbitration unit is coupled to the second FIFO queue and to the memory, and is adapted to schedule the execution of instructions associated with a standalone non-preemptable operation during a period of time within which at least one operation of the first sequence is being suspended.