利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

35 条记录 (耗时 0.036 秒)

    Dataspace protection utilizing virtual private networks on a multi-node computer system
    2.
    发明授权
    Dataspace protection utilizing virtual private networks on a multi-node computer system 有权
    使用多节点计算机系统上的虚拟专用网络进行数据空间保护

    公开(公告)号：US08544065B2

    公开(公告)日：2013-09-24

    申请号：US12018237

    申请日：2008-01-23

    申请人： Charles Jens Archer ,  Amanda Peters ,  Gary Ross Ricard ,  Albert Sidelnik ,  Brian Edward Smith

    发明人： Charles Jens Archer ,  Amanda Peters ,  Gary Ross Ricard ,  Albert Sidelnik ,  Brian Edward Smith

    IPC分类号： H04L29/06

    CPC分类号： G06F21/79 ,  G06F12/1416 ,  G06F21/6281

    摘要： A method and apparatus provide data security on a parallel computer system using virtual private networks. An access setup mechanism sets up access control data in the nodes that describes which virtual networks are protected and what applications have access to the protected private networks. When an application accesses data on a protected virtual network, a network access mechanism determines the data is protected and intercepts the data access. The network access mechanism in the kernel may also execute a rule depending on the kind of access that was attempted to the virtual network. Authorized access to the private networks can be made via a system call to the access control mechanism in the kernel. The access control mechanism enforces policy decisions on which data can be distributed through the system via an access control list or other security policies.

    摘要翻译： 一种方法和装置使用虚拟专用网络在并行计算机系统上提供数据安全性。 访问设置机制在节点中建立访问控制数据，描述哪些虚拟网络受到保护，哪些应用程序可以访问受保护的专用网络。 当应用程序访问受保护的虚拟网络上的数据时，网络访问机制确定数据被保护并拦截数据访问。 内核中的网络访问机制也可以根据尝试到虚拟网络的访问类型来执行规则。 可以通过对内核中的访问控制机制的系统调用来授权对专用网络的访问。 访问控制机制执行关于哪些数据可以经由访问控制列表或其他安全策略通过系统分发的策略决定。

    DATASPACE PROTECTION UTILIZING VIRTUAL PRIVATE NETWORKS ON A MULTI-NODE COMPUTER SYSTEM
    6.
    发明申请
    DATASPACE PROTECTION UTILIZING VIRTUAL PRIVATE NETWORKS ON A MULTI-NODE COMPUTER SYSTEM 有权
    在多节点计算机系统上使用虚拟私有网络的数据保护

    公开(公告)号：US20090187984A1

    公开(公告)日：2009-07-23

    申请号：US12018237

    申请日：2008-01-23

    申请人： Charles Jens Archer ,  Amanda Peters ,  Gary Ross Ricard ,  Albert Sidelnik ,  Brian Edward Smith

    发明人： Charles Jens Archer ,  Amanda Peters ,  Gary Ross Ricard ,  Albert Sidelnik ,  Brian Edward Smith

    IPC分类号： G06F21/20

    CPC分类号： G06F21/79 ,  G06F12/1416 ,  G06F21/6281

    摘要： A method and apparatus provide data security on a parallel computer system using virtual private networks. An access setup mechanism sets up access control data in the nodes that describes which virtual networks are protected and what applications have access to the protected private networks. When an application accesses data on a protected virtual network, a network access mechanism determines the data is protected and intercepts the data access. The network access mechanism in the kernel may also execute a rule depending on the kind of access that was attempted to the virtual network. Authorized access to the private networks can be made via a system call to the access control mechanism in the kernel. The access control mechanism enforces policy decisions on which data can be distributed through the system via an access control list or other security policies.

    摘要翻译： 一种方法和装置使用虚拟专用网络在并行计算机系统上提供数据安全性。 访问设置机制在节点中建立访问控制数据，描述哪些虚拟网络受到保护，哪些应用程序可以访问受保护的专用网络。 当应用程序访问受保护的虚拟网络上的数据时，网络访问机制确定数据被保护并拦截数据访问。 内核中的网络访问机制也可以根据尝试到虚拟网络的访问类型来执行规则。 可以通过对内核中的访问控制机制的系统调用来授权对专用网络的访问。 访问控制机制执行关于哪些数据可以经由访问控制列表或其他安全策略通过系统分发的策略决定。

    Partition Transparent Memory Error Handling in a Logically Partitioned Computer System With Mirrored Memory
    7.
    发明申请
    Partition Transparent Memory Error Handling in a Logically Partitioned Computer System With Mirrored Memory 有权
    在具有镜像内存的逻辑分区计算机系统中分区透明内存错误处理

    公开(公告)号：US20090282300A1

    公开(公告)日：2009-11-12

    申请号：US12115625

    申请日：2008-05-06

    申请人： Peter Joseph Heyrman ,  Naresh Nayar ,  Gary Ross Ricard

    发明人： Peter Joseph Heyrman ,  Naresh Nayar ,  Gary Ross Ricard

    IPC分类号： G06F11/07

    CPC分类号： G06F11/2082 ,  G06F11/2094

    摘要： A method and apparatus for transparently handling recurring correctable errors and uncorrectable errors in a mirrored memory system prevents costly system shutdowns for correctable memory errors or system failures from uncorrectable memory errors. When a high number of correctable errors are detected for a given memory location, a memory relocation mechanism in the hypervisor moves the data associated with the memory location to an alternate physical memory location transparently to the partition such that the partition has no knowledge that the physical memory actualizing the memory location has been changed. When a correctable error occurs, the memory relocation mechanism uses data from a partner mirrored memory block as a data source for the memory block with the uncorrectable error and then relocates the data to a newly allocated memory block to replace the memory block with the uncorrectable error.

    摘要翻译： 用于透明地处理镜像存储器系统中的可重复校正错误和不可校正错误的方法和装置防止由于不可校正的存储器错误而导致的可校正存储器错误或系统故障的昂贵的系统关闭。 当对于给定的存储器位置检测到大量的可校正错误时，管理程序中的存储器重定位机制将与存储器位置相关联的数据透明地移动到备用物理存储器位置到分区，使得分区不知道物理 内存实现内存位置已更改。 当发生可纠正错误时，内存重定位机制使用来自伙伴镜像内存块的数据作为具有不可校正错误的存储器块的数据源，然后将数据重新定位到新分配的存储器块以用不可校正的错误来替换存储器块 。

    Method and Apparatus for Reducing Contention for Computer System Resources Using Soft Locks
    8.
    发明申请
    Method and Apparatus for Reducing Contention for Computer System Resources Using Soft Locks 失效
    使用软锁减少计算机系统资源争用的方法和装置

    公开(公告)号：US20080172670A1

    公开(公告)日：2008-07-17

    申请号：US11622021

    申请日：2007-01-11

    申请人： Michael J. Corrigan ,  Gary Ross Ricard ,  Timothy Joseph Torzewski

    发明人： Michael J. Corrigan ,  Gary Ross Ricard ,  Timothy Joseph Torzewski

    IPC分类号： G06F9/46

    CPC分类号： G06F9/526

    摘要： A soft lock mechanism controls access by multiple processes to a shared resource to make simultaneous access an unlikely event, while not necessarily preventing simultaneous access. Preferably, the soft lock contains a next_free_time field, specifying when the soft lock will next be available, and a lock_duration, specifying a sufficiently long interval for most accesses to the resource to complete. The lock is obtained by comparing the current time to next_free_time. If the current time is later than next_free_time, then the lock is obtained immediately, and next_free_time is updated to the current time plus lock_duration. If the current time is before next_free_time, then next_free_time is incremented by lock_duration, and the requesting process waits until the old next_free_time to obtain the lock. No action is required to release the lock.

    摘要翻译： 软锁定机制控制多个进程对共享资源的访问，以同时访问不太可能的事件，而不一定阻止同时访问。 优选地，软锁包含next_free_time字段，指定软锁将何时可用，以及lock_duration，指定大部分访问资源以完成的足够长的间隔。 通过将当前时间与next_free_time进行比较来获得锁定。 如果当前时间晚于next_free_time，则立即获取锁定，并将next_free_time更新为当前时间加上lock_duration。 如果当前时间在next_free_time之前，则next_free_time将被加上lock_duration，并且请求进程等待到旧的next_free_time来获取锁。 不需要采取任何行动来释放锁。

    Method and computer program product for implementing highly concurrent record insertion in an ordinal number dependent database
    9.
    发明授权
    Method and computer program product for implementing highly concurrent record insertion in an ordinal number dependent database 失效
    方法和计算机程序产品，用于在序数依赖数据库中实现高度并发记录插入

    公开(公告)号：US06223176B1

    公开(公告)日：2001-04-24

    申请号：US09160817

    申请日：1998-09-25

    申请人： Gary Ross Ricard ,  Richard Miles Rocheleau ,  Wayne Christopher Sadecki

    发明人： Gary Ross Ricard ,  Richard Miles Rocheleau ,  Wayne Christopher Sadecki

    IPC分类号： G06F1730

    CPC分类号： G06F17/30348 ,  Y10S707/99938 ,  Y10S707/99953

    摘要： A method and computer program product are provided for implementing highly concurrent record insertion in an ordinal number dependent database. Serialized processing is provided with one concurrent task of multiple concurrent tasks allowed to execute, for allocation of ordinal numbers for record insertion. Concurrent validation processing operations of multiple concurrent tasks are enabled for record insertion in the ordinal number dependent database. A set of counter variables are maintained with the database to enable removal of serialization from the validation phase processing operations for record insertion in the ordinal number dependent database.

    摘要翻译： 提供了一种方法和计算机程序产品，用于在序数依赖数据库中实现高并发记录插入。 提供序列化处理，允许执行多个并发任务的并发任务，用于分配用于记录插入的序数。 启用多个并发任务的并发验证处理操作，以便在序数依赖数据库中进行记录插入。 与数据库一起维护一组计数器变量，以便从验证阶段处理操作中删除序列化，以便在序数依赖数据库中进行记录插入。

    Method and apparatus for reducing contention for computer system resources using soft locks
    10.
    发明授权
    Method and apparatus for reducing contention for computer system resources using soft locks 失效
    使用软锁减少计算机系统资源争用的方法和装置

    公开(公告)号：US08141089B2

    公开(公告)日：2012-03-20

    申请号：US11622021

    申请日：2007-01-11

    申请人： Michael J. Corrigan ,  Gary Ross Ricard ,  Timothy Joseph Torzewski

    发明人： Michael J. Corrigan ,  Gary Ross Ricard ,  Timothy Joseph Torzewski

    IPC分类号： G06F9/46

    CPC分类号： G06F9/526

    摘要： A soft lock mechanism controls access by multiple processes to a shared resource to make simultaneous access an unlikely event, while not necessarily preventing simultaneous access. Preferably, the soft lock contains a next_free_time field, specifying when the soft lock will next be available, and a lock_duration, specifying a sufficiently long interval for most accesses to the resource to complete. The lock is obtained by comparing the current time to next_free_time. If the current time is later than next_free_time, then the lock is obtained immediately, and next_free_time is updated to the current time plus lock_duration. If the current time is before next_free_time, then next_free_time is incremented by lock_duration, and the requesting process waits until the old next_free_time to obtain the lock. No action is required to release the lock.

    摘要翻译： 软锁定机制控制多个进程对共享资源的访问，以同时访问不太可能的事件，而不一定阻止同时访问。 优选地，软锁包含next_free_time字段，指定软锁将何时可用，以及lock_duration，指定大部分访问资源以完成的足够长的间隔。 通过将当前时间与next_free_time进行比较来获得锁定。 如果当前时间晚于next_free_time，则立即获取锁定，并将next_free_time更新为当前时间加上lock_duration。 如果当前时间在next_free_time之前，则next_free_time将被加上lock_duration，并且请求进程等待到旧的next_free_time来获取锁。 不需要采取任何行动来释放锁。