会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明申请
    • APPLICATION AND VERB RESOURCE MANAGEMENT
    • US20090271802A1
    • 2009-10-29
    • US12110323
    • 2008-04-27
    • Giora BiranZorik MachulskyVadim MakhervaksLeah Shalev
    • Giora BiranZorik MachulskyVadim MakhervaksLeah Shalev
    • G06F9/44
    • G06F9/544G06F2209/5013
    • A computer program product is provided. The product including a computer readable storage medium including computer readable program code for controlling access to computer memory. the computer readable program code including first instructions for communicating work queue elements with an application layer and with a verb layer, wherein the application layer and the verb layer each may request a completion notification to determine whether a work queue elements with an application layer and with a verb layer, wherein the application layer and the verb layer each may request a completion notification to determine whether a work queue element has been completed, and second instructions for indicating completion of the work queue elemens in response to the layer requesting completion notification, wherein both the application layer and the verb layer are capable of checking if at least one of the work queue elements is completed, independently of each other, such that the application layer does not interface with the verb layer to determine completion status of the work queue elements; wherein communicating work queue elements includes communicating a consumer work request comprising an application request bit, adapted to indicate an application request for completion notification, and a verb request bit, adapted to indicate a verb request for completion notification; wherein if the application request bit is set, then a completion queue element is provided that indicates completion of the communicated consumer work request and if the verb request bit is set, then a status field of the communicated work queue element is updated to indicate completion of the communicated work queue element; wherein the application layer queries the completion queue element to find out if the communicated consumer work request is completed and the verb layer queries the status field of the communicated work queue element to find out if the communicated work queue element is completed, and wherein the work queue elements are stored in a work queue and the completion queue elements are stored in a completion queue such that the work queue and the completion queue elements are located in different address spaces, each independently accessible to the application layer and the verb layer.
    • 5. 发明申请
    • SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR EVELUATING A STORAGE POLICY
    • 用于获取存储政策的系统,方法和计算机程序产品
    • US20080313109A1
    • 2008-12-18
    • US11762092
    • 2007-06-13
    • Zorik MachulskyElad Yom-TovAviad Zlotnick
    • Zorik MachulskyElad Yom-TovAviad Zlotnick
    • G06F9/455G06F15/18
    • G06F3/0604G06F3/0653G06F3/0659G06F3/0671G06N99/005
    • A method for generating a storage policy, the method includes: receiving a storage system target function; and generating, by a machine learning entity, the storage policy in response to: (a) a set of file-related storage operation requests, (b) a state of the storage system before responding to the set of file-related storage operation requests, and (c) the storage system target function. A method for evaluating a storage policy, the method includes: simulating an application of the storage policy by the storage system during a first period, in response to a set of file-related storage operation requests that was provided to the storage system during the first period, to provide a simulation result; wherein the first period starts before the simulating.
    • 一种用于生成存储策略的方法,所述方法包括:接收存储系统目标函数; 以及响应于以下各项,由机器学习实体生成所述存储策略:(a)一组与文件相关的存储操作请求,(b)所述存储系统在响应所述一组文件相关存储操作请求之前的状态 ,(c)存储系统目标功能。 一种用于评估存储策略的方法,所述方法包括:响应于在所述第一时间段期间提供给所述存储系统的与文件相关的存储操作请求的集合,在第一时段期间模拟所述存储系统的存储策略的应用 期间,提供模拟结果; 其中第一周期在模拟之前开始。
    • 6. 发明申请
    • DATA TRANSFER ERROR CHECKING
    • 数据传输错误检查
    • US20070288828A1
    • 2007-12-13
    • US11843938
    • 2007-08-23
    • Giora BiranZorik MachulskyVadim Makhervaks
    • Giora BiranZorik MachulskyVadim Makhervaks
    • H03M13/09
    • H03M13/00
    • An RNIC implementation that performs direct data placement to memory where all segments of a particular connection are aligned, or moves data through reassembly buffers where all segments of a particular connection are non-aligned. The type of connection that cuts-through without accessing the reassembly buffers is referred to as a “Fast” connection because it is highly likely to be aligned, while the other type is referred to as a “Slow” connection. When a consumer establishes a connection, it specifies a connection type. The connection type can change from Fast to Slow and back. The invention reduces memory bandwidth, latency, error recovery using TCP retransmit and provides for a “graceful recovery” from an empty receive queue. The implementation also may conduct CRC validation for a majority of inbound DDP segments in the Fast connection before sending a TCP acknowledgement (Ack) confirming segment reception.
    • 执行直接数据放置到特定连接的所有段对齐的存储器的RNIC实现,或者通过重组缓冲区移动数据,其中特定连接的所有段都不对齐。 在不访问重组缓冲区的情况下,直接连接的类型被称为“快速”连接,因为它很可能被对齐,而另一种类型被称为“慢速”连接。 当消费者建立连接时,它指定一个连接类型。 连接类型可以从快速变慢到慢。 本发明减少了内存带宽,延迟,使用TCP重传的错误恢复,并提供了从空接收队列的“优雅恢复”。 在确认段接收之前,实现还可以在Fast连接中的大部分入站DDP段进行CRC校验。
    • 7. 发明授权
    • Increasing TCP re-transmission process speed
    • 增加TCP重传过程速度
    • US07177941B2
    • 2007-02-13
    • US10733630
    • 2003-12-11
    • Giora BiranZorik MachulskyVadim MakhervaksLeah Shalev
    • Giora BiranZorik MachulskyVadim MakhervaksLeah Shalev
    • G06F15/16G06F15/173G01R31/08
    • H04L69/16H04L69/163
    • An RNIC implementation that performs direct data placement to memory where all segments of a particular connection are aligned, or moves data through reassembly buffers where all segments of a particular connection are non-aligned. The type of connection that cuts-through without accessing the reassembly buffers is referred to as a “Fast” connection because it is highly likely to be aligned, while the other type is referred to as a “Slow” connection. When a consumer establishes a connection, it specifies a connection type. The connection type can change from Fast to Slow and back. The invention reduces memory bandwidth, latency, error recovery using TCP retransmit and provides for a “graceful recovery” from an empty receive queue. The implementation also may conduct CRC validation for a majority of inbound DDP segments in the Fast connection before sending a TCP acknowledgement (Ack) confirming segment reception.
    • 执行直接数据放置到特定连接的所有段对齐的存储器的RNIC实现,或者通过重组缓冲区移动数据,其中特定连接的所有段都不对齐。 在不访问重组缓冲区的情况下,直接连接的类型被称为“快速”连接,因为它很可能被对齐,而另一种类型被称为“慢速”连接。 当消费者建立连接时,它指定一个连接类型。 连接类型可以从快速变慢到慢。 本发明减少了内存带宽,延迟,使用TCP重传的错误恢复,并提供了从空接收队列的“优雅恢复”。 在确认段接收之前,实现还可以在Fast连接中的大部分入站DDP段进行CRC校验。