US10250510B2 - Intelligent network resource manager - Google Patents

Intelligent network resource manager Download PDF

Info

Publication number
US10250510B2
US10250510B2 US14/488,161 US201414488161A US10250510B2 US 10250510 B2 US10250510 B2 US 10250510B2 US 201414488161 A US201414488161 A US 201414488161A US 10250510 B2 US10250510 B2 US 10250510B2
Authority
US
United States
Prior art keywords
priority
category
virtual
virtual channels
messages
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active, expires
Application number
US14/488,161
Other versions
US20150089008A1 (en
Inventor
Vijay SRIDHARAN
Richard Frank
Jia Shi
Kothanda Umamageswaran
Juan Loaiza
Alexander Tsukerman
Bang Nguyen
Sumanta Chatterjee
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Oracle International Corp
Original Assignee
Oracle International Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Oracle International Corp filed Critical Oracle International Corp
Priority to US14/488,161 priority Critical patent/US10250510B2/en
Assigned to ORACLE INTERNATIONAL CORPORATION reassignment ORACLE INTERNATIONAL CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: NGUYEN, BANG, SHI, JIA, CHATTERJEE, SUMANTA, LOAIZA, JUAN, SRIDHARAN, VIJAY, TSUKERMAN, ALEX, UMAMAGESWARAN, KOTHANDA
Publication of US20150089008A1 publication Critical patent/US20150089008A1/en
Priority to US16/287,521 priority patent/US10742560B2/en
Application granted granted Critical
Publication of US10250510B2 publication Critical patent/US10250510B2/en
Active legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/24Traffic characterised by specific attributes, e.g. priority or QoS
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/24Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2425Traffic characterised by specific attributes, e.g. priority or QoS for supporting services specification, e.g. SLA
    • H04L47/2433Allocation of priorities to traffic types
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/24Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2441Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]
    • H04L67/322
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/60Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • H04L67/61Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources taking into account QoS or priority requirements

Definitions

  • the present invention relates to distributed systems.
  • QoS Quality of Service
  • OLTP Online Transaction Processing
  • DBMS database management system
  • Latency refers to the amount of time it takes to store or retrieve data. Latency is an issue even if the amount of data involved is small. For example, latency is affected as a request travels across switches, within a server's operating system I/O stack, and other hardware in a database system.
  • Redo logs are latency sensitive. Redo logs include redo records that provide a history of all changes made to the corresponding database. Redo log I/O is latency sensitive because transactions typically wait for return confirmation that the redo records have been persisted. Therefore, redo log I/O has a large impact on the performance of OLTP systems.
  • Other types of database I/O such as batch, reporting, and backup-related I/O, are less latency sensitive. Nevertheless, some types of database I/O that are not latency sensitive are significant consumers of network bandwidth. When non-latency sensitive I/O requires high network bandwidth, latency may increase. Database systems must handle both latency sensitive and non-latency sensitive transactions while taking latency sensitivity into consideration. Typical solutions for minimizing latency range from simply rescheduling bandwidth-intensive jobs (e.g. to off hours) to maintaining dedicated OLTP systems.
  • FIG. 1 is a block diagram depicting an embodiment of an assignment of a priority and a category to plurality of virtual channels associated with a physical communication channel;
  • FIG. 2 is a block diagram depicting an embodiment of an assignment of a priority, a category and a weight to a plurality of virtual channels associated with a physical communication channel;
  • FIG. 3 is a flow diagram that illustrates an embodiment of a process for directing outbound messages to a plurality of virtual channels associated with a physical communication channel based on priority;
  • FIG. 4 is a flow diagram that illustrates an embodiment of a process for directing outbound messages to a plurality of virtual channels associated with a physical communication channel based on priority and category;
  • FIG. 5 illustrates a computer system upon which one or more embodiments may be implemented.
  • a set of virtual channels are available on a physical communication channel.
  • the set of virtual channels allow multiple data flows to share the same physical communication channel.
  • Each virtual channel manages an independent data flow and may use distinct resources, such as buffering and flow control resources.
  • the virtual channels are processed in a circular order to send the outbound messages over the physical communication channel. At each turn, an equal portion of the data flow of each virtual channel is processed.
  • one or more virtual channels may be weighted, and a weighted portion of the data flow is processed.
  • a plurality of virtual channels is selected from the set of available virtual channels.
  • a selected priority is assigned to each virtual channel of the plurality of virtual channels.
  • the priority for each virtual channel is selected from a first priority and a second priority.
  • Outbound messages of the first priority are directed to virtual channels of the first priority
  • outbound messages of the second priority are directed to virtual channels of the second priority.
  • more virtual channels are assigned the first priority than the second priority. In other words, more virtual channels are available for messages of the first priority. When the virtual channels are processed in circular order, this leads to more bandwidth being available for the high priority outbound messages.
  • a selected category may also be assigned to each virtual channel of the plurality of virtual channels.
  • the category for each virtual channel is selected from a first category and a second category. Outbound messages of the first category are directed to virtual channels of the first category, and outbound messages of the second category are directed to virtual channels of the second category.
  • the first category is a first message size category
  • the second category is a second message size category that is larger than the first message size category. This prevents messages of the first message size from being queued after a larger message of the second message size in a virtual channel.
  • more virtual channels are assigned the first category than the second category such that more virtual channels are available for messages of the first category.
  • One or more available virtual channels may be reserved (i.e. not assigned a priority and/or category).
  • InfinibandTM provides QoS functionality including low-priority InfinibandTM Virtual Lanes and high-priority InfinibandTM Virtual Lanes.
  • the virtual channels assigned a priority and/or category are low-priority InfinibandTM Virtual Lanes.
  • One or more InfinibandTM Virtual Lanes may be reserved, including one or more high-priority InfinibandTM Virtual Lanes.
  • a first virtual channel set comprising at least two virtual channels is assigned a first priority.
  • a second virtual channel set comprising at least one virtual channel is assigned a second priority.
  • the first virtual channel set has more virtual channels than the second virtual channel set. Not all available virtual channels associated with the physical communication channel must be used.
  • REDO Log I/O messages are assigned the first priority.
  • outbound REDO Log I/O messages are directed to virtual channels of the first virtual channel set.
  • redo logs are generated for all changes made to a corresponding database.
  • Each redo record of a redo log file includes change vectors that describe changes made in the database. REDO Log I/O will be described in greater detail hereafter.
  • Categories may also be assigned to the virtual channels and used to directed outbound messages.
  • two categories are used: a first category for a small message size and a second category for a large message size.
  • the two categories may be determined based on a size threshold. This prevents messages of the first message size category from being queued after a larger message of the second message size category in a virtual channel.
  • the size threshold is determined based on one or more database properties, such as a data block size. The size threshold may be chosen such that most outbound REDO Log I/O messages are expected to fall into the first message size category.
  • each virtual channel of the first virtual channel set (i.e. the virtual channels assigned the first priority) is assigned one of the first category and the second category.
  • Outbound messages corresponding to the first category are directed to virtual channels of the first category, and outbound messages corresponding to the second category are directed to virtual channels of the second category.
  • three classes of virtual channels are created:
  • each virtual channel of the second virtual channel set (i.e. the virtual channels assigned the second priority) is assigned one of the first category and the second category.
  • three classes of virtual channels are created:
  • each virtual channel of both the first virtual channel set (i.e. the virtual channels assigned the first priority) and the second virtual channel set (i.e. the virtual channels assigned the second priority) is assigned one of the first category and the second category.
  • four classes of virtual channels are created:
  • FIG. 1 is a block diagram depicting an embodiment of an assignment of a priority and a category to plurality of virtual channels associated with a physical communication channel.
  • FIG. 1 shows a plurality of virtual channels associated with a physical communication channel. The virtual channels are shown using unique identifiers 0, 1, 2, 3, 4, 6, and 7. The virtual channels are logical channels associated with the physical communication channel.
  • the virtual channels are assigned a priority selected from a set of possible priorities. For example, virtual channels 1, 2, 4, 6, and 7 are assigned a first priority 102 (“PRIORITY 1”), and virtual channels 0 and 3 are assigned a second priority 104 (“PRIORITY 2”). Outbound messages of the first priority are directed to virtual channels of the first priority 102 , while outbound messages of the second priority are directed to virtual channels of the second priority 104 .
  • the physical communication channel is configured to process the virtual channels in a round-robin order.
  • QoS may be tailored by changing the number of virtual channels assigned to a particular priority. In one embodiment, more virtual channels are assigned the first priority 102 than the second priority 104 .
  • the virtual channels may also be assigned a category selected from a set of possible categories. For example, virtual channels 1, 2, 3, and 7 are assigned a first category 106 (“CATEGORY 1”), and virtual channels 0, 4, and 6 are assigned a second category 108 (“CATEGORY 2”). Outbound messages corresponding to the first category 106 are directed to virtual channels of the first virtual channel set, while outbound messages corresponding to the second category 108 are directed to virtual channels of the second virtual channel set.
  • first category 106 (“CATEGORY 1”)
  • virtual channels 0, 4, and 6 are assigned a second category 108 (“CATEGORY 2”).
  • Outbound messages corresponding to the first category 106 are directed to virtual channels of the first virtual channel set
  • outbound messages corresponding to the second category 108 are directed to virtual channels of the second virtual channel set.
  • first category 106 may be a first message size category and second category 108 may be a second message size category that is larger than the first message size category.
  • first category 106 may be a first message size category
  • second category 108 may be a second message size category that is larger than the first message size category.
  • more virtual channels are assigned the first priority 102 than the second priority 104 .
  • the first priority 102 For example, in FIG. 1 , of the four virtual channels assigned the first category 106 , three virtual channels are assigned the first priority 102 and one virtual channel is assigned the second priority 104 .
  • more virtual channels are assigned the first priority 102 than the second priority 104 .
  • the first priority 102 For example, in FIG. 1 , of the three virtual channels assigned the second category 106 , two virtual channels are assigned the first priority 102 and one virtual channel is assigned the second priority 104 .
  • FIG. 2 is a block diagram depicting an embodiment of an assignment of a priority, a category and a weight to a plurality of virtual channels associated with a physical communication channel.
  • Table 250 includes data corresponding to a plurality of virtual channels associated with a physical communication channel.
  • available virtual channels such as InfinibandTM Virtual Lanes, are configured on one or more devices. Such configurations may be propagated across other connected devices in the same network.
  • the Lane ID 252 field contains a unique identifier for each virtual channel in a set of virtual channels.
  • the virtual channels specified by a particular lane ID 250 may be assigned at least one of a priority, category and weight.
  • the priority 254 field contains the priority assigned to the corresponding virtual channel.
  • the category 256 field contains the category assigned to the corresponding virtual channel.
  • the weight 258 contains the weight assigned to the corresponding virtual channel.
  • one or more virtual channels in a set of available virtual channels is reserved.
  • Reserved virtual channel 260 is not assigned a priority 254 or category 256 because it is not used in the described QoS scheme that is based on priority and/or category.
  • reserved virtual channel 260 may be used in another QoS scheme.
  • the InfinibandTM architecture provides 8 virtual lanes, which may be each designated as a high-priority InfinibandTM virtual lane or a low-priority InfinibandTM Virtual Lane.
  • Reserved virtual channel 260 may be reserved for potential or actual use as a high-priority InfinibandTM Virtual Lane, while the non-reserved virtual channels may be implemented as low-priority InfinibandTM Virtual Lanes.
  • a mechanism is implemented to prevent unauthorized software from using reserved virtual channel 260 .
  • the assignment data shown in FIG. 2 is presented as a single table.
  • the actual assignment data may be stored as one or more tables or as one or more other data structures.
  • the assignment data in table 250 may be used to configure one or more network elements, including one or more switches, routers and/or other hardware in an underlying network architecture, such as an InfinibandTM switch, router and/or other hardware.
  • the configuration may be performed automatically, such as based on a configuration file, automatic optimization tests or procedures, a default setting, or other configuration settings.
  • a user such as an administrator, manager, or other user, may perform one or more portions of the configuration, including specifying how many Virtual Lanes map to a particular priority and/or category.
  • the specific Virtual Lanes that map to a particular priority and/or category may also be mapped.
  • the priority assigned to different messages, the category types, the category ranges, and the weights of the Virtual Lanes may be configured.
  • Outbound messages in the virtual channels are processed and sent over the physical communication channel.
  • the virtual channels are processed in a circular order.
  • the virtual channels may be processed using a round-robin scheme. In this case, bandwidth is assigned to each process in equal portions and in circular order, and messages from the virtual channels are processed.
  • the virtual channels are processed using a weighted round-robin scheme. In this case, bandwidth is assigned to each process in proportion to the weight and in circular order. If a particular virtual channel is empty or becomes empty during its turn before processing and sending the allocated amount of data, processing proceeds to the next virtual channel. No additional priority scheme is necessary other than the virtual channel configuration by priority, category and/or weight.
  • the messages are segmented into packets based on size, and an equal number of packets are processed and sent from a virtual channel during its turn in the round-robin order.
  • the virtual channels are weighted, and the number of packets that are processed and sent from a virtual channel during its turn up is weighted based on the weight assigned to the virtual channel.
  • One or more embodiments described herein may be implemented over any network architecture, including but not limited to a switch-based I/O fabric architecture.
  • the implementation may use one or more features of the network architecture.
  • the implementation is designed for an InfiniBandTM fabric architecture.
  • InfiniBandTM is a switched-based I/O fabric architecture typically used for high-performance and/or enterprise solutions.
  • a switched fabric network topology includes network nodes interconnected by one or more network switches.
  • the switched fabric network spreads network traffic across multiple physical links.
  • Features of InfiniBandTM include high throughput, low latency, QoS, failover, and scalability.
  • the switched fabric architecture provides scalability which can be accomplished by adding switches to the fabric. Unlike a shared bus architecture, the aggregate bandwidth increases as additional switches are added to the network. Multiple paths between devices keep the aggregate bandwidth high and provide failsafe, redundant connections.
  • InfiniBandTM transmits data as messages or packets of up to 4 KB. Examples of messages include a direct memory access read from or, write to, a remote node, a channel send, a channel receive, a transaction-based operation, a multicast transmission and an atomic operation. All InfiniBandTM transmissions begin or end at a channel adapter. For example, processors have host channel adapters (HCAs) and peripherals have target channel adapters (TCAs). These channel adapters can also exchange information for security or QoS.
  • HCAs host channel adapters
  • TCAs target channel adapters
  • Communications are transmitted as messages that are segmented into packets.
  • the payload of each packet is limited by the maximum transmit unit (MTU) negotiated for the path between a first channel adapter and a second channel adapter. Segmentation and reassembly of packets is done in hardware.
  • MTUs are 256 bytes and 2048 bytes.
  • one or more embodiments described herein are implemented on an InfinibandTM architecture by configuring InfinibandTM Virtual Lanes (VL). For example, priority tables, Service Level (SL) to Virtual Lane (VL) mapping and the QoS policy rules are configured in the InfinibandTM devices. This information will get propagated to new nodes when they join the fabric.
  • VL Virtual Lanes
  • SL Service Level
  • VL Virtual Lane
  • the port side of a channel adapter implements InfiniBandTM Virtual Lanes.
  • InfiniBandTM Virtual Lanes enable multiple independent data flows to share same physical communication link. Buffering and flow control may be separately implemented for each Virtual Lane.
  • 8 Virtual Lanes are available on each InfiniBandTM link.
  • QoS is supported via low-priority InfinibandTM Virtual Lane and high-priority InfinibandTM Virtual Lane configurations.
  • Each Virtual Lane has its own dedicated set of associated buffering resources.
  • the InfiniBandTM fabric can be regarded as an overlay of multiple logical fabrics that only share the physical links.
  • Virtual lane arbitration is the mechanism an output port utilizes to select from which Virtual Lane to transmit.
  • the InfiniBandTM architecture specifies a dual-priority weighted round robin scheme.
  • bandwidth is assigned to each process in equal portions and in circular order, handling all processes without priority.
  • bandwidth is assigned to each process in proportion to the weight.
  • Packets from high-priority InfiniBandTM Virtual Lanes are always transmitted ahead of those from low-priority InfiniBandTM Virtual Lanes.
  • data is transmitted from InfiniBandTM Virtual Lanes in approximate proportion to their assigned weights (excluding InfiniBandTM Virtual Lanes that have no outbound data to be transmitted).
  • InfiniBandTM is further described in Crupnicoff, Diego et al., “Deploying Quality of Service and Congestion Control in InfiniBand-based Data Center Networks,” (Document No. 2379, Rev. 1.0), available at “http://www.mellanox.com/pdf/whitepapers/deploying_qos_wp_10_19_2005.pdf,” the contents of which are incorporated herein by reference in its entirety.
  • one or more embodiments described herein may use the architecture described in the cited reference in a manner that deviates from the stated purpose in the cited reference.
  • InfiniBandTM provides for low-priority and high-priority InfinibandTM Virtual Lane configurations
  • using the built-in high-priority protocols does not achieve the desired performance, such as with respect to redo log I/O latency in the example described below.
  • redo logs are generated for all changes made to a corresponding database.
  • Each redo record of a redo log file includes change vectors that describe changes made in the database.
  • redo records are generated when a database operation is performed that makes changes to the database.
  • the redo logs may be used in many ways, including but not limited to database recovery, replay, rollback, backup, and other functions.
  • OLTP workload can benefit greatly from fast response times for database log writes.
  • redo log I/O latency strongly affects the performance of OLTP systems. If there are no application-related bottlenecks or contention for database locks and resources, one limiting factor in database system performance may be an amount of time spent waiting for redo log writes.
  • virtual channels are assigned priorities and categories to prioritize LGWR issued I/O to minimize redo log I/O latency, which shall be described in greater detail hereafter.
  • Redo log I/O is described in greater detail in: U.S. application Ser. No. 13/346,656, Utilizing Multiple Storage Devices To Reduce Write Latency For Database Logging, filed by Kesavan P. Srinivasan, et al. on Jan. 9, 2012; U.S. application Ser. No. 13/485,557, Rapid Recovery From Loss Of Storage Device Cache, filed by Juan R. Loaiza, et al. on May 31, 2012; U.S. application Ser. No. 13/801,319, Rapid Recovery From Downtime Of Mirrored Storage Device, filed by Juan R. Loaiza, et al. on May 13, 2013; U.S. application Ser. No.
  • the configuration described in this section is an example of a configuration for prioritizing redo log I/O to reduce latency. This configuration is deployable in an OracleTM ExadataTM database server.
  • I/Os issued by one or more LGWR processes are prioritized.
  • 3 QoS levels are defined:
  • I/O messages with a QoS level of NORMAL and DEFAULT are treated equally. I/O messages with a QoS level of VIP are prioritized over those with a QoS level of NORMAL or DEFAULT.
  • the 32K size threshold is based on one or more database block size characteristics.
  • redo log I/O messages are typically directed to the VIP, SMALL Virtual Lanes.
  • one or more LGWR processes may be hashed to one of the three VIP/SMALL Virtual Lanes.
  • FIG. 3 is a flow diagram that illustrates an embodiment of a process for directing outbound messages to a plurality of virtual channels associated with a physical communication channel based on priority.
  • Process 300 may be performed by one or more computing devices.
  • one or more blocks of process 300 may be performed by computer system 500 .
  • a first priority is assigned to a first virtual channel set.
  • the first virtual channel set includes at least two virtual channels selected from a plurality of virtual channels associated with a physical communication channel.
  • a second priority is assigned to a second virtual channel set.
  • the second virtual channel set includes at least two virtual channels selected from the same plurality of virtual channels associated with the same physical communication channel.
  • the first virtual channel set has more virtual channels than the second virtual channel set, so more virtual channels of the plurality of virtual channels are assigned the first priority than the second priority.
  • outbound messages of the first priority are directed to the virtual channels belonging to the first virtual channel set.
  • one or more specific message types are identified as having first priority.
  • the one or more specific message types may be pre-determined or dynamically specified, such as by a user.
  • REDO log I/O messages are identified as having the first priority.
  • outbound messages of the second priority are directed to the virtual channels belonging to the second virtual channel set.
  • one or more specific message types are identified as having the second priority.
  • the one or more specific message types may be pre-determined or dynamically specified, such as by a user.
  • a set of prioritized message types are identified as having the first priority outbound messages, and remaining messages types (e.g. outbound messages of a type not included in the set of prioritized message types) are treated as having the second priority.
  • the virtual channels are processed in round-robin order. Outbound messages in the virtual channels are sequentially processed and sent over the physical communication channel. In one embodiment, the messages are segmented into packets based on size, and an equal number of packets are processed and sent from a virtual channel during its turn in the round-robin order. In one embodiment, the virtual channels are weighted, and the number of packets that are processed and sent from a virtual channel during its turn is weighted based on the weight assigned to the virtual channel. If a particular virtual channel is empty or becomes empty during its turn, processing proceeds to the next virtual channel.
  • FIG. 4 is a flow diagram that illustrates an embodiment of a process for directing outbound messages to a plurality of virtual channels associated with a physical communication channel based on priority and another category.
  • Process 400 may be performed by one or more computing devices.
  • one or more blocks of process 400 may be performed by computer system 500 .
  • a selected priority and a selected category are assigned to each virtual channel of a plurality of virtual channels associated with a physical communication channel.
  • the selected priority is selected from two or more valid priorities, which may be pre-determined or dynamically specified, such as by a user.
  • the selected priority may be selected from a first priority and a second priority.
  • the first priority is considered a higher priority than the second priority.
  • More virtual channels of the plurality of virtual channels may be assigned the first priority than the second priority.
  • the selected category is selected from two or more valid categories, which may be pre-determined or dynamically specified, such as by a user.
  • the category is based on message size.
  • the selected category may be selected from a small message size category and a large message size category.
  • the size categories are defined by one or more thresholds such that REDO log I/O messages typically fall under the small message size category.
  • outbound messages are directed to the plurality of virtual channels based on category and priority. For example, if the categories include a first category and a second category, then outbound messages of the first category are directed to a virtual channel assigned the first category, while outbound messages of the second category are directed to a virtual channel assigned the second category.
  • the two or more valid categories are based on size.
  • the valid categories may include a small message size category and a large message size category.
  • the valid categories may be defined by one or more size thresholds.
  • Outbound messages are also directed to a virtual channel based on priority. Outbound messages of a particular priority are directed to one of the virtual channels assigned the particular priority. In one embodiment, one or more specific message types are assigned the particular priority.
  • the valid priorities include at least a first priority and a second priority, where more virtual channels are assigned the first priority than the second priority.
  • one or more first specific message types are identified as having the first priority
  • one or more second specific message types are identified as having the second priority.
  • the one or more first specific message types and/or the one or more second specific message types may be pre-determined or dynamically specified, such as by a user.
  • REDO log I/O messages are identified as having the first priority.
  • a specific set of message types are identified as having the first priority, and remaining outbound messages (e.g. outbound messages of a type not included in the specific set of message types) are assigned the second priority.
  • the virtual channels are processed in a circular order to send the outbound messages over the physical communication channel.
  • the messages are segmented into packets based on size, and an equal number of packets are processed and sent from a virtual channel during its turn in the round-robin order.
  • the virtual channels are weighted, and the number of packets that are processed and sent from a virtual channel during its turn is weighted based on the weight assigned to the virtual channel. If a particular virtual channel is empty or becomes empty during its turn, processing proceeds to the next virtual channel.
  • the techniques described herein are implemented by one or more special-purpose computing devices.
  • the special-purpose computing devices may be hard-wired to perform the techniques, or may include digital electronic devices such as one or more application-specific integrated circuits (ASICs) or field programmable gate arrays (FPGAs) that are persistently programmed to perform the techniques, or may include one or more general purpose hardware processors programmed to perform the techniques pursuant to program instructions in firmware, memory, other storage, or a combination.
  • ASICs application-specific integrated circuits
  • FPGAs field programmable gate arrays
  • Such special-purpose computing devices may also combine custom hard-wired logic, ASICs, or FPGAs with custom programming to accomplish the techniques.
  • the special-purpose computing devices may be desktop computer systems, portable computer systems, handheld devices, networking devices or any other device that incorporates hard-wired and/or program logic to implement the techniques.
  • FIG. 5 is a block diagram that illustrates a computer system 500 upon which an embodiment of the invention may be implemented.
  • Computer system 500 includes a bus 502 or other communication mechanism for communicating information, and a hardware processor 504 coupled with bus 502 for processing information.
  • Hardware processor 504 may be, for example, a general purpose microprocessor.
  • Computer system 500 also includes a main memory 506 , such as a random access memory (RAM) or other dynamic storage device, coupled to bus 502 for storing information and instructions to be executed by processor 504 .
  • Main memory 506 also may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 504 .
  • Such instructions when stored in non-transitory storage media accessible to processor 504 , render computer system 500 into a special-purpose machine that is customized to perform the operations specified in the instructions.
  • Computer system 500 further includes a read only memory (ROM) 508 or other static storage device coupled to bus 502 for storing static information and instructions for processor 504 .
  • ROM read only memory
  • a storage device 510 such as a magnetic disk, optical disk, or solid-state drive is provided and coupled to bus 502 for storing information and instructions.
  • Computer system 500 may be coupled via bus 502 to a display 512 , such as a cathode ray tube (CRT), for displaying information to a computer user.
  • a display 512 such as a cathode ray tube (CRT)
  • An input device 514 is coupled to bus 502 for communicating information and command selections to processor 504 .
  • cursor control 516 is Another type of user input device
  • cursor control 516 such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 504 and for controlling cursor movement on display 512 .
  • This input device typically has two degrees of freedom in two axes, a first axis (e.g., x) and a second axis (e.g., y), that allows the device to specify positions in a plane.
  • Computer system 500 may implement the techniques described herein using customized hard-wired logic, one or more ASICs or FPGAs, firmware and/or program logic which in combination with the computer system causes or programs computer system 500 to be a special-purpose machine. According to one embodiment, the techniques herein are performed by computer system 500 in response to processor 504 executing one or more sequences of one or more instructions contained in main memory 506 . Such instructions may be read into main memory 506 from another storage medium, such as storage device 510 . Execution of the sequences of instructions contained in main memory 506 causes processor 504 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions.
  • Non-volatile media includes, for example, optical disks, magnetic disks, or solid-state drives, such as storage device 510 .
  • Volatile media includes dynamic memory, such as main memory 506 .
  • storage media include, for example, a floppy disk, a flexible disk, hard disk, solid-state drive, magnetic tape, or any other magnetic data storage medium, a CD-ROM, any other optical data storage medium, any physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, NVRAM, any other memory chip or cartridge.
  • Storage media is distinct from but may be used in conjunction with transmission media.
  • Transmission media participates in transferring information between storage media.
  • transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 502 .
  • transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications.
  • Various forms of media may be involved in carrying one or more sequences of one or more instructions to processor 504 for execution.
  • the instructions may initially be carried on a magnetic disk or solid-state drive of a remote computer.
  • the remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem.
  • a modem local to computer system 500 can receive the data on the telephone line and use an infra-red transmitter to convert the data to an infra-red signal.
  • An infra-red detector can receive the data carried in the infra-red signal and appropriate circuitry can place the data on bus 502 .
  • Bus 502 carries the data to main memory 506 , from which processor 504 retrieves and executes the instructions.
  • the instructions received by main memory 506 may optionally be stored on storage device 510 either before or after execution by processor 504 .
  • Computer system 500 also includes a communication interface 518 coupled to bus 502 .
  • Communication interface 518 provides a two-way data communication coupling to a network link 520 that is connected to a local network 522 .
  • communication interface 518 may be an integrated services digital network (ISDN) card, cable modem, satellite modem, or a modem to provide a data communication connection to a corresponding type of telephone line.
  • ISDN integrated services digital network
  • communication interface 518 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN.
  • LAN local area network
  • Wireless links may also be implemented.
  • communication interface 518 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.
  • Network link 520 typically provides data communication through one or more networks to other data devices.
  • network link 520 may provide a connection through local network 522 to a host computer 524 or to data equipment operated by an Internet Service Provider (ISP) 526 .
  • ISP 526 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 528 .
  • Internet 528 uses electrical, electromagnetic or optical signals that carry digital data streams.
  • the signals through the various networks and the signals on network link 520 and through communication interface 518 which carry the digital data to and from computer system 500 , are example forms of transmission media.
  • Computer system 500 can send messages and receive data, including program code, through the network(s), network link 520 and communication interface 518 .
  • a server 530 might transmit a requested code for an application program through Internet 528 , ISP 526 , local network 522 and communication interface 518 .
  • the received code may be executed by processor 504 as it is received, and/or stored in storage device 510 , or other non-volatile storage for later execution.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

A method and apparatus for intelligent network resource manager for distributed computing systems is provided. A first priority is assigned to a first virtual channel set that includes at least two virtual channels of a plurality of virtual channels associated with a physical communication channel. A second priority is assigned to a second virtual channel set that includes at least one virtual channel of the plurality of virtual channels. The first virtual channel set has more virtual channels than the second virtual channel set. Outbound messages of the first priority are directed to virtual channels of the first virtual channel set. Outbound messages of the second priority are directed to virtual channels of the second virtual channel set. The virtual channels are processed in a round-robin order, where processing includes sending the outbound messages over the physical communication channel.

Description

CROSS-REFERENCE TO RELATED APPLICATIONS; BENEFIT CLAIM
This application claims the benefit of Provisional Appln. 61/880,660, filed Sep. 20, 2013 the entire contents of which is hereby incorporated by reference as if fully set forth herein, under 35 U.S.C. § 119(e).
FIELD OF THE INVENTION
The present invention relates to distributed systems.
BACKGROUND
As Internet technologies advance, e-commerce, multimedia, business-to-business and other applications must reliably support an increasing volume of data. Large amounts of traffic must be routed while maintaining specified Quality of Service (QoS) levels. QoS refers to the capability of a network to provide consistent levels of service to selected network traffic or applications. QoS levels are particularly important in Online Transaction Processing (OLTP) systems designed to immediately respond to user requests. OLTP involves obtaining input data, processing the data, and performing updates in the system to reflect the processed input data. Most applications use a database management system (DBMS) to support OLTP.
One important factor for database I/O performance is latency. Latency refers to the amount of time it takes to store or retrieve data. Latency is an issue even if the amount of data involved is small. For example, latency is affected as a request travels across switches, within a server's operating system I/O stack, and other hardware in a database system.
Different types of database input and output (I/O) have different sensitivities to latency. For example, in the Oracle™ Relational Database Management System (RDBMS) environment, redo logs are latency sensitive. Redo logs include redo records that provide a history of all changes made to the corresponding database. Redo log I/O is latency sensitive because transactions typically wait for return confirmation that the redo records have been persisted. Therefore, redo log I/O has a large impact on the performance of OLTP systems. Other types of database I/O, such as batch, reporting, and backup-related I/O, are less latency sensitive. Nevertheless, some types of database I/O that are not latency sensitive are significant consumers of network bandwidth. When non-latency sensitive I/O requires high network bandwidth, latency may increase. Database systems must handle both latency sensitive and non-latency sensitive transactions while taking latency sensitivity into consideration. Typical solutions for minimizing latency range from simply rescheduling bandwidth-intensive jobs (e.g. to off hours) to maintaining dedicated OLTP systems.
Thus, there is a need for a solution that effectively utilizes storage network bandwidth while at the same time, meeting the latency requirements for latency-sensitive Database I/O.
The approaches described in this section are approaches that could be pursued, but not necessarily approaches that have been previously conceived or pursued. Therefore, unless otherwise indicated, it should not be assumed that any of the approaches described in this section qualify as prior art merely by virtue of their inclusion in this section.
BRIEF DESCRIPTION OF THE DRAWINGS
In the drawings:
FIG. 1 is a block diagram depicting an embodiment of an assignment of a priority and a category to plurality of virtual channels associated with a physical communication channel;
FIG. 2 is a block diagram depicting an embodiment of an assignment of a priority, a category and a weight to a plurality of virtual channels associated with a physical communication channel;
FIG. 3 is a flow diagram that illustrates an embodiment of a process for directing outbound messages to a plurality of virtual channels associated with a physical communication channel based on priority;
FIG. 4 is a flow diagram that illustrates an embodiment of a process for directing outbound messages to a plurality of virtual channels associated with a physical communication channel based on priority and category; and
FIG. 5 illustrates a computer system upon which one or more embodiments may be implemented.
DETAILED DESCRIPTION
In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, that the present invention may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to avoid unnecessarily obscuring the present invention.
General Overview
An intelligent network resource manager is described herein. A set of virtual channels are available on a physical communication channel. The set of virtual channels allow multiple data flows to share the same physical communication channel. Each virtual channel manages an independent data flow and may use distinct resources, such as buffering and flow control resources. The virtual channels are processed in a circular order to send the outbound messages over the physical communication channel. At each turn, an equal portion of the data flow of each virtual channel is processed. In one embodiment, one or more virtual channels may be weighted, and a weighted portion of the data flow is processed.
A plurality of virtual channels is selected from the set of available virtual channels. A selected priority is assigned to each virtual channel of the plurality of virtual channels. In one embodiment, the priority for each virtual channel is selected from a first priority and a second priority. Outbound messages of the first priority are directed to virtual channels of the first priority, and outbound messages of the second priority are directed to virtual channels of the second priority. In one embodiment, more virtual channels are assigned the first priority than the second priority. In other words, more virtual channels are available for messages of the first priority. When the virtual channels are processed in circular order, this leads to more bandwidth being available for the high priority outbound messages.
A selected category may also be assigned to each virtual channel of the plurality of virtual channels. In one embodiment, the category for each virtual channel is selected from a first category and a second category. Outbound messages of the first category are directed to virtual channels of the first category, and outbound messages of the second category are directed to virtual channels of the second category. In one embodiment, the first category is a first message size category, and the second category is a second message size category that is larger than the first message size category. This prevents messages of the first message size from being queued after a larger message of the second message size in a virtual channel. In one embodiment, more virtual channels are assigned the first category than the second category such that more virtual channels are available for messages of the first category.
One or more available virtual channels may be reserved (i.e. not assigned a priority and/or category). Infiniband™ provides QoS functionality including low-priority Infiniband™ Virtual Lanes and high-priority Infiniband™ Virtual Lanes. In one embodiment, the virtual channels assigned a priority and/or category are low-priority Infiniband™ Virtual Lanes. One or more Infiniband™ Virtual Lanes may be reserved, including one or more high-priority Infiniband™ Virtual Lanes.
Virtual Channel Priority and Category
In one embodiment, a first virtual channel set comprising at least two virtual channels is assigned a first priority. A second virtual channel set comprising at least one virtual channel is assigned a second priority. The first virtual channel set has more virtual channels than the second virtual channel set. Not all available virtual channels associated with the physical communication channel must be used.
In one embodiment, REDO Log I/O messages are assigned the first priority. Thus, outbound REDO Log I/O messages are directed to virtual channels of the first virtual channel set. In the Oracle™ RDBMS environment, redo logs are generated for all changes made to a corresponding database. Each redo record of a redo log file includes change vectors that describe changes made in the database. REDO Log I/O will be described in greater detail hereafter.
Categories may also be assigned to the virtual channels and used to directed outbound messages. In one embodiment, two categories are used: a first category for a small message size and a second category for a large message size. The two categories may be determined based on a size threshold. This prevents messages of the first message size category from being queued after a larger message of the second message size category in a virtual channel. In one embodiment, the size threshold is determined based on one or more database properties, such as a data block size. The size threshold may be chosen such that most outbound REDO Log I/O messages are expected to fall into the first message size category.
In one embodiment, each virtual channel of the first virtual channel set (i.e. the virtual channels assigned the first priority) is assigned one of the first category and the second category. Outbound messages corresponding to the first category are directed to virtual channels of the first category, and outbound messages corresponding to the second category are directed to virtual channels of the second category. In this case, three classes of virtual channels are created:
FIRST PRIORITY, FIRST CATEGORY;
FIRST PRIORITY, SECOND CATEGORY; and
SECOND PRIORITY.
When (1) REDO Log I/O messages are assigned the first priority, (2) the first category and the second category are based on size, and (3) most outbound REDO Log I/O messages are expected to fall into the first message size category, most outbound REDO Log I/O messages will be directed to virtual channels assigned the first priority and the first category.
In one embodiment, each virtual channel of the second virtual channel set (i.e. the virtual channels assigned the second priority) is assigned one of the first category and the second category. In this case, three classes of virtual channels are created:
FIRST PRIORITY
SECOND PRIORITY, FIRST CATEGORY; and
SECOND PRIORITY, SECOND CATEGORY.
When (1) REDO Log I/O messages are assigned the first priority, outbound REDO Log I/O messages will be directed to virtual channels assigned the first priority.
In one embodiment, each virtual channel of both the first virtual channel set (i.e. the virtual channels assigned the first priority) and the second virtual channel set (i.e. the virtual channels assigned the second priority) is assigned one of the first category and the second category. In this case, four classes of virtual channels are created:
FIRST PRIORITY, FIRST CATEGORY;
FIRST PRIORITY, SECOND CATEGORY;
SECOND PRIORITY, FIRST CATEGORY; and
SECOND PRIORITY, SECOND CATEGORY.
When (1) REDO Log I/O messages are assigned the first priority, (2) the first category and the second category are based on size, and (3) most outbound REDO Log I/O messages are expected to fall into the first message size category, most outbound REDO Log I/O messages will be directed to virtual channels assigned the first priority and the first category, and larger REDO Log I/O messages will be directed to virtual channels assigned the first priority and the second category.
FIG. 1 is a block diagram depicting an embodiment of an assignment of a priority and a category to plurality of virtual channels associated with a physical communication channel. FIG. 1 shows a plurality of virtual channels associated with a physical communication channel. The virtual channels are shown using unique identifiers 0, 1, 2, 3, 4, 6, and 7. The virtual channels are logical channels associated with the physical communication channel.
The virtual channels are assigned a priority selected from a set of possible priorities. For example, virtual channels 1, 2, 4, 6, and 7 are assigned a first priority 102 (“PRIORITY 1”), and virtual channels 0 and 3 are assigned a second priority 104 (“PRIORITY 2”). Outbound messages of the first priority are directed to virtual channels of the first priority 102, while outbound messages of the second priority are directed to virtual channels of the second priority 104.
The physical communication channel is configured to process the virtual channels in a round-robin order. QoS may be tailored by changing the number of virtual channels assigned to a particular priority. In one embodiment, more virtual channels are assigned the first priority 102 than the second priority 104.
The virtual channels may also be assigned a category selected from a set of possible categories. For example, virtual channels 1, 2, 3, and 7 are assigned a first category 106 (“CATEGORY 1”), and virtual channels 0, 4, and 6 are assigned a second category 108 (“CATEGORY 2”). Outbound messages corresponding to the first category 106 are directed to virtual channels of the first virtual channel set, while outbound messages corresponding to the second category 108 are directed to virtual channels of the second virtual channel set.
In one embodiment, the set of possible categories are defined based on message size. For example, first category 106 may be a first message size category and second category 108 may be a second message size category that is larger than the first message size category. When larger messages are directed to different virtual channels than smaller messages, smaller latency sensitive messages will typically reach the head of a virtual channel more predictably due to the elimination of the potential of incurring the transfer time for larger messages that were previously enqueued.
In one embodiment, for virtual channels assigned the first category 106, more virtual channels are assigned the first priority 102 than the second priority 104. For example, in FIG. 1, of the four virtual channels assigned the first category 106, three virtual channels are assigned the first priority 102 and one virtual channel is assigned the second priority 104.
In one embodiment, for virtual channels assigned the second category 108, more virtual channels are assigned the first priority 102 than the second priority 104. For example, in FIG. 1, of the three virtual channels assigned the second category 106, two virtual channels are assigned the first priority 102 and one virtual channel is assigned the second priority 104.
Virtual Channel Configuration
FIG. 2 is a block diagram depicting an embodiment of an assignment of a priority, a category and a weight to a plurality of virtual channels associated with a physical communication channel. Table 250 includes data corresponding to a plurality of virtual channels associated with a physical communication channel. In one embodiment, available virtual channels, such as Infiniband™ Virtual Lanes, are configured on one or more devices. Such configurations may be propagated across other connected devices in the same network.
In table 250, the Lane ID 252 field contains a unique identifier for each virtual channel in a set of virtual channels. The virtual channels specified by a particular lane ID 250 may be assigned at least one of a priority, category and weight. The priority 254 field contains the priority assigned to the corresponding virtual channel. The category 256 field contains the category assigned to the corresponding virtual channel. The weight 258 contains the weight assigned to the corresponding virtual channel. When, the virtual channels are weighted, the amount of data processed and sent from a particular virtual channel during its turn is weighted based on the weight assigned to the particular virtual channel.
In one embodiment, one or more virtual channels in a set of available virtual channels is reserved. Reserved virtual channel 260 is not assigned a priority 254 or category 256 because it is not used in the described QoS scheme that is based on priority and/or category. However, reserved virtual channel 260 may be used in another QoS scheme. For example, the Infiniband™ architecture provides 8 virtual lanes, which may be each designated as a high-priority Infiniband™ virtual lane or a low-priority Infiniband™ Virtual Lane. Reserved virtual channel 260 may be reserved for potential or actual use as a high-priority Infiniband™ Virtual Lane, while the non-reserved virtual channels may be implemented as low-priority Infiniband™ Virtual Lanes. In one embodiment, a mechanism is implemented to prevent unauthorized software from using reserved virtual channel 260.
The assignment data shown in FIG. 2 is presented as a single table. The actual assignment data may be stored as one or more tables or as one or more other data structures. The assignment data in table 250 may be used to configure one or more network elements, including one or more switches, routers and/or other hardware in an underlying network architecture, such as an Infiniband™ switch, router and/or other hardware.
The configuration may be performed automatically, such as based on a configuration file, automatic optimization tests or procedures, a default setting, or other configuration settings. In one embodiment, a user, such as an administrator, manager, or other user, may perform one or more portions of the configuration, including specifying how many Virtual Lanes map to a particular priority and/or category. The specific Virtual Lanes that map to a particular priority and/or category may also be mapped. In addition, the priority assigned to different messages, the category types, the category ranges, and the weights of the Virtual Lanes may be configured.
Virtual Channel Message Processing
Outbound messages in the virtual channels are processed and sent over the physical communication channel. In one embodiment, the virtual channels are processed in a circular order. The virtual channels may be processed using a round-robin scheme. In this case, bandwidth is assigned to each process in equal portions and in circular order, and messages from the virtual channels are processed. In one embodiment, the virtual channels are processed using a weighted round-robin scheme. In this case, bandwidth is assigned to each process in proportion to the weight and in circular order. If a particular virtual channel is empty or becomes empty during its turn before processing and sending the allocated amount of data, processing proceeds to the next virtual channel. No additional priority scheme is necessary other than the virtual channel configuration by priority, category and/or weight.
In one embodiment, the messages are segmented into packets based on size, and an equal number of packets are processed and sent from a virtual channel during its turn in the round-robin order. In one embodiment, the virtual channels are weighted, and the number of packets that are processed and sent from a virtual channel during its turn up is weighted based on the weight assigned to the virtual channel.
Infiniband™ Architecture
One or more embodiments described herein may be implemented over any network architecture, including but not limited to a switch-based I/O fabric architecture. The implementation may use one or more features of the network architecture. In one embodiment, the implementation is designed for an InfiniBand™ fabric architecture. InfiniBand™ is a switched-based I/O fabric architecture typically used for high-performance and/or enterprise solutions.
A switched fabric network topology includes network nodes interconnected by one or more network switches. The switched fabric network spreads network traffic across multiple physical links. Features of InfiniBand™ include high throughput, low latency, QoS, failover, and scalability. The switched fabric architecture provides scalability which can be accomplished by adding switches to the fabric. Unlike a shared bus architecture, the aggregate bandwidth increases as additional switches are added to the network. Multiple paths between devices keep the aggregate bandwidth high and provide failsafe, redundant connections.
InfiniBand™ transmits data as messages or packets of up to 4 KB. Examples of messages include a direct memory access read from or, write to, a remote node, a channel send, a channel receive, a transaction-based operation, a multicast transmission and an atomic operation. All InfiniBand™ transmissions begin or end at a channel adapter. For example, processors have host channel adapters (HCAs) and peripherals have target channel adapters (TCAs). These channel adapters can also exchange information for security or QoS.
Communications are transmitted as messages that are segmented into packets. The payload of each packet is limited by the maximum transmit unit (MTU) negotiated for the path between a first channel adapter and a second channel adapter. Segmentation and reassembly of packets is done in hardware. Typical MTUs are 256 bytes and 2048 bytes.
Infiniband™ Virtual Lanes
In one embodiment, one or more embodiments described herein are implemented on an Infiniband™ architecture by configuring Infiniband™ Virtual Lanes (VL). For example, priority tables, Service Level (SL) to Virtual Lane (VL) mapping and the QoS policy rules are configured in the Infiniband™ devices. This information will get propagated to new nodes when they join the fabric.
The port side of a channel adapter implements InfiniBand™ Virtual Lanes. InfiniBand™ Virtual Lanes enable multiple independent data flows to share same physical communication link. Buffering and flow control may be separately implemented for each Virtual Lane. Currently, 8 Virtual Lanes are available on each InfiniBand™ link. QoS is supported via low-priority Infiniband™ Virtual Lane and high-priority Infiniband™ Virtual Lane configurations. Each Virtual Lane has its own dedicated set of associated buffering resources. The InfiniBand™ fabric can be regarded as an overlay of multiple logical fabrics that only share the physical links.
Virtual lane arbitration is the mechanism an output port utilizes to select from which Virtual Lane to transmit. The InfiniBand™ architecture specifies a dual-priority weighted round robin scheme. In a round-robin scheme for scheduling, bandwidth is assigned to each process in equal portions and in circular order, handling all processes without priority. In a weighted round-robin scheme, bandwidth is assigned to each process in proportion to the weight.
Packets from high-priority InfiniBand™ Virtual Lanes are always transmitted ahead of those from low-priority InfiniBand™ Virtual Lanes. Within a given priority, data is transmitted from InfiniBand™ Virtual Lanes in approximate proportion to their assigned weights (excluding InfiniBand™ Virtual Lanes that have no outbound data to be transmitted).
InfiniBand™ is further described in Crupnicoff, Diego et al., “Deploying Quality of Service and Congestion Control in InfiniBand-based Data Center Networks,” (Document No. 2379, Rev. 1.0), available at “http://www.mellanox.com/pdf/whitepapers/deploying_qos_wp_10_19_2005.pdf,” the contents of which are incorporated herein by reference in its entirety. However, one or more embodiments described herein may use the architecture described in the cited reference in a manner that deviates from the stated purpose in the cited reference. For example, although InfiniBand™ provides for low-priority and high-priority Infiniband™ Virtual Lane configurations, using the built-in high-priority protocols does not achieve the desired performance, such as with respect to redo log I/O latency in the example described below.
Redo Log I/O
In the Oracle™ RDBMS environment, redo logs are generated for all changes made to a corresponding database. Each redo record of a redo log file includes change vectors that describe changes made in the database. For example, redo records are generated when a database operation is performed that makes changes to the database. The redo logs may be used in many ways, including but not limited to database recovery, replay, rollback, backup, and other functions.
When a transaction is committed, the redo records corresponding to the transaction are written to an available redo log file, along with data identifying the transaction. Oracle™ LoG WRiters (LGWRs) is a background process that writes the redo log buffers to the on-line redo log files. Whenever a transaction is committed, LGWR writes the transaction redo records from the redo log buffer to a redo log file, and assigns a system change number (SCN) to identify the redo records for each committed transaction. The process that submitted the transaction is notified that the transaction has committed only after all the redo records are persistently written. This is one point where reducing latency is important.
An OLTP workload can benefit greatly from fast response times for database log writes. With respect to redo log I/O, latency strongly affects the performance of OLTP systems. If there are no application-related bottlenecks or contention for database locks and resources, one limiting factor in database system performance may be an amount of time spent waiting for redo log writes. In one embodiment, virtual channels are assigned priorities and categories to prioritize LGWR issued I/O to minimize redo log I/O latency, which shall be described in greater detail hereafter.
Redo log I/O is described in greater detail in: U.S. application Ser. No. 13/346,656, Utilizing Multiple Storage Devices To Reduce Write Latency For Database Logging, filed by Kesavan P. Srinivasan, et al. on Jan. 9, 2012; U.S. application Ser. No. 13/485,557, Rapid Recovery From Loss Of Storage Device Cache, filed by Juan R. Loaiza, et al. on May 31, 2012; U.S. application Ser. No. 13/801,319, Rapid Recovery From Downtime Of Mirrored Storage Device, filed by Juan R. Loaiza, et al. on May 13, 2013; U.S. application Ser. No. 13/288,785, Write-Back Storage Cache Based On Fast Persistent Memory, filed by Bharat Chandra Baddepudi, et al. on Nov. 3, 2011; and U.S. application Ser. No. 12/871,805, Controlling Data Lag In A Replicated Computer System, filed by Jia Shi, et al. on Aug. 30, 2010; the contents of which are incorporated herein by reference in their entirety.
Example Configuration to Prioritize Redo Log I/O
The configuration described in this section is an example of a configuration for prioritizing redo log I/O to reduce latency. This configuration is deployable in an Oracle™ Exadata™ database server.
In an Oracle™ database, I/Os issued by one or more LGWR processes are prioritized. 3 QoS levels are defined:
VIP for LGWR initiated I/O operations;
NORMAL for other processes; and
DEFAULT for external clients that do not specify any QoS level,
I/O messages with a QoS level of NORMAL and DEFAULT are treated equally. I/O messages with a QoS level of VIP are prioritized over those with a QoS level of NORMAL or DEFAULT.
Two size categories are created:
SMALL for messages with up to 32K of payload; and
LARGE for messages with greater than 32K of payload.
The 32K size threshold is based on one or more database block size characteristics.
7 of the 8 available Virtual Lanes in the Infiniband™ architecture are configured as low-priority Infiniband™ Virtual Lanes. One Virtual Lane is reserved, such as for potential use as a high-priority Infiniband™ Virtual Lane. Seven virtual channels are configured as follows:
VIP, SMALL for 3 low-priority Infiniband™ Virtual Lanes;
VIP, LARGE for 1 low-priority Infiniband™ Virtual Lane;
DEFAULT/NORMAL, SMALL for 2 low-priority Infiniband™ Virtual Lanes; and
DEFAULT/NORMAL, LARGE for 1 low-priority Infiniband™ Virtual Lane.
Given the QoS level and typical size of redo log I/O, redo log I/O messages are typically directed to the VIP, SMALL Virtual Lanes. When multiple LGWR processes are running, one or more LGWR processes may be hashed to one of the three VIP/SMALL Virtual Lanes.
Process for Directing Outbound Messages Based on Priority
FIG. 3 is a flow diagram that illustrates an embodiment of a process for directing outbound messages to a plurality of virtual channels associated with a physical communication channel based on priority. Process 300 may be performed by one or more computing devices. For example, one or more blocks of process 300 may be performed by computer system 500.
In block 302, a first priority is assigned to a first virtual channel set. The first virtual channel set includes at least two virtual channels selected from a plurality of virtual channels associated with a physical communication channel.
In block 304, a second priority is assigned to a second virtual channel set. The second virtual channel set includes at least two virtual channels selected from the same plurality of virtual channels associated with the same physical communication channel. The first virtual channel set has more virtual channels than the second virtual channel set, so more virtual channels of the plurality of virtual channels are assigned the first priority than the second priority.
In block 306, outbound messages of the first priority are directed to the virtual channels belonging to the first virtual channel set. In one embodiment, one or more specific message types are identified as having first priority. The one or more specific message types may be pre-determined or dynamically specified, such as by a user. In one embodiment, REDO log I/O messages are identified as having the first priority.
In block 308, outbound messages of the second priority are directed to the virtual channels belonging to the second virtual channel set. In one embodiment, one or more specific message types are identified as having the second priority. The one or more specific message types may be pre-determined or dynamically specified, such as by a user. Alternatively or in addition, a set of prioritized message types are identified as having the first priority outbound messages, and remaining messages types (e.g. outbound messages of a type not included in the set of prioritized message types) are treated as having the second priority.
In block 310, the virtual channels are processed in round-robin order. Outbound messages in the virtual channels are sequentially processed and sent over the physical communication channel. In one embodiment, the messages are segmented into packets based on size, and an equal number of packets are processed and sent from a virtual channel during its turn in the round-robin order. In one embodiment, the virtual channels are weighted, and the number of packets that are processed and sent from a virtual channel during its turn is weighted based on the weight assigned to the virtual channel. If a particular virtual channel is empty or becomes empty during its turn, processing proceeds to the next virtual channel.
Process for Directing Outbound Messages Based on Priority and Category
FIG. 4 is a flow diagram that illustrates an embodiment of a process for directing outbound messages to a plurality of virtual channels associated with a physical communication channel based on priority and another category. Process 400 may be performed by one or more computing devices. For example, one or more blocks of process 400 may be performed by computer system 500.
In block 402, a selected priority and a selected category are assigned to each virtual channel of a plurality of virtual channels associated with a physical communication channel. The selected priority is selected from two or more valid priorities, which may be pre-determined or dynamically specified, such as by a user. For example, the selected priority may be selected from a first priority and a second priority. In one embodiment, the first priority is considered a higher priority than the second priority. More virtual channels of the plurality of virtual channels may be assigned the first priority than the second priority.
The selected category is selected from two or more valid categories, which may be pre-determined or dynamically specified, such as by a user. In one embodiment, the category is based on message size. For example, the selected category may be selected from a small message size category and a large message size category. In one embodiment, the size categories are defined by one or more thresholds such that REDO log I/O messages typically fall under the small message size category.
In block 404, outbound messages are directed to the plurality of virtual channels based on category and priority. For example, if the categories include a first category and a second category, then outbound messages of the first category are directed to a virtual channel assigned the first category, while outbound messages of the second category are directed to a virtual channel assigned the second category. In one embodiment, the two or more valid categories are based on size. For example, the valid categories may include a small message size category and a large message size category. When the valid categories include one or more size-based categories, the categories may be defined by one or more size thresholds.
Outbound messages are also directed to a virtual channel based on priority. Outbound messages of a particular priority are directed to one of the virtual channels assigned the particular priority. In one embodiment, one or more specific message types are assigned the particular priority.
In one embodiment, the valid priorities include at least a first priority and a second priority, where more virtual channels are assigned the first priority than the second priority. In one embodiment, one or more first specific message types are identified as having the first priority, and one or more second specific message types are identified as having the second priority. The one or more first specific message types and/or the one or more second specific message types may be pre-determined or dynamically specified, such as by a user. In one embodiment, REDO log I/O messages are identified as having the first priority.
Alternatively or in addition, a specific set of message types are identified as having the first priority, and remaining outbound messages (e.g. outbound messages of a type not included in the specific set of message types) are assigned the second priority.
In block 406, the virtual channels are processed in a circular order to send the outbound messages over the physical communication channel. In one embodiment, the messages are segmented into packets based on size, and an equal number of packets are processed and sent from a virtual channel during its turn in the round-robin order. In one embodiment, the virtual channels are weighted, and the number of packets that are processed and sent from a virtual channel during its turn is weighted based on the weight assigned to the virtual channel. If a particular virtual channel is empty or becomes empty during its turn, processing proceeds to the next virtual channel.
Hardware Overview
According to one embodiment, the techniques described herein are implemented by one or more special-purpose computing devices. The special-purpose computing devices may be hard-wired to perform the techniques, or may include digital electronic devices such as one or more application-specific integrated circuits (ASICs) or field programmable gate arrays (FPGAs) that are persistently programmed to perform the techniques, or may include one or more general purpose hardware processors programmed to perform the techniques pursuant to program instructions in firmware, memory, other storage, or a combination. Such special-purpose computing devices may also combine custom hard-wired logic, ASICs, or FPGAs with custom programming to accomplish the techniques. The special-purpose computing devices may be desktop computer systems, portable computer systems, handheld devices, networking devices or any other device that incorporates hard-wired and/or program logic to implement the techniques.
For example, FIG. 5 is a block diagram that illustrates a computer system 500 upon which an embodiment of the invention may be implemented. Computer system 500 includes a bus 502 or other communication mechanism for communicating information, and a hardware processor 504 coupled with bus 502 for processing information. Hardware processor 504 may be, for example, a general purpose microprocessor.
Computer system 500 also includes a main memory 506, such as a random access memory (RAM) or other dynamic storage device, coupled to bus 502 for storing information and instructions to be executed by processor 504. Main memory 506 also may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 504. Such instructions, when stored in non-transitory storage media accessible to processor 504, render computer system 500 into a special-purpose machine that is customized to perform the operations specified in the instructions.
Computer system 500 further includes a read only memory (ROM) 508 or other static storage device coupled to bus 502 for storing static information and instructions for processor 504. A storage device 510, such as a magnetic disk, optical disk, or solid-state drive is provided and coupled to bus 502 for storing information and instructions.
Computer system 500 may be coupled via bus 502 to a display 512, such as a cathode ray tube (CRT), for displaying information to a computer user. An input device 514, including alphanumeric and other keys, is coupled to bus 502 for communicating information and command selections to processor 504. Another type of user input device is cursor control 516, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 504 and for controlling cursor movement on display 512. This input device typically has two degrees of freedom in two axes, a first axis (e.g., x) and a second axis (e.g., y), that allows the device to specify positions in a plane.
Computer system 500 may implement the techniques described herein using customized hard-wired logic, one or more ASICs or FPGAs, firmware and/or program logic which in combination with the computer system causes or programs computer system 500 to be a special-purpose machine. According to one embodiment, the techniques herein are performed by computer system 500 in response to processor 504 executing one or more sequences of one or more instructions contained in main memory 506. Such instructions may be read into main memory 506 from another storage medium, such as storage device 510. Execution of the sequences of instructions contained in main memory 506 causes processor 504 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions.
The term “storage media” as used herein refers to any non-transitory media that store data and/or instructions that cause a machine to operate in a specific fashion. Such storage media may comprise non-volatile media and/or volatile media. Non-volatile media includes, for example, optical disks, magnetic disks, or solid-state drives, such as storage device 510. Volatile media includes dynamic memory, such as main memory 506. Common forms of storage media include, for example, a floppy disk, a flexible disk, hard disk, solid-state drive, magnetic tape, or any other magnetic data storage medium, a CD-ROM, any other optical data storage medium, any physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, NVRAM, any other memory chip or cartridge.
Storage media is distinct from but may be used in conjunction with transmission media. Transmission media participates in transferring information between storage media. For example, transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 502. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications.
Various forms of media may be involved in carrying one or more sequences of one or more instructions to processor 504 for execution. For example, the instructions may initially be carried on a magnetic disk or solid-state drive of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system 500 can receive the data on the telephone line and use an infra-red transmitter to convert the data to an infra-red signal. An infra-red detector can receive the data carried in the infra-red signal and appropriate circuitry can place the data on bus 502. Bus 502 carries the data to main memory 506, from which processor 504 retrieves and executes the instructions. The instructions received by main memory 506 may optionally be stored on storage device 510 either before or after execution by processor 504.
Computer system 500 also includes a communication interface 518 coupled to bus 502. Communication interface 518 provides a two-way data communication coupling to a network link 520 that is connected to a local network 522. For example, communication interface 518 may be an integrated services digital network (ISDN) card, cable modem, satellite modem, or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 518 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN. Wireless links may also be implemented. In any such implementation, communication interface 518 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.
Network link 520 typically provides data communication through one or more networks to other data devices. For example, network link 520 may provide a connection through local network 522 to a host computer 524 or to data equipment operated by an Internet Service Provider (ISP) 526. ISP 526 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 528. Local network 522 and Internet 528 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 520 and through communication interface 518, which carry the digital data to and from computer system 500, are example forms of transmission media.
Computer system 500 can send messages and receive data, including program code, through the network(s), network link 520 and communication interface 518. In the Internet example, a server 530 might transmit a requested code for an application program through Internet 528, ISP 526, local network 522 and communication interface 518.
The received code may be executed by processor 504 as it is received, and/or stored in storage device 510, or other non-volatile storage for later execution.
In the foregoing specification, embodiments of the invention have been described with reference to numerous specific details that may vary from implementation to implementation. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense. The sole and exclusive indicator of the scope of the invention, and what is intended by the applicants to be the scope of the invention, is the literal and equivalent scope of the set of claims that issue from this application, in the specific form in which such claims issue, including any subsequent correction.

Claims (17)

What is claimed is:
1. A method comprising:
assigning a selected priority and a selected category to each of a plurality of virtual channels selected from a set of virtual channels associated with a physical communication channel within a switched fabric;
wherein each selected priority is selected from a plurality of priorities comprising a first priority and a second priority;
wherein each selected category is selected from a plurality of categories comprising a first category and a second category, wherein the first category is based on a first message size and the second category is based on a second message size that is larger than the first message size, wherein more virtual channels are assigned the first category than the second category;
directing outbound messages to the plurality of virtual channels based on a category and a priority of each outbound message;
segmenting each outbound message into one or more respective packets to generate a plurality of packets that each do not exceed a maximum packet size, wherein said second message size exceeds said maximum packet size;
processing the plurality of virtual channels in a circular order to send a same amount of packets from said plurality of packets for each virtual channel over the physical communication channel within the switched fabric;
wherein the method is performed by one or more computing devices.
2. The method of claim 1,
wherein the outbound messages comprise database messages including redo records;
wherein redo records are associated with the first priority.
3. The method of claim 2, wherein the redo records comprise at least one data block.
4. The method of claim 2, wherein the redo records comprise at least one control message.
5. The method of claim 2, wherein:
the plurality of priorities contains a third priority;
the outbound messages comprise additional messages that do not contain redo records;
the additional messages comprise control messages that are associated with the second priority and data blocks that are associated with the third priority.
6. The method of claim 5, wherein:
the additional messages comprise small messages that contain a respective single data block;
the small messages are associated with the second priority.
7. The method of claim 1, wherein at least one physical communication channel comprises an InfiniBand link and the plurality of virtual channels are low-priority InfiniBand™ Virtual Lanes.
8. The method of claim 1, further comprising:
receiving configuration data specifying priority data for at least one message type;
determining the plurality of categories based at least in part on the priority data for the at least one message type.
9. A method comprising:
assigning a first priority to a first virtual channel set comprising at least two virtual channels of a plurality of virtual channels associated with a physical communication channel within a switched fabric;
assigning a second priority to a second virtual channel set comprising at least one virtual channel of the plurality of virtual channels;
wherein the first virtual channel set has more virtual channels than the second virtual channel set;
assigning one of a first category that is based on a first message size and a second category that is based on a second message size to each virtual channel of at least one virtual channel set of: the first virtual channel set or the second virtual channel set, wherein the first message size is smaller than the second message size, wherein more virtual channels are assigned the first category than the second category;
wherein outbound messages corresponding to the first category are directed to virtual channels of the first category;
wherein outbound messages corresponding to the second category are directed to virtual channels of the second category;
directing outbound messages of the first priority to virtual channels of the first virtual channel set;
directing outbound messages of the second priority to virtual channels of the second virtual channel set;
segmenting each outbound message into one or more respective packets to generate a plurality of packets that each do not exceed a maximum packet size, wherein said second message size exceeds said maximum packet size;
processing the plurality of virtual channels in a round-robin order, wherein processing comprises sending a same amount of packets from said plurality of packets for each virtual channel over the physical communication channel within the switched fabric;
wherein the method is performed by one or more computing devices.
10. One or more non-transitory computer-readable media storing instructions which, when executed by one or more computing devices, cause:
assigning a selected priority and a selected category to each of a plurality of virtual channels selected from a set of virtual channels associated with a physical communication channel within a switched fabric;
wherein each selected priority is selected from a plurality of priorities comprising a first priority and a second priority;
wherein each selected category is selected from a plurality of categories comprising a first category and a second category, wherein the first category is based on a first message size and the second category is based on a second message size that is larger than the first message size, wherein more virtual channels are assigned the first category than the second category;
directing outbound messages to the plurality of virtual channels based on a category and a priority of each outbound message;
segmenting each outbound message into one or more respective packets to generate a plurality of packets that each do not exceed a maximum packet size, wherein said second message size exceeds said maximum packet size;
processing the plurality of virtual channels in a circular order to send a same amount of packets from said plurality of packets for each virtual channel over the physical communication channel within the switched fabric.
11. The one or more non-transitory computer-readable media of claim 10,
wherein the outbound messages comprise database messages including redo records;
wherein redo records are associated with the first priority.
12. The one or more non-transitory computer-readable media of claim 11, wherein the redo records comprise at least one data block.
13. The one or more non-transitory computer-readable media of claim 11, wherein the redo records comprise at least one control message.
14. The one or more non-transitory computer-readable media of claim 11, wherein:
the plurality of priorities contains a third priority;
the outbound messages comprise additional messages that do not contain redo records;
the additional messages comprise control messages that are associated with the second priority and data blocks that are associated with the third priority.
15. The one or more non-transitory computer-readable media of claim 14, wherein:
the additional messages comprise small messages that contain a respective single data block;
the small messages are associated with the second priority.
16. The one or more non-transitory computer-readable media of claim 10, wherein at least one physical communication channel comprises an InfiniBand™ link and the plurality of virtual channels are low-priority InfiniBand™ Virtual Lanes.
17. The one or more non-transitory computer-readable media of claim 10, the instructions further comprising instructions for:
receiving configuration data specifying priority data for at least one message type;
determining the plurality of categories based at least in part on the priority data for the at least one message type.
US14/488,161 2013-09-20 2014-09-16 Intelligent network resource manager Active 2036-05-07 US10250510B2 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US14/488,161 US10250510B2 (en) 2013-09-20 2014-09-16 Intelligent network resource manager
US16/287,521 US10742560B2 (en) 2013-09-20 2019-02-27 Intelligent network resource manager

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201361880660P 2013-09-20 2013-09-20
US14/488,161 US10250510B2 (en) 2013-09-20 2014-09-16 Intelligent network resource manager

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/287,521 Continuation US10742560B2 (en) 2013-09-20 2019-02-27 Intelligent network resource manager

Publications (2)

Publication Number Publication Date
US20150089008A1 US20150089008A1 (en) 2015-03-26
US10250510B2 true US10250510B2 (en) 2019-04-02

Family

ID=52691989

Family Applications (2)

Application Number Title Priority Date Filing Date
US14/488,161 Active 2036-05-07 US10250510B2 (en) 2013-09-20 2014-09-16 Intelligent network resource manager
US16/287,521 Active US10742560B2 (en) 2013-09-20 2019-02-27 Intelligent network resource manager

Family Applications After (1)

Application Number Title Priority Date Filing Date
US16/287,521 Active US10742560B2 (en) 2013-09-20 2019-02-27 Intelligent network resource manager

Country Status (1)

Country Link
US (2) US10250510B2 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20240012771A1 (en) * 2020-11-05 2024-01-11 Google Llc Memory-Request Priority Up-Leveling

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9900837B2 (en) 2016-06-09 2018-02-20 Google Llc Multi-channel communications for sending push notifications to mobile devices
US11507522B2 (en) * 2019-12-06 2022-11-22 Advanced Micro Devices, Inc. Memory request priority assignment techniques for parallel processors
US11106365B1 (en) 2020-02-10 2021-08-31 EMC IP Holding Company LLC Flow control of input/output (IO) in a synchronous replication session
US11061835B1 (en) * 2020-02-12 2021-07-13 EMC IP Holding Company LLC Sensitivity matrix for system load indication and overload prevention
CN111611206A (en) * 2020-05-18 2020-09-01 深圳易伙科技有限责任公司 Message processing method and device based on platform-level enterprise message bus
CN113365105B (en) * 2021-06-30 2022-12-06 北京奇艺世纪科技有限公司 Content production control method, device, equipment and storage medium

Citations (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5500672A (en) * 1993-03-08 1996-03-19 Matsushita Electric Industrial Co., Ltd. Multi-media communication apparatus for transmitting audio information, video information and character information simultaneously
US5812528A (en) * 1995-11-17 1998-09-22 Telecommunications Techniques Corporation Measuring round trip time in ATM network virtual connections
US6005851A (en) * 1997-10-10 1999-12-21 Nortel Networks Corporation Adaptive channel control for data service delivery
US20010049289A1 (en) * 2000-05-31 2001-12-06 Samsung Electronics Co., Ltd. Method of transmitting and receiving graphic short message service messages in a portable radio terminal
US20020051456A1 (en) * 1999-06-08 2002-05-02 Nokia Corporation Selection of a virtual path or channel in a communications network
US20040120336A1 (en) * 2002-12-24 2004-06-24 Ariel Hendel Method and apparatus for starvation-free scheduling of communications
US20070092225A1 (en) * 2005-10-25 2007-04-26 Keita Inakura Moving picture recording apparatus
US20070198700A1 (en) * 2005-11-30 2007-08-23 Oracle International Corporation Database system configured for automatic failover with user-limited data loss
US7283468B1 (en) * 2002-03-15 2007-10-16 Packeteer, Inc. Method and system for controlling network traffic within the same connection with different packet tags by varying the policies applied to a connection
US20080259833A1 (en) * 2007-04-23 2008-10-23 Qualcomm Incorporated Method and apparatus for controlling data transmission in a wireless communication system
US20090002233A1 (en) * 2007-06-27 2009-01-01 Kung-Shuan Huang Methods and apparatuses for searching for satellite signals
US20090103501A1 (en) * 2007-10-22 2009-04-23 Farrag Osama I Decentralized Media Access Control for Ad-Hoc Mobile Wireless Network
US20100095025A1 (en) * 2003-09-18 2010-04-15 Brocade Communications Systems, Inc. Virtual channel remapping
US20100332676A1 (en) * 2009-06-30 2010-12-30 Sugumar Rabin A Software Aware Throttle Based Flow Control
US20110106778A1 (en) * 2009-11-05 2011-05-05 Oracle International Corporation Lock manager on disk
US20110185068A1 (en) * 2010-01-22 2011-07-28 Microsoft Corporation Multi-link remote protocol
US20110276699A1 (en) * 2010-05-09 2011-11-10 Pedersen Bradley J Systems and methods for allocation of classes of service to network connections corresponding to virtual channels
US20110310739A1 (en) * 2010-06-22 2011-12-22 Gunes Aybay Methods and apparatus for virtual channel flow control associated with a switch fabric
US20120197990A1 (en) * 2010-10-29 2012-08-02 International Business Machines Corporation Publish-subscribe messaging
US20140036930A1 (en) * 2012-07-31 2014-02-06 Futurewei Technologies, Inc. Priority Driven Channel Allocation for Packet Transferring

Patent Citations (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5500672A (en) * 1993-03-08 1996-03-19 Matsushita Electric Industrial Co., Ltd. Multi-media communication apparatus for transmitting audio information, video information and character information simultaneously
US5812528A (en) * 1995-11-17 1998-09-22 Telecommunications Techniques Corporation Measuring round trip time in ATM network virtual connections
US6005851A (en) * 1997-10-10 1999-12-21 Nortel Networks Corporation Adaptive channel control for data service delivery
US20020051456A1 (en) * 1999-06-08 2002-05-02 Nokia Corporation Selection of a virtual path or channel in a communications network
US20010049289A1 (en) * 2000-05-31 2001-12-06 Samsung Electronics Co., Ltd. Method of transmitting and receiving graphic short message service messages in a portable radio terminal
US7283468B1 (en) * 2002-03-15 2007-10-16 Packeteer, Inc. Method and system for controlling network traffic within the same connection with different packet tags by varying the policies applied to a connection
US20040120336A1 (en) * 2002-12-24 2004-06-24 Ariel Hendel Method and apparatus for starvation-free scheduling of communications
US20100095025A1 (en) * 2003-09-18 2010-04-15 Brocade Communications Systems, Inc. Virtual channel remapping
US20070092225A1 (en) * 2005-10-25 2007-04-26 Keita Inakura Moving picture recording apparatus
US20070198700A1 (en) * 2005-11-30 2007-08-23 Oracle International Corporation Database system configured for automatic failover with user-limited data loss
US20080259833A1 (en) * 2007-04-23 2008-10-23 Qualcomm Incorporated Method and apparatus for controlling data transmission in a wireless communication system
US20090002233A1 (en) * 2007-06-27 2009-01-01 Kung-Shuan Huang Methods and apparatuses for searching for satellite signals
US20090103501A1 (en) * 2007-10-22 2009-04-23 Farrag Osama I Decentralized Media Access Control for Ad-Hoc Mobile Wireless Network
US20100332676A1 (en) * 2009-06-30 2010-12-30 Sugumar Rabin A Software Aware Throttle Based Flow Control
US20110106778A1 (en) * 2009-11-05 2011-05-05 Oracle International Corporation Lock manager on disk
US20110185068A1 (en) * 2010-01-22 2011-07-28 Microsoft Corporation Multi-link remote protocol
US20110276699A1 (en) * 2010-05-09 2011-11-10 Pedersen Bradley J Systems and methods for allocation of classes of service to network connections corresponding to virtual channels
US20110310739A1 (en) * 2010-06-22 2011-12-22 Gunes Aybay Methods and apparatus for virtual channel flow control associated with a switch fabric
US20120197990A1 (en) * 2010-10-29 2012-08-02 International Business Machines Corporation Publish-subscribe messaging
US20140036930A1 (en) * 2012-07-31 2014-02-06 Futurewei Technologies, Inc. Priority Driven Channel Allocation for Packet Transferring

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20240012771A1 (en) * 2020-11-05 2024-01-11 Google Llc Memory-Request Priority Up-Leveling

Also Published As

Publication number Publication date
US20190199639A1 (en) 2019-06-27
US20150089008A1 (en) 2015-03-26
US20200169508A9 (en) 2020-05-28
US10742560B2 (en) 2020-08-11

Similar Documents

Publication Publication Date Title
US10742560B2 (en) Intelligent network resource manager
US11580041B2 (en) Enabling use of non-volatile media—express (NVME) over a network
US10896086B2 (en) Maximizing use of storage in a data replication environment
US9965441B2 (en) Adaptive coalescing of remote direct memory access acknowledgements based on I/O characteristics
US8537828B2 (en) Scalable interface for connecting multiple computer systems which performs parallel MPI header matching
US9069633B2 (en) Proxy queue pair for offloading
US7362702B2 (en) Router with routing processors and methods for virtualization
JP3783017B2 (en) End node classification using local identifiers
US7593948B2 (en) Control of service workload management
US20200241982A1 (en) System, and control method and program for input/output requests for storage systems
US20030061296A1 (en) Memory semantic storage I/O
US20150149870A1 (en) Method and apparatus for low delay access to key-value based storage systems using fec techniques
US20060036648A1 (en) Online initial mirror synchronization and mirror synchronization verification in storage area networks
US20060010299A1 (en) Systems and methods to avoid deadlock and guarantee mirror consistency during online mirror synchronization and verification
JP2004531001A (en) Data transfer between host computer system and Ethernet adapter
US20060080416A1 (en) Virtual logical unit state maintenance rules engine
TW583543B (en) Infiniband work and completion queue management via head only circular buffers
CN115639947A (en) Data writing method, data reading method, device, equipment, system and medium
JP2023539212A (en) Storage level load balancing
US11321135B2 (en) Rate limiting compliance assessments with multi-layer fair share scheduling
US20030046474A1 (en) Mixed semantic storage I/O
US7383312B2 (en) Application and verb resource management
US11762718B2 (en) Automatically optimized credit pool mechanism based on number of virtual channels and round trip path delay
US20090271802A1 (en) Application and verb resource management
US20210036926A1 (en) Verification of software-defined networking (sdn) policies for specific topologies

Legal Events

Date Code Title Description
AS Assignment

Owner name: ORACLE INTERNATIONAL CORPORATION, CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SRIDHARAN, VIJAY;SHI, JIA;UMAMAGESWARAN, KOTHANDA;AND OTHERS;SIGNING DATES FROM 20140825 TO 20140829;REEL/FRAME:033756/0031

STCF Information on status: patent grant

Free format text: PATENTED CASE

CC Certificate of correction
MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 4TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1551); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Year of fee payment: 4