会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 23. 发明授权
    • Method, system, and program for allocating tasks to a plurality of processors
    • 用于将任务分配给多个处理器的方法,系统和程序
    • US07209932B2
    • 2007-04-24
    • US10108162
    • 2002-03-25
    • Douglas William Dewey
    • Douglas William Dewey
    • G06F12/00G06F9/52G06F9/44
    • G06F3/0601G06F2003/0697Y10S707/99933Y10S707/99936Y10S707/99938Y10S707/99952Y10S707/99954
    • Provided are a method, system, and program to allocate tasks among a plurality of processes within a distributed processing environment. Each process secures a list of elements and performs a first operation on an element of the list to produce a result corresponding to one of the processes. If the result corresponds to the process processing the element, the process performs a second operation on the element. Each process then processes the next element on the list until all the elements of the list are processed. After the process processes all the elements on the list it further processes each element remaining on the list and performs the second operation on the elements remaining on the list. In one implementation, the distributed processing environment is a peer-to-peer virtual storage system and each process runs on a controller controlling a plurality of storage systems.
    • 提供了一种在分布式处理环境中的多个进程之间分配任务的方法,系统和程序。 每个进程保护元素列表,并且对列表的元素执行第一操作以产生对应于其中一个进程的结果。 如果结果对应于处理该元素的处理,则该过程对该元素执行第二操作。 然后,每个进程处理列表中的下一个元素,直到处理列表的所有元素。 在进程处理列表上的所有元素之后,它进一步处理列表上剩余的每个元素,并对列表上剩余的元素执行第二个操作。 在一个实现中,分布式处理环境是对等虚拟存储系统,并且每个进程在控制多个存储系统的控制器上运行。
    • 24. 发明授权
    • Cartridge shifting optimization in a super library
    • 超级库中的墨盒移位优化
    • US5740061A
    • 1998-04-14
    • US864181
    • 1997-05-28
    • Douglas William DeweyKamal Emile DimitriBarbara Ann McNaughtonRodney Jerome MeansDaniel James Winarski
    • Douglas William DeweyKamal Emile DimitriBarbara Ann McNaughtonRodney Jerome MeansDaniel James Winarski
    • G11B15/68G11B17/22G11B27/00G11B27/10G06F17/00G06G7/48
    • G11B27/002G11B15/6835G11B17/225G11B2220/20G11B2220/41
    • A system for optimizing the position and use of cartridges of machine-readable data storage media in an automated super library. The invention is implemented in a super library that includes a main library bin with a plurality of cartridge slots, a picker, and multiple small libraries, where each small library has a small library bin with multiple slots, a picker, and at least one data drive. Mount queue times are estimated for each small library, and a main library picker is selectively operated to transfer cartridges between the small libraries based on the estimated mount queue times. This provides expedited access of the cartridges at the small libraries. The host processor maintains requests for such inter-library transfers in a main picker queue, for processing by the main picker. When each small library has a non-empty mount queue, the main picker processes small libraries' cartridge transfer requests by efficiently distributing cartridges along the small libraries. In addition to these demand-based transfer requests, the main picker regularly performs load-leveling between the small libraries and the main library bin, to ensure that the higher demand cartridges are stored in the small library bins rather than the main library bin. The invention also contemplates one or more priority slots in each small library, to store cartridges designated for high priority use.
    • 一种用于在自动化超级库中优化机器可读数据存储介质的墨盒的位置和使用的系统。 本发明在包括具有多个盒槽的主库箱,拾取器和多个小库的超库中实现,其中每个小库具有具有多个槽的小库箱,拾取器和至少一个数据 驾驶。 估计每个小型库的挂载队列时间,并且选择性地操作主库选择器以根据估计的安装队列时间在小型库之间传送墨盒。 这样可以快速访问小型图书馆的墨盒。 主处理器在主选择器队列中维护对这种库间传输的请求,以供主选择器进行处理。 当每个小型库具有非空的挂载队列时,主选择器通过沿着小型库高效地分发盒式磁盘来处理小型磁带库的传输请求。 除了这些基于需求的传输请求之外,主选择器还定期在小型库和主库之间进行负载均衡,以确保较高需求的盒式磁带存储在小型库中而不是主库中。 本发明还考虑了每个小图书馆中的一个或多个优先时隙,以存储指定用于高优先级使用的盒。
    • 28. 发明申请
    • MIRRORING DATA BETWEEN PRIMARY AND SECONDARY SITES
    • 主要和次要站点之间的数据流
    • US20070288710A1
    • 2007-12-13
    • US11423103
    • 2006-06-08
    • Kenneth Wayne BoydKenneth Fairclough DayDouglas William Dewey
    • Kenneth Wayne BoydKenneth Fairclough DayDouglas William Dewey
    • G06F12/16
    • G06F11/2082G06F11/2069G06F11/2071
    • Provided are a method, system, and article of manufacture for mirroring data between a first site and a second site. Updates to segments of storage at the first site are copied to corresponding segments of storage at the second site. Codes are generated from the segments at the second site and a valid flag is provided for at least one code indicating whether the code for the segment of data is valid. One code is generated from each segment of storage at the first site. An operation is initiated to copy segments from the second site to the first site. A determination is made for segments at the second site as to whether the valid flag for the code for the segment at the second site indicates that the code is valid in response to initiating the copy operation. The valid code for at least one segment in the second site is compared with the code for the corresponding segment at the first site to determine whether to copy the data from the segment at the second site to the first site as part of the copy operation.
    • 提供了用于在第一站点和第二站点之间镜像数据的方法,系统和制造。 第一个站点上存储段的更新将被复制到第二站点的相应存储段。 代码是从第二站点的段生成的,并且为指示数据段的代码是否有效的至少一个代码提供有效的标志。 在第一个站点的每个存储段生成一个代码。 启动操作以将第二站点的段复制到第一站点。 针对第二站点处的段的有效标志是否响应于启动复制操作而对代码有效的确定。 将第二站点中至少一个段的有效代码与第一站点处的相应段的代码进行比较,以确定是否将数据从第二站点的段复制到第一站点作为复制操作的一部分。