会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Basing computer memory allocation for aggregate data types on data separate from a type definition
    • 基于与类型定义分开的数据的聚合数据类型的计算机内存分配
    • US06996694B1
    • 2006-02-07
    • US10247889
    • 2002-09-19
    • Kannan Muthukkaruppan
    • Kannan Muthukkaruppan
    • G06F12/00
    • G06F12/023
    • A method and apparatus for allocating computer memory for an aggregate data type is provided, wherein that allocating is based on data that is separate from a type definition. According to one technique, an instruction to construct an instance of an aggregate data type is received. The aggregate data type (and therefore the instance) includes an attribute. It is determined, based on data called a “Constructor Descriptor”, whether memory for that attribute is to be allocated in-line or out-of-line. The Constructor Descriptor is separate from the type definition of the attribute. Memory for the attribute is allocated in-line or out-of-line depending on the determination made. Using this technique, memory allocation can be customized based on, for example, the system resources of a specific computer system. This technique is applicable, for example, to compilers and interpreters of object oriented or record oriented languages. In certain embodiments, the Constructor Descriptor may be used to incrementally construct or incrementally destroy instances of data types.
    • 提供了一种用于为聚合数据类型分配计算机存储器的方法和装置,其中该分配基于与类型定义分离的数据。 根据一种技术,接收构成聚合数据类型的实例的指令。 聚合数据类型(因此实例)包括一个属性。 根据称为“构造函数描述符”的数据,确定该属性的内存是否被分配为行内或外线。 构造函数描述符与属性的类型定义分开。 根据所做的确定,属性的内存被分配在行或行外。 使用这种技术,可以基于例如特定计算机系统的系统资源来定制内存分配。 此技术适用于例如面向对象或面向记录的语言的编译器和解释器。 在某些实施例中,可以使用构造器描述符来递增地构造或递增地破坏数据类型的实例。
    • 3. 发明授权
    • Compile time variable size paging of constant pools
    • 编译常量池的时间变量大小分页
    • US06275830B1
    • 2001-08-14
    • US09044507
    • 1998-03-18
    • Kannan MuthukkaruppanMurali VemulapatiShirish Puranik
    • Kannan MuthukkaruppanMurali VemulapatiShirish Puranik
    • G06F1730
    • G06F12/10G06F12/0238G06F2212/652Y10S707/99953
    • A method and apparatus for paging data in a computer system is provided. A set of data associated with a program unit is divided into pages such that no item of the set of data spans more than one page. The size of one page may vary from the size of another. When the program unit is compiled, metadata is generated that indicates the division of items into pages. At load time, a page mapping is generated based on the metadata. The page mapping is used to locate a item that belongs to the set of data. Other parts of the program unit, such as byte code, can contain references to items in the constant pool. Each reference specifies the number of the page in which the corresponding item will be stored at runtime, and the offset of that item within the page.
    • 提供了一种用于在计算机系统中寻呼数据的方法和装置。 与程序单元相关联的一组数据被分成页面,使得该组数据中的任何项目跨越多于一页。 一页的大小可能与另一页的大小不同。 当编译程序单元时,生成指示将项目划分为页面的元数据。 在加载时,基于元数据生成页面映射。 页面映射用于定位属于该数据集的项目。 程序单元的其他部分,如字节码,可以包含对常量池中项目的引用。 每个引用指定在运行时将存储相应项目的页面编号,以及页面中该项目的偏移量。
    • 4. 发明授权
    • Autonomous transactions in a database system
    • 数据库系统中的自治事务
    • US06219666B1
    • 2001-04-17
    • US09114340
    • 1998-07-13
    • Janaki KrishnaswamyKannan Muthukkaruppan
    • Janaki KrishnaswamyKannan Muthukkaruppan
    • G06F1730
    • G06K13/0825G06F8/443G06F9/466Y10S707/99938Y10S707/99944Y10S707/99953
    • A method is disclosed that involves establishing a transaction stack in a memory of a computing system that is processing transactions. Two commands, PUSH and POP, operate on the stack. The PUSH command causes a frame of data identifying the currently executing transaction to be pushed onto the transaction stack. After a PUSH is executed, the first transactional statement that executes causes creation of a new autonomous transaction. If another transactional statement is executed after the new transaction commits or rolls back, but before a POP is executed, then another new autonomous transaction is created. A POP operation restores the transaction identified by the top frame of the stack. In another aspect, a programming language construct is provided for associating a lexical scope with an autonomous transaction scope. When the lexical scope is first entered during execution of the program in a first transaction, the transaction context of the first transaction is stored on a transaction stack. The operations in the lexical scope are executed in one or more autonomous transactions. When the lexical scope is exited, the transaction context on the top of the transaction stack is restored as the current transaction context. The stack automatically keeps track of nested sequences of autonomous transactions. Further, deadlocks are rapidly detected.
    • 公开了一种涉及在正在处理事务的计算系统的存储器中建立事务栈的方法。 两个命令PUSH和POP在堆栈上操作。 PUSH命令使得将标识当前正在执行的事务的数据帧推送到事务栈上。 执行PUSH后,执行的第一个事务语句会导致创建一个新的自治事务。 如果在新事务提交或回滚之后但在执行POP之前执行另一个事务语句,则会创建另一个新的自治事务。 POP操作恢复由堆栈的顶部框架标识的事务。 在另一方面,提供了一种用于将词汇范围与自主事务范围相关联的编程语言结构。 当在第一个事务中执行程序期间首先输入词汇范围时,第一个事务的事务上下文存储在一个事务栈中。 词汇范围中的操作在一个或多个自主事务中执行。 当词法范围退出时,事务堆栈顶部的事务上下文将作为当前事务上下文进行还原。 堆栈自动跟踪嵌套的自治事务序列。 此外,快速检测到死锁。