会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • INTELLIGENT INCLUSION/EXCLUSION AUTOMATION
    • 智能包容/排除自动化
    • US20130174167A1
    • 2013-07-04
    • US13342685
    • 2012-01-03
    • Bard A. DOSTERDustin A. HELAKDavid C. REEDMax D. SMITH
    • Bard A. DOSTERDustin A. HELAKDavid C. REEDMax D. SMITH
    • G06F9/46
    • G06F9/4881G06F9/455G06F9/52G06Q10/06
    • Computer systems and computer program products for automating tasks in a computing environment are provided. In one such embodiment, by way of example only, if an instant task is not found in one of list of included tasks and a list of excluded tasks, at least one of the following is performed: the instant task is compared the with previous instances of the task, if any; the instant task is analyzed, including an input/output (I/O) sequence for the instant task, to determine if the instant task is similar to an existing task; and the instant task is considered as a possible candidate for automation. If the instant task is determined to be an automation candidate, the instant task is added to the list of included tasks, otherwise the instant task is added to the list of excluded tasks.
    • 提供了用于在计算环境中自动执行任务的计算机系统和计算机程序产品。 在一个这样的实施例中,仅作为示例,如果在所包括的任务的列表和排除的任务的列表中的一个中没有找到即时任务,则执行以下中的至少一个:将即时任务与先前的实例进行比较 的任务; 分析即时任务,包括即时任务的输入/输出(I / O)序列,以确定即时任务是否类似于现有任务; 并且即时任务被认为是自动化的可能候选者。 如果即时任务被确定为自动化候选者,则即时任务被添加到所包括的任务的列表中,否则即时任务被添加到排除的任务的列表中。
    • 2. 发明申请
    • MULTI-SYSTEM DEADLOCK REDUCTION
    • 多系统减速
    • US20110167158A1
    • 2011-07-07
    • US12683747
    • 2010-01-07
    • Douglas L. LEHRFranklin E. McCUNEDavid C. REEDMax D. SMITH
    • Douglas L. LEHRFranklin E. McCUNEDavid C. REEDMax D. SMITH
    • G06F15/173
    • G06F9/524
    • Method, system, and computer program embodiments for reducing deadlock in multi-system computing environments are provided. A set of default, current wait times is initialized for resource requests of each of a plurality of resources. A plurality of resource holders and resource waiters is monitored within an address space. If one resource holder of the plurality of resource holders of one of the plurality of resources is determined to be one resource waiter on another of the plurality of resources, a current wait time for the one resource holder is incremented and a deadlock indicator for both the one resource holder and the one resource waiter is activated. Following expiration of a predefined interval, the plurality of resource holders and resource waiters are parsed through to determine an original resource holder, indicating a system deadlock. The resource holder associated with the system deadlock having a lowest current wait time is restarted.
    • 提供了用于减少多系统计算环境中的死锁的方法,系统和计算机程序实施例。 针对多个资源中的每一个的资源请求初始化一组默认的当前等待时间。 在地址空间内监视多个资源持有者和资源服务器。 如果多个资源中的一个资源的多个资源保持器中的一个资源持有者被确定为多个资源中的另一资源的一个资源服务器,则一个资源持有者的当前等待时间增加,并且两个 一个资源持有者和一个资源服务员被激活。 在预定义间隔期满之后,解析多个资源持有者和资源服务器以确定原始资源持有者,指示系统死锁。 重新启动与具有最低当前等待时间的系统死锁相关联的资源持有者。
    • 9. 发明申请
    • VSAM SMART REORGANIZATION
    • VSAM智能重组
    • US20100287354A1
    • 2010-11-11
    • US12435576
    • 2009-05-05
    • Douglas L. LEHRFranklin E. McCUNEDavid C. REEDMax D. SMITH
    • Douglas L. LEHRFranklin E. McCUNEDavid C. REEDMax D. SMITH
    • G06F12/02G06F17/30G06F12/00G06F9/455
    • G06F3/0653G06F3/0608G06F3/067
    • Various embodiments for adaptive reorganization of a virtual storage access method (VSAM) data set are provided. In one exemplary embodiment, upon each control interval (CI) split of a plurality of CI splits occurring over a period of time, historical data including a key value for a record causing each CI split is recorded in a data repository. The historical data is analyzed with a predictive algorithm to determine an amount of free space to be allocated to each of a plurality of control intervals generated pursuant to the adaptive reorganization. The predictive algorithm allocates a greater percentage of the free space to a first location of the VVDS having a larger proportion of historically placed key values than a second location of the VVDS having a smaller proportion of the historically placed key values.
    • 提供了用于虚拟存储访问方法(VSAM)数据集的自适应重组的各种实施例。 在一个示例性实施例中,在一段时间内发生的多个CI分割的每个控制间隔(CI)分割之后,将包括导致每个CI分割的记录的键值的历史数据记录在数据存储库中。 用预测算法分析历史数据,以确定要分配给根据自适应重组生成的多个控制间隔中的每一个的可用空间量。 预测算法将较大百分比的可用空间分配给具有历史上放置的键值的比例大于具有较小比例的历史放置的键值的VVDS的第二位置的VVDS的第一位置。