专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US06336170B1 Method and system in a distributed shared-memory data processing system for determining utilization of shared-memory included within nodes by a designated application 有权
标题翻译：分布式共享存储器数据处理系统中的方法和系统，用于确定由指定应用程序包含在节点内的共享存储器的利用率
公开(公告)号：US06336170B1
公开(公告)日：2002-01-01
申请号：US09170898
申请日：1998-10-13
申请人： Mark E. Dean , James Michael Magee , Ronald Lynn Rockhold , Guy G. Sotomayor, Jr. , James Van Fleet
发明人： Mark E. Dean , James Michael Magee , Ronald Lynn Rockhold , Guy G. Sotomayor, Jr. , James Van Fleet
IPC分类号： G06F1200
CPC分类号： G06F11/3409 , G06F9/5016 , G06F2201/87 , G06F2201/88
摘要： A method and system in a distributed shared-memory data processing system are disclosed having a single operating system being executed simultaneously by a plurality of processors included within a plurality of coupled processing nodes for determining a utilization of each memory location included within a shared-memory included within each of the plurality of nodes by each of the plurality of nodes. The operating system processes a designated application utilizing the plurality of nodes. During the processing, for each of the plurality of nodes, a determination is made of a quantity of times each memory location included within a shared-memory included within each of the plurality of nodes is accessed by each of the plurality of nodes.
摘要翻译：公开了一种分布式共享存储器数据处理系统中的方法和系统，其具有由包括在多个耦合处理节点内的多个处理器同时执行的单个操作系统，用于确定包括在共享存储器内的每个存储器位置的使用由所述多个节点中的每个节点包括在所述多个节点的每一个节点内。操作系统使用多个节点处理指定的应用程序。在处理期间，对于多个节点中的每一个节点，确定包括在多个节点中的每个节点内的共享存储器内的每个存储器位置的每个节点访问的次数。

2. 发明申请

US20080059673A1 System and Method for Measuring Latch Contention 失效
标题翻译：测量闩锁竞争的系统和方法
公开(公告)号：US20080059673A1
公开(公告)日：2008-03-06
申请号：US11935371
申请日：2007-11-05
申请人： David Mehaffy , James Van Fleet
发明人： David Mehaffy , James Van Fleet
IPC分类号： G06F12/00
CPC分类号： G06F9/526 , Y10S707/99938
摘要： A system and method is provided for measuring lock usage in a non-intrusive manner. Measurements are performed only when a lock is contended. When a lock is requested and the lock is available (i.e., is not contended), the only data gathered is a counter that is incremented to keep track of the number of times the particular lock was requested. When a lock is contended, an operating system trace hook is requested. The trace hook records data such as the timestamp that the requester requested the lock, the request count, a stack traceback to identify the function corresponding to the requester, and the address of the lock that was requested. Post-operative processing analyzes the recorded trace hook data to identify contended locks and processes that may not be efficiently using locks.
摘要翻译：提供了一种用于以非侵入方式测量锁使用的系统和方法。仅当锁定时才进行测量。当请求锁并且锁可用时（即不竞争），所收集的唯一数据是递增的计数器以跟踪特定锁被请求的次数。当有争议时，需要一个操作系统跟踪钩。跟踪钩子记录数据，例如请求者请求锁定的时间戳，请求计数，用于标识与请求者相对应的功能的堆栈追溯以及所请求的锁的地址。手术后处理分析记录的跟踪钩数据，以识别可能无法有效使用锁的竞争锁和进程。

3. 发明申请

US20070100826A1 Method for improving the performance of database loggers using agent coordination 有权
标题翻译：使用代理协调来提高数据库记录器性能的方法
公开(公告)号：US20070100826A1
公开(公告)日：2007-05-03
申请号：US11260623
申请日：2005-10-27
申请人： David Mehaffy , James Van Fleet
发明人： David Mehaffy , James Van Fleet
IPC分类号： G06F17/30
CPC分类号： G06F17/30368 , Y10S707/99953
摘要： A method for substantially reducing the latency of the database (DB) logging process by removing the agent notification requirement from the DB logger and allowing the DB logger to proceed to the next commit process without the latency of providing each waiting agent a notification that the agent continue their respective processes. When an agent commits a change to persistent storage of the database, the request is received by the logger, which performs the update to the persistent storage. A list of agents waiting on the completion of the commit process is compiled by the logger. The list of agents is provided to and provided to the next committing agent. The next committing agent then notifies the waiting agents that they are able to proceed with their respective processing. The logger may immediately perform the next update to persistent memory without utilizing a substantial amount of time notifying the waiting agents.
摘要翻译：一种通过从DB记录器中删除代理通知要求并允许DB记录器继续进行下一个提交进程而大大减少数据库（DB）日志记录进程的延迟的方法，而不会为每个等待代理提供通知代理继续各自的进程。当代理人对数据库的持久存储进行更改时，该记录器将接收该请求，该记录器将执行对持久存储的更新。在完成提交进程时等待的代理程序列表由记录器编译。代理列表提供给并提供给下一个提交代理。然后下一个提交代理通知等待代理人他们能够进行各自的处理。记录器可以立即对持久存储器执行下一次更新，而不用大量时间通知等待代理。

4. 发明授权

US06358620B1 Unsaturated polyester resin compositions 失效
标题翻译：不饱和聚酯树脂组合物
公开(公告)号：US06358620B1
公开(公告)日：2002-03-19
申请号：US09517403
申请日：2000-03-02
申请人： Howard B. Yokelson , James Van Fleet , Karen E. Medema
发明人： Howard B. Yokelson , James Van Fleet , Karen E. Medema
IPC分类号： B32B2706
CPC分类号： C08L67/07 , B32B5/28 , C08G63/918 , C08K5/00 , Y10T428/31786
摘要： This invention is chemically resistant thermosetting resins having low contents of volatile organic components comprising (i) a minor amount by weight of ethylenically unsaturated reactive solvent, (ii) a major amount by weight of an unsaturated polyester produced by a process which comprises; (a) condensing dihydric alcohol with at least one dicarboxylic acid and/or anhydride of dicarboxylic acid to form a condensation polymer having an acid number (AN) in a range upward from about 5 mg KOH/g polymer, and (b) reacting the condensation polymer with an amount of glycidyl methacrylate such that the weight ratio of glycidyl methacrylate to condensation polymer is in a range of from about 0.001 AN to about 0.005 AN.
摘要翻译：本发明是具有低含量挥发性有机成分的耐化学性热固性树脂，其包含（i）少量的烯键式不饱和反应性溶剂，（ii）主要通过包括以下方法生产的不饱和聚酯的重量：（a）将二元醇与二羧酸的至少一种二羧酸和/或酸酐缩合以形成在约5mg KOH / g聚合物上方范围内的酸值（AN）的缩合物，和（b）使具有一定量的甲基丙烯酸缩水甘油酯的缩合聚合物使得甲基丙烯酸缩水甘油酯与缩聚物的重量比在约0.001An至约0.005A AN的范围内。

5. 发明申请

US20080072228A1 System and method for delayed priority boost 失效
标题翻译：用于延迟优先级提升的系统和方法
公开(公告)号：US20080072228A1
公开(公告)日：2008-03-20
申请号：US11943649
申请日：2007-11-21
申请人： Jos Accapadi , Andrew Dunshea , Dirk Michel , James Van Fleet
发明人： Jos Accapadi , Andrew Dunshea , Dirk Michel , James Van Fleet
IPC分类号： G06F9/46
CPC分类号： G06F9/52 , G06F9/4818
摘要： A system and method is provided for delaying a priority boost of an execution thread. When a thread prepares to enter a critical section of code, such as when the thread utilizes a shared system resource, a user mode accessible data area is updated indicating that the thread is in a critical section and, if the kernel receives a preemption event, the priority boost that the thread should receive. If the kernel receives a preemption event before the thread finishes the critical section, the kernel applies the priority boost on behalf of the thread. Often, the thread will finish the critical section without having to have its priority actually boosted. If the thread does receive an actual priority boost then, after the critical section is finished, the kernel resets the thread's priority to a normal level.
摘要翻译：提供了一种用于延迟执行线程的优先级提升的系统和方法。当线程准备进入代码的关键部分时，例如当线程利用共享系统资源时，更新用户模式可访问数据区域，指示线程处于关键部分，并且如果内核接收到抢占事件，线程应该接收的优先级提升。如果内核在线程完成关键部分之前收到抢占事件，则内核将代表线程应用优先级提升。通常，线程将完成关键部分，而无需实际提升优先级。如果线程确实接收到实际的优先级提升，那么在关键部分完成之后，内核会将线程的优先级重置为正常级别。

6. 发明申请

US20050203904A1 System and method for measuring latch contention 失效
标题翻译：用于测量闩锁争用的系统和方法
公开(公告)号：US20050203904A1
公开(公告)日：2005-09-15
申请号：US10798905
申请日：2004-03-11
申请人： David Mehaffy , James Van Fleet
发明人： David Mehaffy , James Van Fleet
IPC分类号： G06F7/00
CPC分类号： G06F9/526 , Y10S707/99938
摘要： A system and method is provided for measuring lock usage in a non-intrusive manner. Measurements are performed only when a lock is contended. When a lock is requested and the lock is available (i.e., is not contended), the only data gathered is a counter that is incremented to keep track of the number of times the particular lock was requested. When a lock is contended, an operating system trace hook is requested. The trace hook records data such as the timestamp that the requestor requested the lock, the request count, a stack traceback to identify the function corresponding to the requestor, and the address of the lock that was requested. Post-operative processing analyzes the recorded trace hook data to identify contended locks and processes that may not be efficiently using locks.
摘要翻译：提供了一种用于以非侵入方式测量锁使用的系统和方法。仅当锁定时才进行测量。当请求锁并且锁可用时（即不竞争），所收集的唯一数据是递增的计数器以跟踪特定锁被请求的次数。当有争议时，需要一个操作系统跟踪钩。跟踪钩子记录诸如请求者请求锁定的时间戳，请求计数，用于标识与请求者相对应的功能的堆栈追溯以及所请求的锁的地址的数据。手术后处理分析记录的跟踪钩数据，以识别可能无法有效使用锁的竞争锁和进程。

7. 发明申请

US20050022186A1 System and method for delayed priority boost 有权
标题翻译：用于延迟优先级提升的系统和方法
公开(公告)号：US20050022186A1
公开(公告)日：2005-01-27
申请号：US10626192
申请日：2003-07-24
申请人： Jos Accapadi , Andrew Dunshea , Dirk Michel , James Van Fleet
发明人： Jos Accapadi , Andrew Dunshea , Dirk Michel , James Van Fleet
IPC分类号： G06F9/46
CPC分类号： G06F9/52 , G06F9/4818
摘要： A system and method is provided for delaying a priority boost of an execution thread. When a thread prepares to enter a critical section of code, such as when the thread utilizes a shared system resource, a user mode accessible data area is updated indicating that the thread is in a critical section and, if the kernel receives a preemption event, the priority boost that the thread should receive. If the kernel receives a preemption event before the thread finishes the critical section, the kernel applies the priority boost on behalf of the thread. Often, the thread will finish the critical section without having to have its priority actually boosted. If the thread does receive an actual priority boost then, after the critical section is finished, the kernel resets the thread's priority to a normal level.
摘要翻译：提供了一种用于延迟执行线程的优先级提升的系统和方法。当线程准备进入代码的关键部分时，例如当线程利用共享系统资源时，更新用户模式可访问数据区域，指示线程处于关键部分，并且如果内核接收到抢占事件，线程应该接收的优先级提升。如果内核在线程完成关键部分之前收到抢占事件，则内核将代表线程应用优先级提升。通常，线程将完成关键部分，而无需实际提升优先级。如果线程确实接收到实际的优先级提升，那么在关键部分完成之后，内核会将线程的优先级重置为正常级别。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式