会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • MARSHALING RESULTS OF NESTED TASKS
    • 所研究的任务的MARSHALING结果
    • US20110219380A1
    • 2011-09-08
    • US12719700
    • 2010-03-08
    • Stephen H. ToubJoseph E. HoagJohn J. DuffyDanny S. Shih
    • Stephen H. ToubJoseph E. HoagJohn J. DuffyDanny S. Shih
    • G06F9/46
    • G06F9/46
    • The present invention extends to methods, systems, and computer program products for marshaling results of nested tasks. Unwrap methods are used to reduce the level of task nesting and insure that appropriate results are marshaled between tasks. A proxy task is used to represent the aggregate asynchronous operation of a wrapping task and a wrapped task. The proxy task has a completion state that is at least indicative of the completion state of the aggregate asynchronous operation. The completion state of the aggregate asynchronous operation is determined and set from one or more of the completion state of the wrapping task and the wrapped task. The completion state of the proxy task can be conveyed to calling logic to indicate the completion state of the aggregate asynchronous operation to the calling logic.
    • 本发明扩展到用于封送嵌套任务结果的方法,系统和计算机程序产品。 Unwrap方法用于降低任务嵌套的级别,并确保在任务之间封送适当的结果。 代理任务用于表示包装任务和包装任务的聚合异步操作。 代理任务具有至少指示聚合异步操作的完成状态的完成状态。 聚合异步操作的完成状态由包装任务的完成状态和包装任务的一个或多个确定和设置。 代理任务的完成状态可以传达到调用逻辑,以指示对调用逻辑的聚合异步操作的完成状态。
    • 4. 发明申请
    • ENUMERATION OF A CONCURRENT DATA STRUCTURE
    • 同步数据结构的计算
    • US20100250507A1
    • 2010-09-30
    • US12414860
    • 2009-03-31
    • Emad OmaraJohn J. Duffy
    • Emad OmaraJohn J. Duffy
    • G06F17/30
    • G06F17/30958
    • An enumerable concurrent data structure referred to as a concurrent bag is provided. The concurrent bag is accessible by concurrent threads and includes a set of local lists configured as a linked list and a dictionary. The dictionary includes an entry for each local list that identifies the thread that created the local list and the location of the local list. Each local list includes a set of data elements configured as a linked list. A global lock on the concurrent bag and local locks on each local list allow operations that involve enumeration to be performed on the concurrent bag.
    • 提供了称为并发包的可枚举并发数据结构。 并发包可由并发线程访问,并包括一组配置为链接列表和字典的本地列表。 该字典包括每个本地列表的条目,用于标识创建本地列表的线程和本地列表的位置。 每个本地列表包括一组配置为链接列表的数据元素。 每个本地列表上的并发包和本地锁的全局锁允许在并发包上执行涉及枚举的操作。
    • 5. 发明授权
    • Coin slide with magnetic slug attracting means
    • 硬币滑块与磁渣吸引手段
    • US5220988A
    • 1993-06-22
    • US527088
    • 1990-05-22
    • Evan C. WilfongHarvey S. GitlinJohn J. Duffy
    • Evan C. WilfongHarvey S. GitlinJohn J. Duffy
    • G07D5/08G07F5/04
    • G07D5/08
    • A coin slide with attracting magnets is disclosed which incorporates a coin slide body with integral mounting flange, a keeper secured rearwardly of the mounting flange to position a plurality of magnets in vertical, side-by-side relationship, the magnets defining coin checking paths therebetween, a bridge secured to the body rearwardly of the mounting flange whereby the forward edge of the bridge and the rearward surface of the mounting flange define a clearance space therebetween, the magnets being positioned in the clearance space to detect any ferrous slugs as they pass through the magnet defined coin checking paths, the magnets lifting the slug sufficiently to cause the slug to jam against the forward edge of the bridge and not to pass through the bridge.
    • 公开了一种具有吸引磁铁的硬币滑块,其包括具有整体安装凸缘的硬币滑块体,固定在安装凸缘后方的保持器,以垂直并排关系定位多个磁体,磁体在其间限定硬币检查路径 ,桥接件,其安装在安装凸缘的后方,由此桥的前边缘和安装凸缘的后表面在其间限定了间隙空间,磁体定位在间隙空间中,以便在它们通过时检测任何铁质塞 磁铁定义的硬币检查路径,磁铁充分地提升芯块,使块塞塞住桥的前缘,而不通过桥。
    • 7. 发明授权
    • Parallel query engine with dynamic number of workers
    • 具有动态数量的工作人员的并行查询引擎
    • US08392920B2
    • 2013-03-05
    • US12695049
    • 2010-01-27
    • Igor OstrovskyJohn J. DuffyStephen Harris Toub
    • Igor OstrovskyJohn J. DuffyStephen Harris Toub
    • G06F9/40G06F9/44G06F9/46
    • G06F9/4881G06F2209/483
    • Partitioning query execution work of a sequence including a plurality of elements. A method includes a worker core requesting work from a work queue. In response, the worker core receives a task from the work queue. The task is a replicable sequence-processing task including two distinct steps: scheduling a copy of the task on the scheduler queue and processing a sequence. The worker core processes the task by: creating a replica of the task and placing the replica of the task on the work queue, and beginning processing the sequence. The acts are repeated for one or more additional worker cores, where receiving a task from the work queue is performed by receiving one or more replicas of tasks placed on the task queue by earlier performances of creating a replica of the task and placing the replica of the task on the work queue by a different worker core.
    • 分割包含多个元素的序列的查询执行工作。 一种方法包括从工作队列请求工作的工作者核心。 作为响应,工作核心从工作队列接收任务。 该任务是可重复的序列处理任务,其包括两个不同的步骤:在调度器队列上调度任务的副本并处理序列。 工作核心通过以下方式来处理任务:创建任务的副本并将任务的副本放在工作队列上,并开始处理序列。 对于一个或多个额外的工作核心重复执行动作,其中从工作队列接收任务通过接收一个或多个放置在任务队列上的任务的副本来执行,以通过较早的创建该任务副本的性能并将副本 工作队列中的任务由不同的工作人员核心。
    • 8. 发明申请
    • SCALABLE THREAD LOCKING WITH CUSTOMIZABLE SPINNING
    • 可定制螺纹锁定与自定义旋转
    • US20110126204A1
    • 2011-05-26
    • US12625344
    • 2009-11-24
    • Emad A. OmaraJohn J. Duffy
    • Emad A. OmaraJohn J. Duffy
    • G06F9/46
    • G06F9/4843G06F9/526
    • Embodiments described herein are directed to dynamically controlling the number of spins for a selected processing thread among a plurality of processing threads. A computer system tracks both the number of waiting processing threads and each thread's turn, wherein a selected thread's turn comprises the total number of waiting processing threads after the selected thread's arrival at the processor. Next, the computer system determines, based the selected thread's turn, the number of spins that are to occur before the selected thread checks for an available thread lock. The computer system also, based on the selected thread's turn, changes the number of spins, such that the number of spins for the selected thread is a function of the number of waiting processing threads and processors in the computer system.
    • 本文描述的实施例涉及动态地控制多个处理线程中所选择的处理线程的自旋数量。 计算机系统跟踪等待处理线程和每个线程的轮次数,其中所选线程的回合包括所选线程到达处理器之后的等待处理线程的总数。 接下来,计算机系统基于所选线程的轮次确定在所选线程检查可用线程锁之前将发生的自旋数。 计算机系统还基于选择的线程轮到改变自旋数,使得所选线程的旋转数量是计算机系统中等待处理线程和处理器的数量的函数。
    • 9. 发明授权
    • Concurrent mutation of isolated object graphs
    • 孤立对象图并发突变
    • US09569282B2
    • 2017-02-14
    • US12429874
    • 2009-04-24
    • John J. DuffyNiklas GustafssonVance Morrison
    • John J. DuffyNiklas GustafssonVance Morrison
    • G06F9/45G06F9/52G06F9/46G06F21/78
    • G06F9/526G06F9/468G06F21/78
    • Fine-grained parallelism within isolated object graphs is used to provide safe concurrent operations within the isolated object graphs. One example provides an abstraction labeled IsolatedObjectGraph that encapsulates at least one object graph, but often two or more object graphs, rooted by an instance of a type member. By encapsulating the object graph, no references from outside of the object graph are allowed to objects inside of the object graph. Also, the encapsulated object graph does not contain references to objects outside of the graphs. The isolated object graphs provide for safe data parallel operations, including safe data parallel mutations such as for each loops. In an example, the ability to isolate the object graph is provided through type permissions.
    • 孤立对象图中的细粒度并行性用于在孤立的对象图中提供安全并发操作。 一个例子提供了一个标记为IsolatedObjectGraph的抽象,它封装了至少一个对象图,但通常是两个或更多个由类型成员的实例生成的对象图。 通过封装对象图,不允许对象图外部的引用对象图形内的对象。 此外,封装的对象图不包含对图形之外的对象的引用。 孤立的对象图提供了安全数据并行操作,包括安全数据并行突变,如每个循环。 在一个示例中,通过类型权限提供隔离对象图的能力。
    • 10. 发明授权
    • Enumeration of a concurrent data structure
    • 枚举并发数据结构
    • US09418175B2
    • 2016-08-16
    • US12414860
    • 2009-03-31
    • Emad OmaraJohn J. Duffy
    • Emad OmaraJohn J. Duffy
    • G06F7/00G06F17/00G06F17/30
    • G06F17/30958
    • An enumerable concurrent data structure referred to as a concurrent bag is provided. The concurrent bag is accessible by concurrent threads and includes a set of local lists configured as a linked list and a dictionary. The dictionary includes an entry for each local list that identifies the thread that created the local list and the location of the local list. Each local list includes a set of data elements configured as a linked list. A global lock on the concurrent bag and local locks on each local list allow operations that involve enumeration to be performed on the concurrent bag.
    • 提供了称为并发包的可枚举并发数据结构。 并发包可由并发线程访问,并包括一组配置为链接列表和字典的本地列表。 该字典包括每个本地列表的条目,用于标识创建本地列表的线程和本地列表的位置。 每个本地列表包括一组配置为链接列表的数据元素。 每个本地列表上的并发包和本地锁的全局锁允许在并发包上执行涉及枚举的操作。