会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method, system and storage medium for lockless InfiniBand™ poll for I/O completion
    • 用于I / O完成无锁InfiniBand(TM)轮询的方法,系统和存储介质
    • US07529886B2
    • 2009-05-05
    • US10980036
    • 2004-11-03
    • David B. EmmesDonald W. Schmidt
    • David B. EmmesDonald W. Schmidt
    • G06F12/00G06F13/00G06F13/28
    • G06F13/4022
    • A method, system, and storage medium for the InfiniBand™ Poll verb to support a multi-threaded environment without the use of kernel services to provide serialization for mainline Poll logic. Poll is the verb, which allows a consumer to determine which of its work requests have completed, and provides ending status. In addition to multiple concurrent threads using Poll against a single Completion Queue, Poll is serialized with Destroy Queue Pair and Destroy Completion Queue. Completion Queues are used to maintain completion status for work requests. Queue Pairs are used to submit work requests and are related to a Completion Queue at the time they are created.
    • InfiniBand(TM)Poll动词的方法,系统和存储介质支持多线程环境,而不使用内核服务来提供主线Poll逻辑的序列化。 Poll是动词,它允许消费者确定其工作请求已经完成,并提供结束状态。 除了使用针对单个完成队列的轮询的多个并发线程之外,Poll还使用Destroy Queue Pair和Destroy Completion Queue进行序列化。 完成队列用于维护工作请求的完成状态。 队列对用于提交工作请求,并在完成队列创建时与完成队列相关。
    • 2. 发明授权
    • Method and apparatus for selectively using input/output buffers as a retransmit vehicle in an information handling system
    • 用于在信息处理系统中选择性地使用输入/输出缓冲器作为重传车辆的方法和装置
    • US06338090B1
    • 2002-01-08
    • US09049436
    • 1998-03-27
    • David B. EmmesDonald W. Schmidt
    • David B. EmmesDonald W. Schmidt
    • G06F1516
    • H04L47/10H04L47/17H04L47/283H04L47/29
    • A method and apparatus for selectively using input/output (I/O) buffers as a retransmit vehicle in a client/server system. The decision whether to use an I/O buffer as a retransmit vehicle is based on a number of factors, including the packet size, the expected round-trip time (RTT) for an acknowledgment of the transmission, the number of I/O buffers currently allocated, and the number of I/O buffers remaining. If the decision is made not to use the I/O buffer as a retransmit vehicle, then the data is copied into a send buffer that is maintained by the system for the particular requester. Initially three threshold values, the round-trip time (RTT) threshold, the critical threshold, and the tight buffer threshold, are set. Connections having a longer round-trip time than a set round-trip time threshold or connections made when the number of I/O buffers remaining is below the critical threshold are not allowed to keep the I/O buffer as a retransmission vehicle. If the number of I/O buffers remaining falls below the critical threshold, a critical stabilization interval is started. During a critical stabilization interval, the I/O buffers may not be used as a retransmit vehicle if the number of I/O buffers already allocated exceeds the tight buffer threshold, even if the number of I/O buffers remaining is above the critical threshold. For each I/O buffer, a use count is maintained of the number of packets in the buffer awaiting acknowledgment. The use count is decremented each time an acknowledgment is received for one of the packets in the I/O buffer. When the use count has been decremented to zero, the I/O buffer is freed.
    • 一种用于在客户/服务器系统中选择性地使用输入/输出(I / O)缓冲器作为重传车辆的方法和装置。 是否使用I / O缓冲区作为重传车辆的决定是基于多个因素,包括分组大小,用于传输确认的预期往返时间(RTT),I / O缓冲器的数量 目前已分配,剩余的I / O缓冲区数。 如果决定不将I / O缓冲区用作重传车辆,则将数据复制到由系统为特定请求者维护的发送缓冲器中。 最初设置三个阈值,即往返时间(RTT)阈值,临界阈值和紧缓冲器阈值。 具有比设定的往返时间阈值更长的往返时间的连接或当剩余的I / O缓冲器的数量低于临界阈值时进行的连接不允许将I / O缓冲器保持为重传车辆。 如果剩余的I / O缓冲器数量低于临界阈值,则开始临界稳定间隔。 如果已经分配的I / O缓冲区的数量超过严格的缓冲区阈值,即使剩余的I / O缓冲区的数量高于临界阈值,在临界稳定时间间隔期间,I / O缓冲区也可能不被用作重传车辆 。 对于每个I / O缓冲区,维持缓冲区中等待确认的数据包数量的使用计数。 每当接收到I / O缓冲区中的一个数据包的确认时,使用计数递减。 当使用次数减少到零时,I / O缓冲区被释放。
    • 3. 发明授权
    • Method and apparatus for adaptively blocking outgoing communication
requests and adjusting the blocking factor according to the volume of
requests being received in an information handling system
    • 用于根据在信息处理系统中接收的请求的量自适应地阻止传出通信请求并调整阻塞因子的方法和装置
    • US6098122A
    • 2000-08-01
    • US49513
    • 1998-03-27
    • David B. EmmesDonald W. Schmidt
    • David B. EmmesDonald W. Schmidt
    • G06F13/00G06F13/14
    • G06F13/382G06F2213/3808
    • A method and apparatus for handling outgoing communication requests in an information handling system in which outgoing communication packets are accumulated into a block that is written to an input/output (I/O) device. For each I/O device there is generated a blocking factor representing a predetermined number of packets that are accumulated before the block is written to the I/O device, as well as a push interval representing a maximum period of time for which any packet in the block can be stalled. Upon the arrival of a new outgoing packet, the packet is added to the block, and the block is written to the I/O device if either the block now contains the predetermined packets or any packet in the packet has been waiting for more than the push interval. A timer running asynchronously with the arrival of outgoing requests periodically pops to write the block to the I/O device if it has been waiting overlong, even if no new requests have arrived. Both the blocking factor and the push interval are periodically adjusted in accordance with the actual throughput so that the blocking factor corresponds to the exact level of consistent parallelism for a given workload.
    • 一种在信息处理系统中处理传出通信请求的方法和装置,其中输出通信分组被累积到被写入输入/输出(I / O)设备的块中。 对于每个I / O设备,产生表示在块被写入I / O设备之前累积的预定数量的分组的阻塞因子,以及表示最大时间段的推送间隔, 块可以停止。 在新的传出分组到达时,该分组被添加到该块,并且该块被写入I / O设备,如果块现在包含预定分组,或者该分组中的任何分组已经等待超过 推送间隔。 即使没有新的请求到达,定时器也会异步运行与定时器的到来异步运行的定时器,将该块写入I / O设备(如果它已经等待超时)。 根据实际吞吐量周期性地调整阻塞因子和推送间隔,使得阻塞因子对应于给定工作负载的一致并行性的确切水平。
    • 6. 发明授权
    • Method and apparatus for maintaining order in a queue by combining entry weights and queue weights
    • 通过组合入口权重和队列权重来维持队列中的秩序的方法和装置
    • US06807588B2
    • 2004-10-19
    • US10085576
    • 2002-02-27
    • Tri M. HoangTracy D. ButlerDanny R. SutherlandDavid B. EmmesMariama NdoyeElpida Tzortzatos
    • Tri M. HoangTracy D. ButlerDanny R. SutherlandDavid B. EmmesMariama NdoyeElpida Tzortzatos
    • G06F1318
    • G06F12/123G06F12/109G06F12/128
    • A sectioned ordered queue in an information handling system comprises a plurality of queue sections arranged in order from a first queue section to a last queue section. Each queue section contains one or more queue entries that correspond to available ranges of real storage locations and are arranged in order from a first queue entry to a last queue entry. Each queue section and each queue entry in the queue sections having a weight factor defined for it. Each queue entry has an effective weight factor formed by combining the weight factor defined for the queue section with the weight factor defined for the queue entry. A new entry is added to the last queue section to indicate a newly available corresponding storage location, and one or more queue entries are deleted from the first section of the queue to indicate that the corresponding storage locations are no longer available. Various processes associated with a real storage manager are responsible for keeping the queue sections in balance, updating the queue sections, and removing entries from the queue to “steal” real storage frames.
    • 信息处理系统中的分段排序队列包括从第一队列部分到最后队列部分的顺序排列的多个队列部分。 每个队列部分包含对应于实际存储位置的可用范围的一个或多个队列条目,并且从第一队列条目到最后队列条目的顺序排列。 队列部分中的每个队列部分和每个队列条目具有为其定义的权重因子。 每个队列条目具有通过将为队列部分定义的权重因子与为队列条目定义的权重因子组合而形成的有效权重因子。 将新条目添加到最后一个队列部分以指示新可用的对应存储位置,并且从队列的第一部分中删除一个或多个队列条目,以指示对应的存储位置不再可用。 与真实存储管理器相关联的各种进程负责保持队列部分平衡,更新队列部分,以及从队列中删除条目以“窃取”真实存储帧。
    • 7. 发明授权
    • System of assigning work requests based on classifying into an eligible
class where the criteria is goal oriented and capacity information is
available
    • 将工作请求分配到基于目标导向的标准符合条件的类中,并提供容量信息的系统
    • US5603029A
    • 1997-02-11
    • US476157
    • 1995-06-07
    • Jeffrey D. AmanCurt L. CotnerDonna N. T. DillenbergerDavid B. Emmes
    • Jeffrey D. AmanCurt L. CotnerDonna N. T. DillenbergerDavid B. Emmes
    • G06F9/50G06F15/06
    • G06F9/505G06F9/5083G06F2209/5022
    • Apparatus and accompanying methods for use preferably in a multi-system shared data (sysplex) environment (100), wherein each system (110) provides one or more servers (115), for dynamically and adaptively assigning and balancing new work and for new session requests, among the servers in the sysplex, in view of attendant user-defined business importance of these requests and available sysplex resource capacity so as to meet overall business goals. Specifically, systems and servers are categorized into two classes: eligible, i.e., goal-oriented servers running under a policy and for which capacity information is currently available, and candidate, i.e., servers which lack capacity information. Work requests for a client application are assigned first to various eligible systems and eligible servers thereon based on their current capacity to accept new work and in a manner that meets business goals inherent in a sysplex policy; followed, if additional servers are requested by that application, to candidate systems and candidate servers thereon. As to session placement, first those system(s) are selected that have lowest utilization, at a target importance level, but with sufficient available capacity at that level. Competing servers on the selected system(s) are then evaluated based on their corresponding session count data to yield a single resulting server. Thereafter, identification of multiple servers and their corresponding weights are returned to, e.g., a client application, for eventual routing of work requests to those servers, or the identification of a single server is returned to that application for establishing a new session therewith.
    • 用于优选在多系统共享数据(系统综合)环境(100)中使用的设备和相关方法,其中每个系统(110)提供一个或多个服务器(115),用于动态地和适应性地分配和平衡新的工作和新的会话 考虑到这些请求的用户定义的业务重要性和可用的系统资源容量,以满足整体业务目标,在sysplex的服务器之中请求。 具体来说,系统和服务器分为两类:符合条件,即在策略下运行的目标导向服务器,目前可用的容量信息,以及候选者,即缺少容量信息的服务器。 基于他们目前接受新工作的能力,并以满足系统复合策略中固有的业务目标的方式,首先将针对客户端应用程序的工作请求分配给各种符合资格的系统及其合格的服务器; 接下来,如果该应用程序请求其他服务器,则在候选系统和候选服务器上。 对于会话布置,首先选择具有最低利用率的系统,在目标重要性水平,但在该级别具有足够的可用容量。 然后根据其对应的会话计数数据对所选系统上的竞争服务器进行评估,以产生单个结果服务器。 此后,将多个服务器及其对应的权重的识别返回给例如客户端应用程序,以便最终将工作请求路由到这些服务器,或者将单个服务器的标识返回到该应用以与其建立新的会话。