中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

371 records (took 0.027 seconds)

    System, method, and computer program product for reducing overhead associated with software lock monitoring
    311.
    发明申请
    System, method, and computer program product for reducing overhead associated with software lock monitoring 失效
    系统，方法和计算机程序产品，用于减少与软件锁监控相关的开销

    公开(公告)号：US20030208662A1

    公开(公告)日：2003-11-06

    申请号：US10138900

    申请日：2002-05-02

    Applicant: International Business Machines Corporation

    Inventor： Randall Ray Heisch

    IPC: G06F012/00

    CPC classification number: G06F11/3466 ,  G06F9/526 ,  G06F2201/825

    Abstract: A system, method, and computer program product are disclosed for reducing overhead associated with software lock monitoring in a multiple-processor data processing system having a memory that is shared among the multiple processors. Multiple memory locations in the shared-memory are associated with one of multiple locks. Overhead is reduced by generating a trace hook only in response to activity associated with lock misses.

    Abstract translation: 公开了一种系统，方法和计算机程序产品，用于在具有在多个处理器之间共享的存储器的多处理器数据处理系统中减少与软件锁监视相关的开销。 共享内存中的多个内存位置与多个锁之一相关联。 通过仅针对与锁定未命中相关的活动来生成跟踪钩来降低开销。

    Shared, distributed lock manager for loosely coupled processing systems
    313.
    发明授权
    Shared, distributed lock manager for loosely coupled processing systems 失效
    用于松散耦合处理系统的共享分布式锁管理器

    公开(公告)号：US5423044A

    公开(公告)日：1995-06-06

    申请号：US899664

    申请日：1992-06-16

    Applicant: Peter G. Sutton ,  Ian J. Kupfer ,  Glenn W. Sears, Jr. ,  Theodore Goetz ,  Robert O. Dryfoos

    Inventor： Peter G. Sutton ,  Ian J. Kupfer ,  Glenn W. Sears, Jr. ,  Theodore Goetz ,  Robert O. Dryfoos

    IPC: G06F12/00 ,  G06F9/46 ,  G06F13/36 ,  G11C29/00 ,  G06F13/16 ,  G06F12/16 ,  G06F13/364

    CPC classification number: G06F9/52 ,  G06F13/36 ,  G11C29/88 ,  G06F2201/825

    Abstract: Apparatus and process for managing shared, distributed locks in a multiprocessing complex. The manager operates using a partitionable lock space with logical processor connection. Logically connected processors are subject to validation and disconnection due to failure. The locks synchronize data access to identifiable subunits of DASD. Denied lock requests are queued for servicing when the lock becomes available. Lock partitions are used to speed DASD to DASD copying without halting processing on the first DASD. A special partition is assigned to the copy task and the processors writing to the DASD can determine copy status with a single read or test. Operations requiring multilateral agreement of processors, such as rebuilding locks or moving locks, are protected by fencing any nonresponsive processor. A special queue partition is designated for master/slave control point designation. All processors contend for the master lock and losing contenders are queue. Queuing provides automatic fallback in case of a failing processor.

    Abstract translation: 用于在多处理复合体中管理共享的分布式锁的装置和过程。 管理员使用具有逻辑处理器连接的可分区锁定空间。 由于故障，逻辑连接的处理器将进行验证和断开连接。 锁将数据访问同步到DASD的可识别子单元。 当锁可用时，被拒绝的锁请求排队等待进行维修。 锁定分区用于将DASD加速至DASD复制，而不停止第一个DASD处理。 分配给复制任务的特殊分区，写入DASD的处理器可以通过单次读取或测试来确定复制状态。 需要处理器多边协议的操作，例如重建锁或移动锁，都可以通过防护任何无响应的处理器进行保护。 指定主/从控制点指定的特殊队列分区。 所有处理器都会争取主锁，而失败的竞争者则是队列。 排队在出现故障的处理器的情况下提供自动回退。

    Intersystem data base sharing journal merge method
    314.
    发明授权
    Intersystem data base sharing journal merge method 失效
    系统数据库共享日报法

    公开(公告)号：US5151988A

    公开(公告)日：1992-09-29

    申请号：US579110

    申请日：1990-09-06

    Applicant: Mamio Yamagishi

    Inventor： Mamio Yamagishi

    IPC: G06F12/00 ,  G06F7/22 ,  G06F11/00 ,  G06F11/14 ,  G06F11/34 ,  G06F17/30

    CPC classification number: G06F17/30362 ,  G06F11/34 ,  G06F2201/825 ,  G06F2201/87 ,  Y10S707/99938 ,  Y10S707/99939 ,  Y10S707/99953

    Abstract: A plurality of shared files (10) are accessible by each of a plurality of host processors (30a, 30b, 30c). Each host processor includes a data base access system (36) for accessing a selected record of the shared files. A journal merge key table (38) stores transaction sequence information, particularly a count of the number of transactions performed by each of the processor and the number of times each processor has been down and restarted. Each time the data base access system starts a transaction to access and modify the selected record, the lock manger communicates with the other processors through a communications unit (40). The lock communication blocks the other processors from accessing the same record and communicates more current transaction count information to the other processors. Acknowledgement signals from the other processors return the most current transaction count information therefrom. The processor undertaking the transaction creates a journal record which includes the transaction and the sequence information, particularly the count information. The journal record is stored in a journal file (50) dedicated to the processor. By comparing the count information that is stored with transaction records in other files, the sequence in which the transactions occurred can be readily determined.

    Abstract translation: 多个共享文件（10）可由多个主处理器（30a，30b，30c）中的每一个访问。 每个主处理器包括用于访问共享文件的所选记录的数据库访问系统（36）。 日记合并关键表（38）存储事务序列信息，特别是每个处理器执行的事务数的计数和每个处理器已经被重新启动的次数。 每当数据库访问系统开始访问和修改所选记录的事务时，锁管理器通过通信单元与其他处理器通信（40）。 锁定通信阻止其他处理器访问相同的记录，并将更多的当前事务计数信息传达给其他处理器。 来自其他处理器的确认信号从其返回最新的事务计数信息。 进行交易的处理器创建包括交易和序列信息的日志记录，特别是计数信息。 日志记录存储在专用于处理器的日志文件（50）中。 通过将存储的计数信息与其他文件中的事务记录进行比较，可以容易地确定发生事务的顺序。

    Method of and arrangement for ordering of multiprocessor operations in a multiprocessor system with redundant resources
    315.
    发明授权
    Method of and arrangement for ordering of multiprocessor operations in a multiprocessor system with redundant resources 失效
    在具有冗余资源的多处理器系统中排序多处理器操作的方法和安排

    公开(公告)号：US4805106A

    公开(公告)日：1989-02-14

    申请号：US73400

    申请日：1987-07-09

    Applicant: Randy D. Pfeifer

    Inventor： Randy D. Pfeifer

    IPC: G06F13/38 ,  G06F9/52 ,  G06F11/14 ,  G06F11/16 ,  G06F15/16 ,  G06F15/177 ,  G06F9/30 ,  G06F13/16

    CPC classification number: G06F11/14 ,  G06F11/1666 ,  G06F11/2035 ,  G06F11/2043 ,  G06F9/52 ,  G06F2201/825

    Abstract: To lock use of shared information to itself in a multiprocessor system (100) having two independently and asynchronously operating processors (101, 111) whose main store units (102, 112) duplicate each other's contents, a processor must cause an atomic read-modify-write (RMW) operation to be executed on a semaphore in the duplicated main store units of both processors. To properly order execution of multiple such RMW operations, arbiters (106, 116) of system buses (105, 115) of the two processors communicate over an interarbiter channel (121). The arbiter of a source processor that wishes to perform an RMW operation notifies the other processor's arbiter over the interarbiter channel. Simultaneous attempts at notification by both arbiters are resolved in favor of one of them that is designated the master. The notifying arbiter prevents its processor from performing another RMW operation until the one RMW operation has completed thereon, but permits other operations to proceed normally. The notified arbiter prevents its processor from performing another RMW operation until the one RMW operation has been transferred via interprocessor links (107, 117) and bus (120) from the source processor to the notified arbiter's processor and has been performed thereon, but permits other operations to proceed normally. Thus multiple RMW operations are performed on both processors in the same order asynchronously and without impacting performance of other operations.

    Abstract translation: 为了在具有两个主存储单元（102,112）彼此重复的内容的两个独立和异步操作的处理器（101,111）的多处理器系统（100）中锁定对共享信息的使用，处理器必须引起原子读取修改 写入（RMW）操作将在两个处理器的重复主存储单元中的信号量上执行。 为了正确地订购多个这样的RMW操作的执行，两个处理器的系统总线（105,115）的仲裁器（106,116）通过间隔器通道（121）进行通信。 希望执行RMW操作的源处理器的仲裁器通过interarbiter通道通知其他处理器的仲裁器。 双方仲裁员通知的同时尝试均得到解决，主张被指定为主人的其中一人。 通知仲裁器防止其处理器执行另一个RMW操作，直到一个RMW操作在其上完成，但允许其他操作正常进行。 所通知的仲裁器防止其处理器执行另一个RMW操作，直到一个RMW操作已经通过处理器间链路（107,117）和总线（120）从源处理器传送到所通知的仲裁器的处理器并已在其上执行，但允许其他 操作正常进行。 因此，在两个处理器上以相同的顺序异步执行多个RMW操作，而不会影响其他操作的性能。

    SYSTEM AND METHOD FOR MANAGING STORAGE TRANSACTION REQUESTS
    318.
    发明申请
    SYSTEM AND METHOD FOR MANAGING STORAGE TRANSACTION REQUESTS 审中-公开

    公开(公告)号：US20190108104A1

    公开(公告)日：2019-04-11

    申请号：US15727211

    申请日：2017-10-06

    Applicant: VMware, Inc.

    Inventor： Abhishek Gupta ,  Richard P. Spillane ,  Kapil Chowksey ,  Rob Johnson ,  Wenguang Wang

    IPC: G06F11/14 ,  G06F17/30

    CPC classification number: G06F11/1471 ,  G06F11/1474 ,  G06F16/2246 ,  G06F16/2358 ,  G06F2201/825 ,  G06F2201/87

    Abstract: Data storage system and method for managing transaction requests to the data storage system utilizes a write ahead log to write transaction requests received at the data storage system during a current checkpoint generation. After the transaction requests in the write ahead log are applied to a copy-on-write (COW) storage data structure stored in a storage system, one of first and second allocation bitmaps is updated to reflect changes in the COW storage data structure with respect to allocation of storage space in the storage system, and one of first and second super blocks is updated with references to central nodes of the COW storage data structure. After the allocation bitmap and the super block have been updated, an end indicator for the current checkpoint generation is written in the write ahead log to indicate that processing of the transaction requests for the current checkpoint generation has been completed.

Patent Agency Ranking