Bitmap P_Key Table for Scalable InfiniBand Partition Management
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing high performance computing environments face challenges in scalability and administrative bottlenecks due to traditional network and storage architectures, particularly in cloud computing fabrics.
Innovation Solution
The implementation of a scalable bitmap-based P_Key table in a high performance computing environment, utilizing InfiniBand technology and virtualization techniques such as SR-IOV, to enhance network communication and support live migration of virtual machines.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional network and storage architectures are used in cloud computing fabrics, then administrative management is simplified, but performance bottlenecks and scalability limitations occur
Solution Approach 1:
The patent segments the network architecture into multiple hierarchical levels (core layer, aggregation layer, access layer) to improve scalability and performance. Each layer handles specific functions independently, allowing the system to scale without creating administrative bottlenecks while maintaining manageable complexity through modular design
Solution Approach 2:
The patent introduces a new dimensional approach by implementing a bitmap-based P_Key table structure that extends traditional partition key management into a multi-dimensional space. This allows efficient handling of large numbers of partitions through bitwise operations rather than linear table lookups, resolving the contradiction between performance and complexity
2Adaptability or versatility
If the number of partitions is increased to support more virtual machines, then resource utilization improves, but P_Key table lookup overhead increases
Solution Approach 1:
The patent replaces the mechanical linear search mechanism in traditional P_Key tables with a bitmap-based bitwise operation system. This substitution enables constant-time O(1) lookup regardless of the number of partitions, allowing the system to scale to thousands of partitions without increasing lookup overhead while maintaining high adaptability
Solution Approach 2:
The patent changes the fundamental parameter of P_Key table representation from a linear array structure to a bitmap structure. This parameter change transforms the time complexity of partition key validation from O(n) to O(1), enabling scalable partition support without time loss in lookup operations
3Adaptability or versatility
If virtual machine live migration is implemented, then resource allocation flexibility improves, but network overhead increases
Solution Approach 1:
The patent implements preliminary action by pre-configuring bitmap-based P_Key tables in network switches before virtual machine migration occurs. This allows the network infrastructure to be pre-aware of potential migration paths and partition key mappings, enabling seamless live migration with minimal network overhead since the lookup mechanism is already optimized and ready
Data Source
AI summary
System and method for supporting scalable bitmap based P_Key table in a high performance computing environment. A method can provide, at least one subnet comprising one or more switches, a plurality of host channel adapters, and a plurality of end nodes. The method can associate the plurality of end nodes with at least one of a plurality of partitions, wherein each of the plurality of partitions are associated with a P_Key value. The method can associate each of the one or more switches with a bitmap based P_Key table of a plurality of bitmap based P_Key tables. The method can associate each of the host channel adapters with a bitmap based P_Key table of the plurality of bitmap based P_Key tables.