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

1. 发明申请

US20080208558A1 SYSTEM AND METHOD FOR SIMULATING A MULTIPROCESSOR SYSTEM 失效
标题翻译：用于模拟多处理器系统的系统和方法
公开(公告)号：US20080208558A1
公开(公告)日：2008-08-28
申请号：US12038589
申请日：2008-02-27
申请人： Huayong Wang , Kun Wang , Honesty C. Young
发明人： Huayong Wang , Kun Wang , Honesty C. Young
IPC分类号： G06G7/62
CPC分类号： G06F9/455
摘要： Disclosed are techniques for simulating a multiprocessor system is disclosed. Aspects of the present invention are based on such an observation that most memory accesses from different simulated processors do not conflict, and therefore the conservative policy for performing synchronization of all the memory accesses can waste a large amount of processing time. By identifying possibly conflicting memory accesses and only performing synchronization of these memory accesses, the synchronization cost can be reduced considerably. Since the function simulator is able to operate faster and to perform the same memory accesses, the possibly conflicting memory accesses can be identified by first executing the function simulator.
摘要翻译：公开了一种用于模拟多处理器系统的技术。本发明的方面基于这样的观察：大多数来自不同模拟处理器的存储器访问不冲突，因此用于执行所有存储器访问的同步的保守策略可能浪费大量的处理时间。通过识别可能存在冲突的存储器访问并且仅执行这些存储器访问的同步，可以显着地减少同步成本。由于功能模拟器能够更快地操作并执行相同的存储器访问，所以可以通过首先执行功能模拟器来识别可能冲突的存储器访问。

2. 发明授权

US5146590A Method for sorting using approximate key distribution in a distributed system 失效
标题翻译：使用分布式系统中的近似密钥分配进行排序的方法
公开(公告)号：US5146590A
公开(公告)日：1992-09-08
申请号：US830796
申请日：1992-02-05
申请人： Raymond A. Lorie , Honesty C. Young
发明人： Raymond A. Lorie , Honesty C. Young
IPC分类号： G06F7/24
CPC分类号： G06F7/24 , Y10S707/99937 , Y10S707/99939
摘要： A fast method for sorting data in a distributed data processing system is disclosed. Each processor P.sub.1 12i locally sorts its data into a local sorted file S.sub.i 34i, simultaneously producing an index to the sorted data and a file of key data records R' 32 each comprising a key value paired with the processor's identifier. Each processor produces a distribution table DT.sub.i 28i of its key values using the index, and sends the table to acoordinator processor 18 which merges the processors' tables into a global distribution table GST 30. The global distribution table assigns subranges of key values to the processors, and is broadcast back to them. Each processor then sends each paired key value and processor identifier to the processor assigned by the global distribution table to handle the subrange containing that key value. The processors receive and merge the incoming key data records simultaneously as they send such pairs to other processors. An output stream V.sub.i 36i consisting only of processor identifiers is created by each processor from the merged key value and processor identifier pairs, and is sent to the host H 16, which merges it into a global output stream of processor identifiers. The processors simultaneously send their local sorted files S.sub.i to the host, which reads records from them in the order specified by the global output stream V.
摘要翻译：公开了一种用于在分布式数据处理系统中分类数据的快速方法。每个处理器P112i将其数据本地排序为本地分类文件Si 34i，同时产生对排序数据的索引，以及每个包括与处理器的标识符配对的键值的密钥数据记录R'32的文件。每个处理器使用索引产生其密钥值的分布表DTi 28i，并将表发送到协处理器18，该处理器将将处理器的表合并到全局分布表GST30中。全局分布表将密钥值的子范围分配给处理器，并被广播回他们。然后，每个处理器将每个配对的键值和处理器标识符发送到由全局分布表分配的处理器，以处理包含该键值的子范围。当它们将这样的对发送到其他处理器时，处理器同时接收并合并传入的密钥数据记录。仅由处理器标识符组成的输出流Vi 36i由合并的密钥值和处理器标识符对由每个处理器创建，并被发送到主机H 16，主机H 16将其合并成处理器标识符的全局输出流。处理器同时将其本地排序的文件Si发送到主机，主机按照全局输出流V指定的顺序读取记录。

3. 发明授权

US08457943B2 System and method for simulating a multiprocessor system 失效
标题翻译：用于模拟多处理器系统的系统和方法
公开(公告)号：US08457943B2
公开(公告)日：2013-06-04
申请号：US12038589
申请日：2008-02-27
申请人： Huayong Wang , Kun Wang , Honesty C. Young
发明人： Huayong Wang , Kun Wang , Honesty C. Young
IPC分类号： G06F17/50
CPC分类号： G06F9/455
摘要： Techniques for simulating a multiprocessor system. Aspects of the present invention are based on such an observation that most memory accesses from different simulated processors do not conflict, and therefore the conservative policy for performing synchronization of all the memory accesses can waste a large amount of processing time. By identifying possibly conflicting memory accesses and only performing synchronization of these memory accesses, the synchronization cost can be reduced considerably. Since the function simulator is able to operate faster and to perform the same memory accesses, the possibly conflicting memory accesses can be identified by first executing the function simulator.
摘要翻译：用于模拟多处理器系统的技术。本发明的方面基于这样的观察：大多数来自不同模拟处理器的存储器访问不冲突，因此用于执行所有存储器访问的同步的保守策略可能浪费大量的处理时间。通过识别可能存在冲突的存储器访问并且仅执行这些存储器访问的同步，可以显着地减少同步成本。由于功能模拟器能够更快地操作并执行相同的存储器访问，所以可以通过首先执行功能模拟器来识别可能冲突的存储器访问。

4. 发明授权

US5845113A Method for external sorting in shared-nothing parallel architectures 失效
标题翻译：无共享平行架构中的外部排序方法
公开(公告)号：US5845113A
公开(公告)日：1998-12-01
申请号：US967594
申请日：1992-10-27
申请人： Arun N. Swami , Honesty C. Young
发明人： Arun N. Swami , Honesty C. Young
IPC分类号： G06F7/24 , G06F17/30 , G06F7/00 , G06F15/16
CPC分类号： G06F7/24 , Y10S707/99937
摘要： A system and method is provided for distributed relational databases for parallel sorting of a relation wherein the relation is a set of tuples to be sorted on multiple sort sites which completely decouples the return phase from the sort phase in order to eliminate the merge phase. The method involves selecting one coordinator site from any of the available logical sites, then generating and sorting a local sample on each of the available storage sites before sending the local random sample from each storage site to the designated coordinator site wherein the local random samples are merged to provide a single global sample. The coordinator site determines the global interval key values based on the global sample. The interval key values being determined such that each interval fits in a single sort site's main memory, wherein the tuples between two interval key values define the interval. The interval key values are sent to the various storage sites wherein each storage site scans its portion of the relation in order to determine for each tuple the assigned interval and its corresponding sort site before sending each tuple to the assigned sort site. At each sort site the tuples are stored in temporary files using a single temporary file for each interval whereafter repeating, for each interval on each sort site, the steps of reading an interval and performing an in-memory sort in any fashion of the interval read before sending the tuples of the sorted interval to the sink site.
摘要翻译：提供了一种用于分布式关系数据库的系统和方法，用于关系的并行排序，其中关系是要在多个分类位置上排序的一组元组，其将返回阶段与分类阶段完全分离以消除合并阶段。该方法包括从任何可用的逻辑站点选择一个协调站点，然后在将每个存储站点的本地随机样本发送到指定的协调器站点之前，在每个可用存储站点上生成和排序本地采样，其中本地随机样本是合并提供单个全球样本。协调器站点根据全局样本确定全局间隔键值。确定间隔键值，使得每个间隔适合于单个分类位置的主存储器，其中两个间隔键值之间的元组定义该间隔。间隔密钥值被发送到各个存储站点，其中每个存储站点扫描其关系的部分，以便在将每个元组发送到所分配的排序站点之前，为每个元组确定分配的间隔及其对应的排序位置。在每个排序站点上，每个间隔的元组都使用单个临时文件存储在临时文件中，之后重复每个排序站点上的每个间隔，以间隔读取的任何方式读取间隔和执行内存中排序的步骤在将排序间隔的元组发送到宿点之前。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式