Server Task Allocation via Expiration Time Requests
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current computer network systems face inefficiencies in task allocation, particularly with indeterminate computing tasks, leading to potential bottlenecks and poor load balancing, as they require central task allocation modules and extensive monitoring, which can result in communication overhead and inefficient resource utilization.
Innovation Solution
A method where server computers request processing tasks from processor computers with an associated expiration time, allowing tasks to be allocated and completed if no higher priority tasks intervene, enabling efficient task management and load balancing across interconnected computers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a central task allocator is used to distribute computing tasks, then task allocation can be monitored and load balancing can be achieved, but communication overhead increases and system complexity increases
Solution Approach 1:
The patent extracts the central task allocator from the system, allowing server computers to independently request and receive task allocations from processor computers without requiring a centralized monitoring authority. This eliminates the communication overhead and complexity associated with central task allocation while maintaining effective load balancing through distributed decision-making.
Solution Approach 2:
Server computers autonomously initiate task requests to processor computers based on their own workload needs and expiration times, without requiring external monitoring or allocation decisions. Each server computer serves itself by independently determining when and what tasks to request, eliminating the need for complex central allocation mechanisms.
2Productivity
If extensive monitoring is implemented to track task allocation, then load balancing can be maintained, but communication overhead increases and system efficiency decreases
Solution Approach 1:
The patent implements a feedback mechanism where server computers include expiration times in their task requests, allowing processor computers to automatically re-allocate tasks that are not completed within the specified time frame. This eliminates the need for continuous monitoring while maintaining load balancing through automatic task re-allocation based on completion status feedback.
Solution Approach 2:
Expiration times are predetermined and included in task requests before execution begins. This preliminary action allows the system to automatically handle task re-allocation without requiring ongoing monitoring or intervention, reducing communication overhead while maintaining effective load balancing.
3Adaptability or versatility
If tasks are allocated without expiration times, then flexibility is maintained, but idle periods increase and system responsiveness decreases
Solution Approach 1:
The patent introduces expiration time as a dynamic parameter in task allocation requests. This parameter allows server computers to specify their desired task completion timeframe, enabling flexible task allocation while preventing excessive idle periods. The expiration time parameter can be adjusted based on task priority and server workload conditions.
4Productivity
If central task allocation modules are used, then task distribution can be controlled, but bottlenecks occur and system efficiency decreases
Solution Approach 1:
The patent segments the task allocation function from a centralized module and distributes it across multiple processor computers. Each processor computer independently receives and processes task requests from server computers, eliminating the single-point bottleneck of central allocation while maintaining controlled task distribution through structured request-response protocols.
Data Source
AI summary
A method of allocating computing tasks in a communication network comprises providing a server that sends a request with an expiration time over the network to one or more processor computers for an allocation of a processing task to be performed by the server computer. The server computer performs the allocated processing task to completion if it's received within the expiration time and only if a higher priority task is not received before processing is completed.