Ticket Queue for Compute Process Access Control
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Multiprocessing systems face challenges with data collisions, synchronization of compute processes, and resource allocation due to inadequate file access control, particularly in environments where multiple nodes access shared resources, leading to inefficiencies and potential data corruption.
Innovation Solution
A ticket queue-based system is implemented, where compute processes create and manage their own tickets in a queue, determining access based on a deterministic ordering algorithm, allowing processes to perform tasks when their ticket is first in line, and removing it post-task, without relying on external services or locking mechanisms.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If lock-based systems are used to control access to shared resources, then data collision prevention is improved, but system complexity and performance overhead increase
Solution Approach 1:
The patent extracts the access control mechanism from traditional lock-based systems and implements it through a ticket queue system where compute processes independently manage their own access tickets. This removes the need for complex external locking services while maintaining data collision prevention through deterministic ordering of ticket processing.
Solution Approach 2:
Each compute process creates and manages its own access ticket independently without requiring external locking services. The processes self-organize into a queue based on ticket ordering algorithms, eliminating the need for centralized lock management and reducing system complexity.
2Ease of manufacture
If traditional file access control is used in multiprocessing systems, then implementation simplicity is maintained, but data corruption and synchronization issues occur
Solution Approach 1:
The patent introduces tickets as intermediary objects that mediate between compute processes and shared resources. These tickets encapsulate access rights and ordering information, providing a structured intermediate layer that prevents direct conflicting access to shared data while maintaining implementation simplicity through file-based ticket storage.
3Reliability
If external locking services are used to manage resource access, then access control reliability is improved, but service dependency and system coupling increase
Solution Approach 1:
The patent enables compute processes to self-manage their own access control through independently created and managed tickets. This eliminates dependency on external locking services, as each process autonomously determines its position in the access queue using the ticket ordering algorithm and manages its own access rights.
Solution Approach 2:
The access control functionality is segmented into individual tickets that can be independently created, managed, and processed by different compute processes. This segmentation distributes the access control logic across multiple independent process instances rather than requiring a centralized locking service.
Data Source
AI summary
Controlling compute process access to shared data and compute resources includes, responsive to a compute process determining that access to at least one of shared resources and shared data is necessary to perform a compute task, creating, by the compute process, a ticket file belonging to the compute process in a ticket queue directory. The compute process is allowed to proceed performing the compute task upon determining that the ticket file is first in line in a ticket queue of the ticket queue directory, according to a ticket ordering algorithm independently applied by the compute process. Subsequent to completing the compute task, the compute process removes the ticket from the ticket queue directory.