Data Package Transfer Threading With Size-Based File Priority

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing data package transfer techniques lack an efficient algorithm for data file selection, often resulting in delays and bottlenecks due to random or alphabetical ordering, which disrupt project workflows and fail to consider the interconnected nature of multiple data files within a package.

Innovation Solution

Implementing size-based data file prioritization techniques that prioritize larger data files first, ensuring they are transferred on available transfer threads, thereby optimizing the use of allocated resources and reducing overall transfer time.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of time

If data files are transferred using random or alphabetical ordering, then the transfer process is simple to implement, but the overall transfer time increases and bottlenecks occur

Engineering Contradiction:
Improvedata package transfer timeVSAvoidfile selection algorithm complexity
Core Design Contradiction:
Loss of timeVSDevice complexity

Solution Approach 1:

The patent changes the parameter used for file selection from random or alphabetical ordering to size-based prioritization. By sorting files in descending order of size before transfer, the system ensures that larger files are transferred first, optimizing the use of transfer threads and reducing overall transfer time without requiring complex algorithms beyond standard sorting operations.

Inventive Principle:
Principle #35Parameter changes

2Productivity

If data files are transferred without size-based prioritization, then the transfer thread allocation is straightforward, but resource utilization is suboptimal and workflows are disrupted

Engineering Contradiction:
Improvedata transfer efficiencyVSAvoidthread assignment complexity
Core Design Contradiction:
ProductivityVSEase of operation

Solution Approach 1:

The patent applies preliminary action by sorting and prioritizing data files based on their sizes before the transfer process begins. This pre-processing step ensures that when transfer threads become available, the system can immediately assign the next largest file without complex real-time decision-making, thereby improving productivity while maintaining ease of operation.

Inventive Principle:
Principle #10Preliminary action

3Reliability

If conventional transfer techniques are used, then the system is easy to operate, but critical data files are not prioritized causing workflow delays

Engineering Contradiction:
Improveworkflow continuityVSAvoidfile prioritization mechanism
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent applies local quality by differentiating the treatment of individual files within the data package based on their specific characteristics (size). Instead of treating all files uniformly, the system assigns priority levels to each file according to its size, ensuring that critical large files are transferred first. This localized differentiation improves workflow continuity without requiring a fundamentally complex prioritization mechanism.

Inventive Principle:
Principle #3Local quality

Data Source

PatentUS20260039710A1Size-based data file prioritization for data package transfers
Publication Date: 2026.02.05 DELL PROD LP
  • US20260039710A1 patent drawing
  • US20260039710A1 patent drawing
  • US20260039710A1 patent drawing

AI summary

Techniques are provided for data file prioritization for data package transfers based on a size of the data files. One method includes obtaining a data package to be transferred, wherein the data package comprises multiple data files; obtaining respective sizes of the multiple data files in the obtained data package; determining a number of transfer threads for transferring the multiple data files in the obtained data package; assigning the multiple data files to the determined number of transfer threads based on the respective sizes of the multiple data files; and transferring the multiple data files using the assigned transfer threads. The largest data files of the multiple data files may be assigned to the determined number of transfer threads. When a transfer of a given data file on a given transfer thread completes, a largest remaining data file may be assigned to the given transfer thread.