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

21. 发明授权

US08806168B2 Producer-consumer data transfer using piecewise circular queue 有权
标题翻译：使用分段循环队列的生产者 - 消费者数据传输
公开(公告)号：US08806168B2
公开(公告)日：2014-08-12
申请号：US13230833
申请日：2011-09-12
申请人： Igor Ostrovsky , Stephen H. Toub
发明人： Igor Ostrovsky , Stephen H. Toub
IPC分类号： G06F12/02
CPC分类号： G06F12/02 , G06F9/544 , G06F2209/548
摘要： A method includes producing values with a producer thread, and providing a queue data structure including a first array of storage locations for storing the values. The first array has a first tail pointer and a first linking pointer. If a number of values stored in the first array is less than a capacity of the first array, an enqueue operation writes a new value at a storage location pointed to by the first tail pointer and advances the first tail pointer. If the number of values stored in the first array is equal to the capacity of the first array, a second array of storage locations is allocated in the queue. The second array has a second tail pointer. The first array is linked to the second array with the first linking pointer. An enqueue operation writes the new value at a storage location pointed to by the second tail pointer and advances the second tail pointer.
摘要翻译：一种方法包括使用生产者线程生成值，并提供包括用于存储值的存储位置的第一阵列的队列数据结构。第一个数组有一个第一个尾部指针和一个第一个链接指针。如果存储在第一阵列中的多个值小于第一阵列的容量，则入队操作将新值写入由第一尾指针指向的存储位置并且前进第一尾指针。如果存储在第一个阵列中的值的数量等于第一个阵列的容量，则在队列中分配第二个存储位置阵列。第二个数组有一个第二个尾部指针。第一个数组用第一个链接指针链接到第二个数组。排队操作将新值写入由第二个尾部指针指向的存储位置，并推进第二个尾部指针。

22. 发明授权

US08707320B2 Dynamic partitioning of data by occasionally doubling data chunk size for data-parallel applications 有权
标题翻译：通过偶尔将数据块大小加倍的数据并行应用来动态划分数据
公开(公告)号：US08707320B2
公开(公告)日：2014-04-22
申请号：US12712986
申请日：2010-02-25
申请人： Michael Liddell , Igor Ostrovsky , Stephen Toub
发明人： Michael Liddell , Igor Ostrovsky , Stephen Toub
IPC分类号： G06F9/46
CPC分类号： G06F9/505
摘要： Dynamic data partitioning is disclosed for use with a multiple node processing system that consumes items from a data stream of any length and independent of whether the length is undeclared. Dynamic data partitioning takes items from the data stream when a thread is idle and assigns the taken items to an idle thread, and it varies the size of data chunks taken from the stream and assigned to a thread to efficiently distribute work loads among the nodes. In one example, data chunk sizes taken from the beginning of the data stream are relatively smaller than data chunk sizes taken towards the middle or end of the data stream. Dynamic data partitioning employs a growth function where chunks have a size related to single aligned cache lines and efficiently increases the size of the data chunks to occasionally double the amount of data assigned to concurrent threads.
摘要翻译：公开了与多节点处理系统一起使用的动态数据分区，其从任何长度的数据流消耗项目，并且与长度是否未声明无关。动态数据分区在线程空闲时从数据流中获取项目，并将所获取的项目分配给空闲线程，并且将从流中分配给分配给线程的数据块的大小变化，从而有效地在节点之间分配工作负载。在一个示例中，从数据流的开头获取的数据块大小相对于数据流的中间或结尾所采取的数据块大小相对较小。动态数据分区使用增长函数，其中块与单个对齐的高速缓存行相关联，并有效地增加数据块的大小，以偶尔将分配给并发线程的数据量加倍。

23. 发明授权

US08631279B2 Propagating unobserved exceptions in distributed execution environments 有权
标题翻译：在分布式执行环境中传播不可观察的异常
公开(公告)号：US08631279B2
公开(公告)日：2014-01-14
申请号：US13155263
申请日：2011-06-07
申请人： Huseyin Serkan Yildiz , Massimo Mascaro , Joseph E. Hoag , Igor Ostrovsky
发明人： Huseyin Serkan Yildiz , Massimo Mascaro , Joseph E. Hoag , Igor Ostrovsky
IPC分类号： G06F11/07
CPC分类号： G06F11/0784
摘要： The present invention extends to methods, systems, and computer program products for propagating unhandled exceptions in distributed execution environments, such as clusters. A job (e.g., a query) can include a series of computation steps that are executed on multiple compute nodes each processing parts of a distributed data set. Unhandled exceptions can be caught while computations are running on data partitions of different compute nodes. Unhandled exception objects can be stored in a serialized format in a compute node's local storage (or an alternate central location) along with auxiliary details such as the data partition being processed at the time. Stored serialized exception objects for a job can be harvested and aggregated in a single container object. The single container object can be passed back to the client.
摘要翻译：本发明扩展到方法，系统和计算机程序产品，用于在分布式执行环境（如群集）中传播未处理的异常。作业（例如，查询）可以包括在多个计算节点上执行的一系列计算步骤，每个处理分布式数据集的各个部分。在不同计算节点的数据分区上运行计算时可以捕获未处理的异常。未处理的异常对象可以以计算节点的本地存储（或备用中心位置）中的序列化格式以及当时正在处理的数据分区等辅助细节存储。存储作业的序列化异常对象可以在单个容器对象中进行收集和聚合。单个容器对象可以传回客户端。

24. 发明申请

US20090300766A1 BLOCKING AND BOUNDING WRAPPER FOR THREAD-SAFE DATA COLLECTIONS 有权
标题翻译：用于安全数据收集的阻塞和缠绕包装
公开(公告)号：US20090300766A1
公开(公告)日：2009-12-03
申请号：US12131123
申请日：2008-06-02
申请人： Stephen Toub , Joe Duffy , Samer El Baghdady , Emad Ali , Igor Ostrovsky
发明人： Stephen Toub , Joe Duffy , Samer El Baghdady , Emad Ali , Igor Ostrovsky
IPC分类号： G06F21/00
CPC分类号： G06F21/604 , G06F9/526 , G06F21/6218
摘要： A membership interface provides procedure headings to add and remove elements of a data collection, without specifying the organizational structure of the data collection. A membership implementation associated with the membership interface provides thread-safe operations to implement the interface procedures. A blocking-bounding wrapper on the membership implementation provides blocking and bounding support separately from the thread-safety mechanism.
摘要翻译：会员界面提供了用于添加和删除数据集合元素的过程标题，而不指定数据集合的组织结构。与成员接口关联的成员资格实现提供线程安全操作来实现接口过程。成员身份实现中的阻塞边界包装器与线程安全机制分开提供了阻塞和边界支持。

25. 发明授权

US09846628B2 Indicating parallel operations with user-visible events 有权
公开(公告)号：US09846628B2
公开(公告)日：2017-12-19
申请号：US12816165
申请日：2010-06-15
申请人： Edward G. Essey , Igor Ostrovsky , Pooja Nagpal , Huseyin S. Yildiz , Hazim Shafi , William T. Colburn
发明人： Edward G. Essey , Igor Ostrovsky , Pooja Nagpal , Huseyin S. Yildiz , Hazim Shafi , William T. Colburn
IPC分类号： G06F9/44 , G06F3/048 , G06F11/32 , G06F11/34
CPC分类号： G06F11/323 , G06F11/3409 , G06F11/3476 , G06F2201/86
摘要： The present invention extends to methods, systems, and computer program products for indicating parallel operations with user-visible events. Event markers can be used to indicate an abstracted outer layer of execution as well as expose internal specifics of parallel processing systems, including systems that provide data parallelism. Event markers can be used to show a variety of execution characteristics including higher-level markers to indicate the beginning and end of an execution program (e.g., a query). Inside the execution program (query) individual fork/join operations can be indicated with sub-levels of markers to expose their operations. Additional decisions made by an execution engine, such as, for example, when elements initially yield, when queries overlap or nest, when the query is cancelled, when the query bails to sequential operation, when premature merging or re-partitioning are needed can also be exposed.

26. 发明申请

US20110185358A1 PARALLEL QUERY ENGINE WITH DYNAMIC NUMBER OF WORKERS 有权
标题翻译：平行查询引擎与动员数量的工人
公开(公告)号：US20110185358A1
公开(公告)日：2011-07-28
申请号：US12695049
申请日：2010-01-27
申请人： Igor Ostrovsky , John J. Duffy , Stephen Harris Toub
发明人： Igor Ostrovsky , John J. Duffy , Stephen Harris Toub
IPC分类号： G06F9/46
CPC分类号： G06F9/4881 , G06F2209/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.
摘要翻译：分割包含多个元素的序列的查询执行工作。一种方法包括从工作队列请求工作的工作者核心。作为响应，工作核心从工作队列接收任务。该任务是可重复的序列处理任务，其包括两个不同的步骤：在调度器队列上调度任务的副本并处理序列。工作核心通过以下方式来处理任务：创建任务的副本并将任务的副本放在工作队列上，并开始处理序列。对于一个或多个额外的工作核心重复执行动作，其中从工作队列接收任务通过接收一个或多个放置在任务队列上的任务的副本来执行，以通过较早的创建该任务副本的性能并将工作队列中的任务由不同的工作人员核心。

27. 发明申请

US20110125805A1 GROUPING MECHANISM FOR MULTIPLE PROCESSOR CORE EXECUTION 有权
标题翻译：多处理器核心执行分组机制
公开(公告)号：US20110125805A1
公开(公告)日：2011-05-26
申请号：US12625379
申请日：2009-11-24
申请人： Igor Ostrovsky
发明人： Igor Ostrovsky
IPC分类号： G06F17/30
CPC分类号： G06F9/5038 , G06F9/5066
摘要： A concurrent grouping operation for execution on a multiple core processor is provided. The grouping operation is provided with a sequence or set of elements. In one phase, each worker receives a partition of a sequence of elements to be grouped. The elements of each partition are arranged into a data structure, which includes one or more keys where each key corresponds to a value list of one or more of the received elements associated with that key. In another phase, the data structures created by each worker are merged so that the keys and corresponding elements for the entire sequence of elements exist in one data structure. Recursive merging can be completed in a constant time, which is not proportional to the length of the sequence.
摘要翻译：提供了用于在多核处理器上执行的并发分组操作。分组操作具有序列或一组元素。在一个阶段，每个工作人员接收要分组的元素序列的分区。每个分区的元素被布置成数据结构，其包括一个或多个键，其中每个键对应于与该键相关联的一个或多个接收到的元素的值列表。在另一个阶段，由每个工作者创建的数据结构被合并，使得整个元素序列的键和对应的元素存在于一个数据结构中。递归合并可以在恒定时间内完成，这与序列的长度不成比例。

28. 发明授权

US08606791B2 Concurrently accessed hash table 有权
标题翻译：并发访问的哈希表
公开(公告)号：US08606791B2
公开(公告)日：2013-12-10
申请号：US13163260
申请日：2011-06-17
申请人： Igor Ostrovsky
发明人： Igor Ostrovsky
IPC分类号： G06F17/30
CPC分类号： G06F17/30949 , G06F17/30348
摘要： A method of resizing a concurrently accessed hash table is disclosed. The method includes acquiring the locks in the hash table. The hash table, in a first state, is dynamically reconfigured in size into a second state. Additionally, the amount of locks is dynamically adjusted based on comparing the size of the hash table in the second state to the size of the hash table in the second state.
摘要翻译：公开了一种调整并发访问的散列表的大小的方法。该方法包括获取哈希表中的锁。处于第一状态的哈希表在大小上被动态地重新配置成第二状态。此外，基于将第二状态中的散列表的大小与第二状态中的散列表的大小进行比较，动态地调整锁的量。

29. 发明申请

US20130132684A1 AUTOMATIC OPTIMIZATION FOR PROGRAMMING OF MANY-CORE ARCHITECTURES 有权
标题翻译：用于编程多个核心架构的自动优化
公开(公告)号：US20130132684A1
公开(公告)日：2013-05-23
申请号：US13300464
申请日：2011-11-18
申请人： Igor Ostrovsky , Zachary David Johnson
发明人： Igor Ostrovsky , Zachary David Johnson
IPC分类号： G06F12/00 , G06F12/16
CPC分类号： G06F11/3471 , G06F11/3409
摘要： The present invention extends to methods, systems, and computer program products for automatically optimizing memory accesses by kernel functions executing on parallel accelerator processors. A function is accessed. The function is configured to operate over a multi-dimensional matrix of memory cells through invocation as a plurality of threads on a parallel accelerator processor. A layout of the memory cells of the multi-dimensional matrix and a mapping of memory cells to global memory at the parallel accelerator processor are identified. The function is analyzed to identify how each of the threads access the global memory to operate on corresponding memory cells when invoked from the kernel function. Based on the analysis, the function altered to utilize a more efficient memory access scheme when performing accesses to the global memory. The more efficient memory access scheme increases coalesced memory access by the threads when invoked over the multi-dimensional matrix.
摘要翻译：本发明扩展到用于通过在并行加速器处理器上执行的内核功能自动优化存储器访问的方法，系统和计算机程序产品。访问一个功能。该功能被配置为通过调用作为并行加速器处理器上的多个线程在多维矩阵的存储器单元上进行操作。识别多维矩阵的存储单元的布局以及在并行加速器处理器处的存储单元与全局存储器的映射。分析该功能以识别当从内核功能调用时，每个线程如何访问全局存储器以对相应的存储器单元进行操作。基于分析，当执行对全局存储器的访问时，功能被改变以利用更有效的存储器访问方案。当通过多维矩阵调用时，更有效的存储器访问方案增加了线程的合并的存储器访问。

30. 发明授权

US08392920B2 Parallel query engine with dynamic number of workers 有权
标题翻译：具有动态数量的工作人员的并行查询引擎
公开(公告)号：US08392920B2
公开(公告)日：2013-03-05
申请号：US12695049
申请日：2010-01-27
申请人： Igor Ostrovsky , John J. Duffy , Stephen Harris Toub
发明人： Igor Ostrovsky , John J. Duffy , Stephen Harris Toub
IPC分类号： G06F9/40 , G06F9/44 , G06F9/46
CPC分类号： G06F9/4881 , G06F2209/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.
摘要翻译：分割包含多个元素的序列的查询执行工作。一种方法包括从工作队列请求工作的工作者核心。作为响应，工作核心从工作队列接收任务。该任务是可重复的序列处理任务，其包括两个不同的步骤：在调度器队列上调度任务的副本并处理序列。工作核心通过以下方式来处理任务：创建任务的副本并将任务的副本放在工作队列上，并开始处理序列。对于一个或多个额外的工作核心重复执行动作，其中从工作队列接收任务通过接收一个或多个放置在任务队列上的任务的副本来执行，以通过较早的创建该任务副本的性能并将副本工作队列中的任务由不同的工作人员核心。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式