Metadata Costing Engine Routing for On-Demand Deployment

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional web system deployment techniques lead to delays due to resource contention and inefficient handling of metadata deployments, particularly in on-demand services environments, where metadata packages face long waiting times in message queues, affecting performance and user expectations.

Innovation Solution

A metadata costing engine analyzes incoming metadata package requests based on characteristics such as size and resource requirements, allowing for smart routing decisions that bypass default message queues for smaller packages, enabling real-time deployment and optimizing resource usage through configurable cost criteria and alternate processing paths.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of time

If conventional message queue deployment is used, then resource management is simplified, but deployment latency increases and productivity decreases

Engineering Contradiction:
Improvedeployment latencyVSAvoiddeployment speed
Core Design Contradiction:
Loss of timeVSProductivity

Solution Approach 1:

The deployment system segments metadata packages by size characteristics (small vs. large) and routes them through different processing paths. Small packages bypass the message queue for immediate deployment, while large packages use the traditional message queue approach. This segmentation resolves the contradiction by optimizing the time-loss for small packages without overwhelming system resources.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system changes the processing parameter (synchronous vs. asynchronous deployment) based on package characteristics. For small metadata packages, the system switches to synchronous real-time deployment, eliminating queue waiting time. For large packages, asynchronous message queue deployment is maintained. This parameter change resolves the latency-productivity contradiction adaptively.

Inventive Principle:
Principle #35Parameter changes

2Productivity

If real-time deployment is implemented for all packages, then productivity increases, but system resource contention and instability increase

Engineering Contradiction:
Improvedeployment speedVSAvoidsystem stability
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The system applies different deployment qualities to different parts of the workload. Small metadata packages receive high-quality real-time synchronous deployment, while large packages use standard asynchronous message queue deployment. This local differentiation maintains system stability by reserving real-time resources for small packages while preventing resource exhaustion from large packages.

Inventive Principle:
Principle #3Local quality

Solution Approach 2:

The system applies real-time deployment partially, only to small metadata packages that benefit most from immediate processing. This partial action achieves productivity improvement where needed without the excessive resource consumption that would occur if real-time deployment were applied to all packages, thus maintaining system reliability.

Inventive Principle:
Principle #16Partial or excessive action

3Use of energy by moving object

If message queue processing is used, then resource usage is optimized for large packages, but loss of time increases for small packages

Engineering Contradiction:
Improveresource efficiencyVSAvoidwaiting time in queue
Core Design Contradiction:
Use of energy by moving objectVSLoss of time

Solution Approach 1:

The system segments the deployment workflow based on package size characteristics. Small packages are identified and routed to a direct synchronous deployment path, bypassing the message queue entirely. This segmentation eliminates unnecessary queue waiting time for small packages while maintaining the resource-efficient message queue path for large packages.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system extracts small metadata packages from the general message queue flow and processes them through a separate synchronous path. This extraction removes the time-loss element (queue waiting) for small packages while preserving the resource-efficient message queue mechanism for large packages that require it.

Inventive Principle:
Principle #2Taking out (Extraction)

Data Source

PatentUS11256430B2Criteria-based cost-efficient routing and deployment of metadata packages in an on-demand environment
Publication Date: 2022.02.22 SALESFORCE INC
  • US11256430B2 patent drawing
  • US11256430B2 patent drawing
  • US11256430B2 patent drawing

AI summary

In accordance with embodiments, there are provided mechanisms and methods for facilitating criteria-based cost-efficient routing and deployment of metadata packages in an on-demand services environment according to one embodiment. In one embodiment and by way of example, a method comprises analyzing, by a metadata costing server computing device, characteristics of a metadata package awaiting deployment, where analyzing includes matching the characteristics with predefined criteria associated with deployment of metadata packages. The method may further include routing, by the metadata server, the metadata package for real-time deployment if the characteristics satisfy the criteria, where the real-time deployment allows for bypassing of message queues associated with standard deployment.