Topology-Aware Container Scheduling for Hardware Accelerator Utilization

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing container scheduling systems are inefficient in utilizing specialized hardware accelerators due to lack of awareness about cluster topology and latency tolerance, leading to suboptimal data transfer and increased latency, resulting in underutilization of these accelerators and higher costs.

Innovation Solution

Implementing cluster topology aware container scheduling that differentiates between inner and outer rings of servers, where inner rings have specialized hardware accelerators and outer rings do not, scheduling containers based on their latency tolerance to optimize the use of specialized hardware accelerators and minimize data transfer across network switches.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If containers are scheduled without awareness of cluster topology, then scheduling simplicity is maintained, but specialized hardware accelerator utilization is reduced and latency increases

Engineering Contradiction:
Improvehardware accelerator utilizationVSAvoidscheduling system complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The system segments the cluster topology into inner ring servers (with specialized hardware accelerators) and outer ring servers (without specialized hardware accelerators). The scheduler reads cluster topology information to identify which ring a target server belongs to, and based on this segmentation, makes informed scheduling decisions that prioritize placing containers requiring specialized computation on inner ring servers, thereby improving accelerator utilization without requiring complete redesign of the scheduling system

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system performs preliminary action by pre-reading and storing cluster topology information and latency tolerance requirements before scheduling decisions are made. The scheduler proactively identifies suitable target servers that match both the container's computational requirements and the cluster's physical topology, rather than reacting after arbitrary placement. This preliminary analysis enables optimized scheduling that improves hardware utilization while maintaining manageable complexity

Inventive Principle:
Principle #10Preliminary action

2Adaptability or versatility

If containers are placed on servers without specialized hardware accelerators, then deployment flexibility is improved, but data transfer latency increases due to network switch traversal

Engineering Contradiction:
Improvecontainer deployment flexibilityVSAvoiddata transfer latency
Core Design Contradiction:
Adaptability or versatilityVSLoss of time

Solution Approach 1:

The system applies local quality by differentiating between inner ring servers (with specialized hardware accelerators and lower latency characteristics) and outer ring servers (without specialized hardware accelerators and higher latency characteristics). The scheduler reads the container's latency tolerance requirement and matches it with the appropriate server ring - placing latency-sensitive containers on inner ring servers to minimize data transfer time, while maintaining deployment flexibility by still allowing placement on outer ring servers when appropriate

Inventive Principle:
Principle #3Local quality

Solution Approach 2:

The scheduling system dynamically adapts its decisions based on real-time readings of container latency tolerance requirements and current cluster topology status. Rather than using a static scheduling policy, the system adjusts its target server selection dynamically - choosing inner ring servers for real-time tolerance containers and potentially outer ring servers for batch tolerance containers, thereby optimizing data transfer latency while preserving deployment flexibility

Inventive Principle:
Principle #15Dynamics

3Productivity

If specialized hardware accelerators are underutilized, then system cost increases, but scheduling without topology awareness simplifies operations

Engineering Contradiction:
Improvespecialized hardware accelerator utilizationVSAvoidscheduling operation simplicity
Core Design Contradiction:
ProductivityVSEase of operation

Solution Approach 1:

The scheduling system performs self-service by automatically reading and interpreting cluster topology information and container latency tolerance requirements to make optimized scheduling decisions. Rather than requiring manual configuration or complex external orchestration, the scheduler autonomously identifies suitable target servers that match both the container's needs and the cluster's physical topology, improving hardware accelerator utilization while maintaining operational simplicity through automation

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The system implements feedback by reading container latency tolerance requirements and cluster topology information, using this information to make scheduling decisions, and thereby improving hardware accelerator utilization. The feedback loop incorporates topology awareness and latency requirements into the scheduling logic, enabling the system to automatically optimize accelerator usage without requiring complex manual intervention or sacrificing ease of operation

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS10467052B2Cluster topology aware container scheduling for efficient data transfer
Publication Date: 2019.11.05 RED HAT INC
  • US10467052B2 patent drawing
  • US10467052B2 patent drawing
  • US10467052B2 patent drawing

AI summary

A system and method for cluster topology aware container scheduling for efficient data transfer. The method begins by configuring a server architecture that includes an inner ring of servers including a server that is a specialized hardware accelerator that provides a specialized computation, an outer ring of servers that includes central processing unit servers and no specialized hardware accelerator, and a network switch to transfer data between the inner ring and the outer ring of servers. An orchestrator receives a request to execute a container, and the orchestrator reads a latency tolerance of the container, where the latency tolerance can be either a real time or a batch tolerance. The scheduler schedules the container to execute, based on the latency tolerance of the container, in either the inner ring or the outer ring of servers. The orchestrator injects the container with instructions to access the specialized hardware accelerator.