Resource Allocation State Management via Escrow Records
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing resource allocation systems are inefficient and do not scale well with increasing numbers of clients, as they wait for acknowledgements to process requests, leading to slow and inefficient resource allocation and potential overprovisioning.
Innovation Solution
Implementing a records store (escrow) to temporarily store resource allocation records before commitment, allowing the processor to make informed decisions and prevent overprovisioning, while resources proactively pull workloads from the placement store, reducing latency and enabling faster allocation processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the central allocator waits for acknowledgements before processing the next allocation request, then overprovisioning is prevented, but allocation speed and efficiency deteriorate
Solution Approach 1:
The patent applies preliminary action by storing resource allocation records in an escrow (temporary storage) before they are fully committed. This allows the allocator to prepare and hold allocation decisions temporarily, enabling faster processing of subsequent requests while maintaining the ability to rollback if needed, thus preventing overprovisioning without waiting for full acknowledgements.
Solution Approach 2:
The escrow acts as an intermediary between the allocation decision and final commitment. By introducing this intermediate storage layer, the system can process allocations more rapidly while still maintaining reliability controls, as the escrow holds records temporarily allowing for verification and rollback capabilities.
2Measurement precision
If the allocator processes one request at a time waiting for acknowledgements, then resource allocation accuracy is maintained, but system scalability worsens with increasing numbers of clients
Solution Approach 1:
The patent segments the allocation process into distinct phases: temporary storage in escrow, commitment to placement store, and acknowledgement handling. This segmentation allows multiple allocation requests to be processed in parallel at different stages, improving scalability while maintaining accuracy through the structured progression through segments.
Solution Approach 2:
By performing preliminary storage of allocation records in the escrow before final commitment, the system can prepare multiple allocations simultaneously. This preliminary action enables the system to handle increasing numbers of clients more effectively while maintaining allocation accuracy through the staged commitment process.
3Reliability
If acknowledgements are waited for before resource allocation commitment, then overprovisioning is prevented, but latency in workload initiation increases
Solution Approach 1:
The escrow enables preliminary storage of allocation records before final commitment and acknowledgement. This allows the system to initiate workloads faster by having allocations prepared and held temporarily, reducing latency while maintaining overprovisioning prevention through the ability to verify and rollback from the escrow state.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
According to examples, an apparatus may include a processor and a memory on which is stored machine readable instructions that are to cause the processor to receive an allocation request from an allocator client, determine a resource allocation for the received job allocation request, store a record of the determined resource allocation in a records store, and send the determined resource allocation to the allocator client, in which an acknowledgement to the sent determined resource allocation is to be received from the allocator client. The instructions may also cause the processor to manage a state of the determined resource allocation using the record stored in the records store based on whether the acknowledgement is received from the allocator client.