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

1. 发明授权

US09262230B2 Method and system for work partitioning between processors with work demand feedback 有权
标题翻译：具有工作需求反馈的处理器之间工作分区的方法和系统
公开(公告)号：US09262230B2
公开(公告)日：2016-02-16
申请号：US13991373
申请日：2011-08-05
申请人： Anton Malakhov , Alexey Kukanov
发明人： Anton Malakhov , Alexey Kukanov
IPC分类号： G06F9/46 , G06F9/50
CPC分类号： G06F9/5077 , G06F9/5066 , G06F9/5088 , G06F2209/5017 , G06F2209/5022
摘要： A method according to one embodiment includes the operations of loading binary code comprising a top level task into memory on a first processor, the top level task having an associated range; determining if the top level task is divisible into a plurality of sub-tasks based on the range; for each of the sub-tasks, determining if a given sub-task is divisible into a plurality of sub-sub-tasks; and if the given sub-task is indivisible, executing the given sub-task; otherwise, if the given sub-task is divisible, dividing the given sub-task into the plurality of sub-sub-tasks.
摘要翻译：根据一个实施例的方法包括将包括顶级任务的二进制码加载到第一处理器上的存储器的操作，所述顶级任务具有相关联的范围; 基于所述范围来确定所述顶级任务是否可被划分为多个子任务; 对于每个子任务，确定给定的子任务是否可分成多个子子任务; 并且如果给定的子任务是不可分割的，则执行给定的子任务; 否则，如果给定的子任务是可分割的，则将给定的子任务划分为多个子子任务。

2. 发明授权

US08707324B2 Fair scalable reader-writer mutual exclusion 有权
标题翻译：公平可扩展的读写器互斥
公开(公告)号：US08707324B2
公开(公告)日：2014-04-22
申请号：US13405772
申请日：2012-02-27
申请人： Alexey Kukanov , Arch D. Robison
发明人： Alexey Kukanov , Arch D. Robison
IPC分类号： G06F9/46 , G06F7/00
CPC分类号： G06F9/526
摘要： Implementing fair scalable reader writer mutual exclusion for access to a critical section by a plurality of processing threads is accomplished by creating a first queue node for a first thread, the first queue node representing a request by the first thread to access the critical section; setting at least one pointer within a queue to point to the first queue node, the queue representing at least one thread desiring access to the critical section; waiting until a condition is met, the condition comprising the first queue node having no preceding write requests as indicated by at least one predecessor queue node on the queue; permitting the first thread to enter the critical section in response to the condition being met; and causing the first thread to release a spin lock, the spin lock acquired by a second thread of the plurality of processing threads.
摘要翻译：通过为第一线程创建第一队列节点来实现用于通过多个处理线程访问关键部分的公平可扩展读取器写入器互斥，第一队列节点表示第一线程访问关键部分的请求; 将队列中的至少一个指针设置为指向第一队列节点，所述队列表示希望访问关键部分的至少一个线程; 等待直到满足条件，所述条件包括由队列上的至少一个前导队列节点指示的没有先前写入请求的第一队列节点; 允许第一线程响应于满足的条件进入临界区; 并且使所述第一螺纹释放旋转锁定，所述自旋锁由所述多个处理线程中的第二线程获取。

3. 发明授权

US08127303B2 Fair scalable reader-writer mutual exclusion 有权
标题翻译：公平可扩展的读写器互斥
公开(公告)号：US08127303B2
公开(公告)日：2012-02-28
申请号：US12782394
申请日：2010-05-18
申请人： Alexey Kukanov , Arch Robison
发明人： Alexey Kukanov , Arch Robison
IPC分类号： G06F9/46 , G06F7/00
CPC分类号： G06F9/526
摘要： Implementing fair scalable reader writer mutual exclusion for access to a critical section by a plurality of processing threads in a processing system is accomplished by creating a first queue node for a first thread on the first thread's stack, the queue node representing a request by the first thread to access the critical section; adding the first queue node to a queue pointed to by a single word reader writer mutex for the critical section, the queue representing a list of threads desiring access to the critical section, each queue node in the queue being on a stack of a thread of the plurality of processing threads; waiting until the first queue node has no preceding write requests as indicated by predecessor queue nodes on the queue; entering the critical section by the first thread; exiting the critical section by the first thread; and removing the first queue node from the queue.
摘要翻译：通过在第一线程的堆栈上为第一线程创建第一队列节点来实现在处理系统中由多个处理线程访问关键部分的公平可扩展读写器互斥，所述队列节点表示第一线程的请求线程访问临界区; 将第一队列节点添加到由关键部分的单个单词读写器互斥体指向的队列中，该队列表示期望访问关键部分的线程列表，队列中的每个队列节点在线程的堆栈上多个处理线程; 等待直到第一个队列节点没有先前的队列节点所指示的先前的写入请求; 通过第一个线程进入临界区; 通过第一个线程退出临界区; 并从队列中删除第一个队列节点。

4. 发明授权

US07730491B2 Fair scalable reader-writer mutual exclusion 有权
标题翻译：公平可扩展的读写器互斥
公开(公告)号：US07730491B2
公开(公告)日：2010-06-01
申请号：US11215863
申请日：2005-08-30
申请人： Alexey Kukanov , Arch Robison
发明人： Alexey Kukanov , Arch Robison
IPC分类号： G06F9/46 , G06F7/38
CPC分类号： G06F9/526
摘要： Implementing fair scalable reader writer mutual exclusion for access to a critical section by a plurality of processing threads in a processing system is accomplished by creating a first queue node for a first thread on the first thread's stack, the queue node representing a request by the first thread to access the critical section; adding the first queue node to a queue pointed to by a single word reader writer mutex for the critical section, the queue representing a list of threads desiring access to the critical section, each queue node in the queue being on a stack of a thread of the plurality of processing threads; waiting until the first queue node has no preceding write requests as indicated by predecessor queue nodes on the queue; entering the critical section by the first thread; exiting the critical section by the first thread; and removing the first queue node from the queue.
摘要翻译：通过在第一线程的堆栈上为第一线程创建第一队列节点来实现在处理系统中由多个处理线程访问关键部分的公平可扩展读写器互斥，所述队列节点表示第一线程的请求线程访问临界区; 将第一队列节点添加到由关键部分的单个单词读写器互斥体指向的队列中，该队列表示期望访问关键部分的线程列表，队列中的每个队列节点在线程的堆栈上多个处理线程; 等待直到第一个队列节点没有先前的队列节点所指示的先前的写入请求; 通过第一个线程进入临界区; 通过第一个线程退出临界区; 并从队列中删除第一个队列节点。

5. 发明申请

US20070067774A1 Fair scalable reader-writer mutual exclusion 有权
标题翻译：公平可扩展的读写器互斥
公开(公告)号：US20070067774A1
公开(公告)日：2007-03-22
申请号：US11215863
申请日：2005-08-30
申请人： Alexey Kukanov , Arch Robison
发明人： Alexey Kukanov , Arch Robison
IPC分类号： G06F9/46
CPC分类号： G06F9/526
摘要： Implementing fair scalable reader writer mutual exclusion for access to a critical section by a plurality of processing threads in a processing system is accomplished by creating a first queue node for a first thread on the first thread's stack, the queue node representing a request by the first thread to access the critical section; adding the first queue node to a queue pointed to by a single word reader writer mutex for the critical section, the queue representing a list of threads desiring access to the critical section, each queue node in the queue being on a stack of a thread of the plurality of processing threads; waiting until the first queue node has no preceding write requests as indicated by predecessor queue nodes on the queue; entering the critical section by the first thread; exiting the critical section by the first thread; and removing the first queue node from the queue.
摘要翻译：通过在第一线程的堆栈上为第一线程创建第一队列节点来实现在处理系统中由多个处理线程访问关键部分的公平可扩展读写器互斥，所述队列节点表示第一线程的请求线程访问临界区; 将第一队列节点添加到由关键部分的单个单词读写器互斥体指向的队列中，该队列表示期望访问关键部分的线程列表，队列中的每个队列节点在线程的堆栈上多个处理线程; 等待直到第一个队列节点没有先前的队列节点所指示的先前的写入请求; 通过第一个线程进入临界区; 通过第一个线程退出临界区; 并从队列中删除第一个队列节点。

6. 发明授权

US09244614B2 Memory coalescing computer-implemented method, system, apparatus and computer-readable media 有权
标题翻译：内存合并计算机实现的方法，系统，设备和计算机可读介质
公开(公告)号：US09244614B2
公开(公告)日：2016-01-26
申请号：US13996504
申请日：2011-04-04
申请人： Alexandr Konovalov , Alexey Kukanov
发明人： Alexandr Konovalov , Alexey Kukanov
IPC分类号： G06F12/02 , G06F3/06
CPC分类号： G06F3/0608 , G06F3/0644 , G06F3/0673 , G06F12/023 , G06F2212/1044
摘要： Embodiments of computer-implemented methods, apparatus and computer-readable media associated with memory management are disclosed herein. A computer-implemented method to coalesce free intervals of a memory may include ascertaining that a first interval of the memory is free (302, 304). A determination may be made, e.g., from a header associated with the first interval of the memory, whether a second interval of the memory, immediately preceding or following the first interval of the memory, is free (306). After a determination is made that the second interval of the memory is free, the first interval of the memory and the second interval of the memory may be coalesced (310). Other embodiments may be described and/or claimed.
摘要翻译：本文公开了与存储器管理相关联的计算机实现的方法，装置和计算机可读介质的实施例。用于聚合存储器的空闲间隔的计算机实现的方法可以包括确定存储器的第一间隔是空闲的（302,304）。可以例如从与存储器的第一间隔相关联的标题确定存储器的第一间隔之前或之后的存储器的第二间隔是空闲的（306）。在确定存储器的第二间隔是空闲之后，存储器的第一间隔和存储器的第二间隔可以合并（310）。可以描述和/或要求保护其他实施例。

7. 发明申请

US20150347023A1 MEMORY COALESCING COMPUTER-IMPLEMENTED METHOD, SYSTEM, APPARATUS AND COMPUTER-READABLE MEDIA 有权
标题翻译：存储器计算机实现方法，系统，装置和计算机可读介质
公开(公告)号：US20150347023A1
公开(公告)日：2015-12-03
申请号：US13996504
申请日：2011-04-04
申请人： Alexandr Konovalov , Alexey Kukanov
发明人： Alexandr Konovalov , Alexey Kukanov
IPC分类号： G06F3/06
CPC分类号： G06F3/0608 , G06F3/0644 , G06F3/0673 , G06F12/023 , G06F2212/1044
摘要： Embodiments of computer-implemented methods, apparatus and computer-readable media associated with memory management are disclosed herein. A computer-implemented method to coalesce free intervals of a memory may include ascertaining that a first interval of the memory is free (302, 304). A determination may be made, e.g., from a header associated with the first interval of the memory, whether a second interval of the memory, immediately preceding or following the first interval of the memory, is free (306). After a determination is made that the second interval of the memory is free, the first interval of the memory and the second interval of the memory may be coalesced (310). Other embodiments may be described and/or claimed.
摘要翻译：本文公开了与存储器管理相关联的计算机实现的方法，装置和计算机可读介质的实施例。用于聚合存储器的空闲间隔的计算机实现的方法可以包括确定存储器的第一间隔是空闲的（302,304）。可以例如从与存储器的第一间隔相关联的标题确定存储器的第一间隔之前或之后的存储器的第二间隔是空闲的（306）。在确定存储器的第二间隔是空闲之后，存储器的第一间隔和存储器的第二间隔可以合并（310）。可以描述和/或要求保护其他实施例。

8. 发明申请

US20150026698A1 METHOD AND SYSTEM FOR WORK PARTITIONING BETWEEN PROCESSORS WITH WORK DEMAND FEEDBACK 有权
标题翻译：处理器与工作需求反馈之间工作分区的方法和系统
公开(公告)号：US20150026698A1
公开(公告)日：2015-01-22
申请号：US13991373
申请日：2011-08-05
申请人： Anton Malakhov , Alexey Kukanov
发明人： Anton Malakhov , Alexey Kukanov
IPC分类号： G06F9/50
CPC分类号： G06F9/5077 , G06F9/5066 , G06F9/5088 , G06F2209/5017 , G06F2209/5022
摘要： A method according to one embodiment includes the operations of loading binary code comprising a top level task into memory on a first processor, the top level task having an associated range; determining if the top level task is divisible into a plurality of sub-tasks based on the range; for each of the sub-tasks, determining if a given sub-task is divisible into a plurality of sub-sub-tasks; and if the given sub-task is indivisible, executing the given sub-task; otherwise, if the given sub-task is divisible, dividing the given sub-task into the plurality of sub-sub-tasks.
摘要翻译：根据一个实施例的方法包括将包括顶级任务的二进制码加载到第一处理器上的存储器的操作，所述顶级任务具有相关联的范围; 基于所述范围来确定所述顶级任务是否可被划分为多个子任务; 对于每个子任务，确定给定的子任务是否可分成多个子子任务; 并且如果给定的子任务是不可分割的，则执行给定的子任务; 否则，如果给定的子任务是可分割的，则将给定子任务划分为多个子子任务。

9. 发明申请

US20120198471A1 FAIR SCALABLE READER-WRITER MUTUAL EXCLUSION 有权
标题翻译：公平的阅读器写作相互排除
公开(公告)号：US20120198471A1
公开(公告)日：2012-08-02
申请号：US13405772
申请日：2012-02-27
申请人： Alexey Kukanov , Arch D. Robison
发明人： Alexey Kukanov , Arch D. Robison
IPC分类号： G06F9/46 , G06F7/00
CPC分类号： G06F9/526
摘要： Implementing fair scalable reader writer mutual exclusion for access to a critical section by a plurality of processing threads is accomplished by creating a first queue node for a first thread, the first queue node representing a request by the first thread to access the critical section; setting at least one pointer within a queue to point to the first queue node, the queue representing at least one thread desiring access to the critical section; waiting until a condition is met, the condition comprising the first queue node having no preceding write requests as indicated by at least one predecessor queue node on the queue; permitting the first thread to enter the critical section in response to the condition being met; and causing the first thread to release a spin lock, the spin lock acquired by a second thread of the plurality of processing threads.
摘要翻译：通过为第一线程创建第一队列节点来实现用于通过多个处理线程访问关键部分的公平可扩展读写器互斥，第一队列节点表示第一线程访问临界部分的请求; 将队列中的至少一个指针设置为指向第一队列节点，所述队列表示希望访问关键部分的至少一个线程; 等待直到满足条件，所述条件包括由队列上的至少一个前导队列节点指示的没有先前写入请求的第一队列节点; 允许第一线程响应于满足的条件进入临界区; 并且使所述第一螺纹释放旋转锁定，所述自旋锁由所述多个处理线程中的第二线程获取。

10. 发明申请

US20100293553A1 FAIR SCALABLE READER-WRITER MUTUAL EXCLUSION 有权
标题翻译：公平的阅读器写作相互排除
公开(公告)号：US20100293553A1
公开(公告)日：2010-11-18
申请号：US12782394
申请日：2010-05-18
申请人： Alexey Kukanov , Arch Robison
发明人： Alexey Kukanov , Arch Robison
IPC分类号： G06F9/46
CPC分类号： G06F9/526
摘要： Implementing fair scalable reader writer mutual exclusion for access to a critical section by a plurality of processing threads in a processing system is accomplished by creating a first queue node for a first thread on the first thread's stack, the queue node representing a request by the first thread to access the critical section; adding the first queue node to a queue pointed to by a single word reader writer mutex for the critical section, the queue representing a list of threads desiring access to the critical section, each queue node in the queue being on a stack of a thread of the plurality of processing threads; waiting until the first queue node has no preceding write requests as indicated by predecessor queue nodes on the queue; entering the critical section by the first thread; exiting the critical section by the first thread; and removing the first queue node from the queue.
摘要翻译：通过在第一线程的堆栈上为第一线程创建第一队列节点来实现在处理系统中由多个处理线程访问关键部分的公平可扩展读写器互斥，所述队列节点表示第一线程的请求线程访问临界区; 将第一队列节点添加到由关键部分的单个单词读写器互斥体指向的队列中，该队列表示期望访问关键部分的线程列表，队列中的每个队列节点在线程的堆栈上多个处理线程; 等待直到第一个队列节点没有先前的队列节点所指示的先前的写入请求; 通过第一个线程进入临界区; 通过第一个线程退出临界区; 并从队列中删除第一个队列节点。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式