公开(公告)号：US20050278159A1

公开(公告)日：2005-12-15

申请号：US10868129

申请日：2004-06-15

Applicant: Ravi Krishnamurthy

Inventor： Ravi Krishnamurthy

IPC: G06F17/50

CPC classification number: G06F17/5045

Abstract: Systems, architectures, and data structures are described which are used to manage distributed design chains, specifically for domains in which data reside in multiple applications and are linked through complex interrelationships. The design chains or design networks integrated by the invention may include multiple companies in multiple sites collaborating to design and develop a new product. The invention is intended to integrate seamlessly and transparently with existing, diverse legacy applications, which include inter-linked data relevant to the design, thereby addressing the needs identified above.

公开(公告)号：US06754241B1

公开(公告)日：2004-06-22

申请号：US09478128

申请日：2000-01-05

Applicant: Ravi Krishnamurthy ,  Sriram Sethuraman ,  Xiaobing Lee ,  Tihao Chiang

Inventor： Ravi Krishnamurthy ,  Sriram Sethuraman ,  Xiaobing Lee ,  Tihao Chiang

IPC: H04J302

CPC classification number: H04N21/23655 ,  H04N19/115 ,  H04N19/14 ,  H04N19/15 ,  H04N19/152 ,  H04N19/159 ,  H04N19/172 ,  H04N19/177 ,  H04N19/179 ,  H04N19/42 ,  H04N19/61 ,  H04N21/2365 ,  H04N21/238 ,  H04N21/4347

Abstract: A PC-type computer has a system bus (e.g., a PCI bus) configured with a main CPU board, a statistical multiplexing (stat-mux) board, and a plurality of video/audio encoder boards, each configured to receive and compress a corresponding video/audio stream. The stat-mux board performs statistical multiplexing on the different compressed bitstreams to transmit multiple bitstreams over individual shared communication channels. Although each of the boards is configured to the system bus, each encoder board has a digital signal processor (DSP) with a synchronized serial interface (SSI) output port that is directly connected to an SSI input port on a DSP on the stat-mux board (which, in one embodiment, has four such DSPs each with six such SSI input ports). As such, (up to 24) compressed video/audio bitstreams generated on the various encoder boards can be transmitted directly to the stat-mux board without having to go through the system bus. In this way, the computer system can provide statistical multiplexing of low-latency video/audio bitstreams without having to suffer the processing delays associated with conventional transmission over PCI system buses.

Abstract translation: PC型计算机具有配置有主CPU板，统计复用（stat-mux）板和多个视频/音频编码器板的系统总线（例如，PCI总线），每个配置用于接收和压缩 相应的视频/音频流。 统计复用板对不同的压缩比特流执行统计复用，以在各个共享通信信道上传输多个比特流。 虽然每个板都配置为系统总线，但每个编码器板都有一个数字信号处理器（DSP），具有同步的串行接口（SSI）输出端口，它直接连接到数模转换器上的DSP上的SSI输入端口 板（在一个实施例中，具有四个这样的DSP，每个具有六个这样的SSI输入端口）。 因此，在各种编码器板上生成的（多达24个）压缩视频/音频比特流可以直接发送到统一复用板，而不必通过系统总线。 以这种方式，计算机系统可以提供低延迟视频/音频比特流的统计复用，而不必忍受与PCI系统总线上的常规传输相关联的处理延迟。

公开(公告)号：US06430317B1

公开(公告)日：2002-08-06

申请号：US09196072

申请日：1998-11-19

Applicant: Ravi Krishnamurthy ,  Sriram Sethuraman

Inventor： Ravi Krishnamurthy ,  Sriram Sethuraman

IPC: G06R936

CPC classification number: H04N19/537 ,  H04N19/43 ,  H04N19/523 ,  H04N19/527 ,  H04N19/53 ,  H04N19/533

Abstract: An apparatus and method for reducing memory resource requirements in, e.g., an image processing system by utilizing a packed data pixel representation and, optionally, M-ary pyramid decomposition, for pixel block or pixel group searching and matching operations.

Abstract translation: 一种用于通过利用打包数据像素表示以及可选地，对于金字塔分解进行像素块或像素组搜索和匹配操作来减少例如图像处理系统中的存储器资源需求的装置和方法。

公开(公告)号：US06263021B1

公开(公告)日：2001-07-17

申请号：US09262042

申请日：1999-03-04

Applicant: Sriram Sethuraman ,  Ravi Krishnamurthy

Inventor： Sriram Sethuraman ,  Ravi Krishnamurthy

IPC: H04N712

CPC classification number: H04N19/69 ,  G06T9/005 ,  H04N19/107 ,  H04N19/126 ,  H04N19/132 ,  H04N19/149 ,  H04N19/15 ,  H04N19/152 ,  H04N19/154 ,  H04N19/162 ,  H04N19/17 ,  H04N19/176 ,  H04N19/192 ,  H04N19/196 ,  H04N19/198 ,  H04N19/30 ,  H04N19/503 ,  H04N19/523 ,  H04N19/587 ,  H04N19/60 ,  H04N19/61 ,  H04N19/66 ,  H04N19/68 ,  H04N19/895

Abstract: During video coding, a transform such as a discrete cosine transform (DCT) is applied to blocks of image data (e.g., motion-compensated interframe pixel differences) and the resulting transform coefficients for each block are quantized at a specified quantization level. Notwithstanding the fact that some coefficients are quantized to non-zero values, at least one non-zero quantized coefficient is treated as if it had a value of zero for purposes of further processing (e.g., run-length encoding (RLE) the quantized data). When segmentation analysis is performed to identify two or more different regions of interest in each frame, the number of coefficients that are treated as having a value of zero for RLE is different for different regions of interest (e.g., more coefficients for less-important regions). In this way, the number of bits used to encode image data are reduced to satisfy bit rate requirements without (1) having to drop frames adaptively, while (2) conforming to constraints that may be imposed on the magnitude of change in quantization level from frame to frame.

Abstract translation: 在视频编码期间，将诸如离散余弦变换（DCT）的变换应用于图像数据块（例如，运动补偿帧间像素差异），并且以指定的量化级量对每个块的所得到的变换系数进行量化。 尽管有些系数被量化为非零值，但是为了进一步处理（例如，游程长度编码（RLE））量化数据，至少一个非零量化系数被视为具有零值 ）。 当执行分割分析以识别每个帧中的两个或更多个不同的感兴趣区域时，针对不同的感兴趣区域被视为具有值为零的RLE的系数的数量是不同的（例如，对于不太重要的区域，更多的系数 ）。 以这种方式，减少用于对图像数据进行编码的位数，以满足比特率要求，而不需要（1）必须自适应丢帧，而（2）符合可能对​​量化级别的变化幅度施加的约束 帧到帧

公开(公告)号：US09424315B2

公开(公告)日：2016-08-23

申请号：US12099076

申请日：2008-04-07

Applicant: Joseph I. Chamdani ,  Alan Beck ,  Hareesh Boinepelli ,  Jim Crowley ,  Ravi Krishnamurthy ,  Jeremy Branscome

Inventor： Joseph I. Chamdani ,  Alan Beck ,  Hareesh Boinepelli ,  Jim Crowley ,  Ravi Krishnamurthy ,  Jeremy Branscome

IPC: G06F17/30 ,  G06F9/48

CPC classification number: G06F17/30477 ,  G06F9/4881 ,  G06F17/30474 ,  G06F2209/484

Abstract: Embodiments of the present invention provide a run-time scheduler that schedules tasks for database queries on one or more execution resources in a dataflow fashion. In some embodiments, the run-time scheduler may comprise a task manager, a memory manager, and hardware resource manager. When a query is received by a host database management system, a query plan is created for that query. The query plan splits a query into various fragments. These fragments are further compiled into a directed acyclic graph of tasks. Unlike conventional scheduling, the dependency arc in the directed acyclic graph is based on page resources. Tasks may comprise machine code that may be executed by hardware to perform portions of the query. These tasks may also be performed in software or relate to I/O.

Abstract translation: 本发明的实施例提供一种运行时间调度器，其以数据流的方式调度对一个或多个执行资源的数据库查询的任务。 在一些实施例中，运行时调度器可以包括任务管理器，存储器管理器和硬件资源管理器。 当主机数据库管理系统接收到查询时，将为该查询创建一个查询计划。 查询计划将查询分割成各种片段。 这些片段进一步编译成任务的有向非循环图。 与常规调度不同，有向非循环图中的依赖弧基于页面资源。 任务可以包括可由硬件执行以执行查询的部分的机器代码。 这些任务也可以用软件执行或与I / O相关。

公开(公告)号：US09378231B2

公开(公告)日：2016-06-28

申请号：US13107399

申请日：2011-05-13

Applicant: Liuxi Yang ,  Kapil Surlaker ,  Ravi Krishnamurthy ,  Michael Corwin ,  Jeremy Branscome ,  Krishnan Meiyyappan ,  Joseph I. Chamdani

Inventor： Liuxi Yang ,  Kapil Surlaker ,  Ravi Krishnamurthy ,  Michael Corwin ,  Jeremy Branscome ,  Krishnan Meiyyappan ,  Joseph I. Chamdani

IPC: G06F17/30

CPC classification number: G06F17/30315

Abstract: Embodiments of the present invention provide one or more hardware-friendly data structures that enable efficient hardware acceleration of database operations. In particular, the present invention employs a column-store format for the database. In the database, column-groups are stored with implicit row ids (RIDs) and a RID-to-primary key column having both column-store and row-store benefits via column hopping and a heap structure for adding new data. Fixed-width column compression allow for easy hardware database processing directly on the compressed data. A global database virtual address space is utilized that allows for arithmetic derivation of any physical address of the data regardless of its location. A word compression dictionary with token compare and sort index is also provided to allow for efficient hardware-based searching of text. A tuple reconstruction process is provided as well that allows hardware to reconstruct a row by stitching together data from multiple column groups.

Abstract translation: 本发明的实施例提供了一个或多个能够有效地加速数据库操作的硬件友好的数据结构。 特别地，本发明采用数据库的列存储格式。 在数据库中，列组通过列跳转和用于添加新数据的堆结构存储隐式行ids（RID）和具有列存储和行存储优势的RID至主键列。 固定宽度列压缩允许直接对压缩数据进行硬件数据库处理。 使用全局数据库虚拟地址空间，允许对数据的任何物理地址的算术推导，而不管其位置如何。 还提供了具有令牌比较和排序索引的单词压缩字典，以允许对文本进行高效的基于硬件的搜索。 还提供了一个元组重建过程，允许硬件通过将来自多个列组的数据进行拼接来重建行。

公开(公告)号：US07966343B2

公开(公告)日：2011-06-21

申请号：US12099131

申请日：2008-04-07

Applicant: Liuxi Yang ,  Kapil Surlaker ,  Ravi Krishnamurthy ,  Michael Corwin ,  Jeremy Branscome ,  Krishnan Meiyyappan ,  Joseph I. Chamdani

Inventor： Liuxi Yang ,  Kapil Surlaker ,  Ravi Krishnamurthy ,  Michael Corwin ,  Jeremy Branscome ,  Krishnan Meiyyappan ,  Joseph I. Chamdani

IPC: G06F17/30

CPC classification number: G06F17/30315

Abstract: Embodiments of the present invention provide one or more hardware-friendly data structures that enable efficient hardware acceleration of database operations. In particular, the present invention employs a column-store format for the database. In the database, column-groups are stored with implicit row ids (RIDs) and a RID-to-primary key column having both column-store and row-store benefits via column hopping and a heap structure for adding new data. Fixed-width column compression allow for easy hardware database processing directly on the compressed data. A global database virtual address space is utilized that allows for arithmetic derivation of any physical address of the data regardless of its location. A word compression dictionary with token compare and sort index is also provided to allow for efficient hardware-based searching of text. A tuple reconstruction process is provided as well that allows hardware to reconstruct a row by stitching together data from multiple column groups.

Abstract translation: 本发明的实施例提供了一个或多个能够有效地加速数据库操作的硬件友好的数据结构。 特别地，本发明采用数据库的列存储格式。 在数据库中，列组通过列跳转和用于添加新数据的堆结构存储隐式行ids（RID）和具有列存储和行存储优势的RID至主键列。 固定宽度列压缩允许直接对压缩数据进行硬件数据库处理。 使用全局数据库虚拟地址空间，允许对数据的任何物理地址的算术推导，而不管其位置如何。 还提供了具有令牌比较和排序索引的单词压缩字典，以允许对文本进行高效的基于硬件的搜索。 还提供了一个元组重建过程，允许硬件通过将来自多个列组的数据进行拼接来重建行。

公开(公告)号：US07895151B2

公开(公告)日：2011-02-22

申请号：US12144303

申请日：2008-06-23

Applicant: James Shau ,  Krishnan Meiyyappan ,  Hung Tran ,  Ravi Krishnamurthy ,  Kapil Surlaker ,  Jeremy Branscome ,  Joseph I Chamdani

Inventor： James Shau ,  Krishnan Meiyyappan ,  Hung Tran ,  Ravi Krishnamurthy ,  Kapil Surlaker ,  Jeremy Branscome ,  Joseph I Chamdani

IPC: G06F17/30

CPC classification number: G06F17/30595

Abstract: Embodiments of the present invention provide for batch and incremental loading of data into a database. In the present invention, the loader infrastructure utilizes machine code database instructions and hardware acceleration to parallelize the load operations with the I/O operations. A large, hardware accelerator memory is used as staging cache for the load process. The load process also comprises an index profiling phase that enables balanced partitioning of the created indexes to allow for pipelined load. The online incremental loading process may also be performed while serving queries.

Abstract translation: 本发明的实施例提供数据批量和增量加载到数据库中。 在本发明中，装载机基础设施利用机器码数据库指令和硬件加速来将加载操作与I / O操作并行化。 大型的硬件加速器内存用作加载进程的分段缓存。 加载过程还包括一个索引分析阶段，可以对所创建的索引进行平衡分区，以允许流水线负载。 在提供查询时也可以执行在线增量加载过程。

公开(公告)号：US20090319486A1

公开(公告)日：2009-12-24

申请号：US12144486

申请日：2008-06-23

Applicant: Kapil Surlaker ,  Ravi Krishnamurthy ,  Krishnan Meiyyappan ,  Alan Beck ,  Hung Tran ,  Jeremy Branscome ,  Joseph I. Chamdani

Inventor： Kapil Surlaker ,  Ravi Krishnamurthy ,  Krishnan Meiyyappan ,  Alan Beck ,  Hung Tran ,  Jeremy Branscome ,  Joseph I. Chamdani

IPC: G06F7/06 ,  G06F17/30

CPC classification number: G06F17/30356 ,  G06F17/30551

Abstract: Embodiments of the present invention provide fine grain concurrency control for transactions in the presence of database updates. During operations, each transaction is assigned a snapshot version number or SVN. A SVN refers to a historical snapshot of the database that can be created periodically or on demand. Transactions are thus tied to a particular SVN, such as, when the transaction was created. Queries belonging to the transactions can access data that is consistent as of a point in time, for example, corresponding to the latest SVN when the transaction was created. At various times, data from the database stored in a memory can be updated using the snapshot data corresponding to a SVN. When a transaction is committed, a snapshot of the database with a new SVN is created based on the data modified by the transaction and the snapshot is synchronized to the memory. When a transaction query requires data from a version of the database corresponding to a SVN, the data in the memory may be synchronized with the snapshot data corresponding to that SVN.

Abstract translation: 在存在数据库更新的情况下，本发明的实施例为事务提供细粒度并行性控制。 在操作期间，为每个事务分配一个快照版本号或SVN。 SVN是指可以定期或按需创建的数据库的历史快照。 因此，事务与特定的SVN相关联，例如，当事务被创建时。 属于事务的查询可以访问一个时间点一致的数据，例如对应于创建事务时的最新SVN。 在不同时间，可以使用对应于SVN的快照数据来更新存储在存储器中的数据库的数据。 提交事务时，将根据事务修改的数据创建具有新SVN的数据库快照，并将快照与内存同步。 当事务查询需要来自与SVN对应的数据库的版本的数据时，存储器中的数据可以与对应于该SVN的快照数据同步。

公开(公告)号：US20090254774A1

公开(公告)日：2009-10-08

申请号：US12099076

申请日：2008-04-07

Applicant: Joseph I. Chamdani ,  Alan Beck ,  Hareesh Boinepelli ,  Jim Crowley ,  Ravi Krishnamurthy ,  Jeremy Branscome

Inventor： Joseph I. Chamdani ,  Alan Beck ,  Hareesh Boinepelli ,  Jim Crowley ,  Ravi Krishnamurthy ,  Jeremy Branscome

IPC: G06F11/07 ,  G06F9/455 ,  G06F12/10 ,  G06F12/00 ,  G06F17/30

CPC classification number: G06F17/30477 ,  G06F9/4881 ,  G06F17/30474 ,  G06F2209/484

Abstract: Embodiments of the present invention provide a run-time scheduler that schedules tasks for database queries on one or more execution resources in a dataflow fashion. In some embodiments, the run-time scheduler may comprise a task manager, a memory manager, and hardware resource manager. When a query is received by a host database management system, a query plan is created for that query. The query plan splits a query into various fragments. These fragments are further compiled into a directed acyclic graph of tasks. Unlike conventional scheduling, the dependency arc in the directed acyclic graph is based on page resources. Tasks may comprise machine code that may be executed by hardware to perform portions of the query. These tasks may also be performed in software or relate to I/O.

Abstract translation: 本发明的实施例提供一种运行时间调度器，其以数据流的方式调度对一个或多个执行资源的数据库查询的任务。 在一些实施例中，运行时调度器可以包括任务管理器，存储器管理器和硬件资源管理器。 当主机数据库管理系统接收到查询时，将为该查询创建一个查询计划。 查询计划将查询分割成各种片段。 这些片段进一步编译成任务的有向非循环图。 与常规调度不同，有向非循环图中的依赖弧基于页面资源。 任务可以包括可由硬件执行以执行查询的部分的机器代码。 这些任务也可以用软件执行或与I / O相关。