会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • STM with multiple global version counters
    • STM具有多个全局版本计数器
    • US08688921B2
    • 2014-04-01
    • US12396560
    • 2009-03-03
    • Yosseff Levanoni
    • Yosseff Levanoni
    • G06F12/00
    • G06F9/467
    • A software transactional memory system is provided with multiple global version counters. The system assigns an affinity to one of the global version counters for each thread that executes transactions. Each thread maintains a local copy of the global version counters for use in validating read accesses of transactions. Each thread uses a corresponding affinitized global version counter to store version numbers of write accesses of executed transactions. The system adaptively changes the affinities of threads when data conflict or global version counter conflict is detected between threads.
    • 软件事务内存系统提供有多个全局版本计数器。 系统为执行事务的每个线程分配一个全局版本计数器的关联。 每个线程都维护全局版本计数器的本地副本,以用于验证事务的读取访问。 每个线程使用相应的关联全局版本计数器来存储已执行事务的写入访问的版本号。 当在线程之间检测到数据冲突或全局版本计数器冲突时,系统自适应地改变线程的亲和性。
    • 5. 发明授权
    • Transforming addressing alignment during code generation
    • 在代码生成期间转换寻址对齐
    • US08539458B2
    • 2013-09-17
    • US13158077
    • 2011-06-10
    • Weirong ZhuYosseff Levanoni
    • Weirong ZhuYosseff Levanoni
    • G06F9/44G06F9/45G06F7/38G06F9/00
    • G06F8/44
    • The present invention extends to methods, systems, and computer program products for changing addressing mode during code generation. Generally, embodiments of the invention use a compiler transformation to transform lower level code from one address alignment to another address alignment. The transformation can be based upon assumptions of a source programming language. Based on the assumptions, the transformation can eliminate arithmetic operations that compensate for different addressing alignment, resulting in more efficient code. Some particular embodiments use a compiler transformation to transform an Intermediate Representation (“IR”) from one-byte addressing alignment into multi-byte (e.g., four-byte) addressing alignment.
    • 本发明扩展到用于在代码生成期间改变寻址模式的方法,系统和计算机程序产品。 通常,本发明的实施例使用编译器转换来将较低级别的代码从一个地址对齐转换到另一个地址对齐。 转换可以基于源程序设计语言的假设。 基于这些假设,转换可以消除补偿不同寻址对齐的算术运算,从而产生更有效的代码。 一些特定实施例使用编译器变换将中间表示(“IR”)从一字节寻址对准转换为多字节(例如,四字节)寻址对齐。
    • 7. 发明授权
    • Compressed transactional locks in object headers
    • 对象标题中的压缩事务​​锁
    • US08341133B2
    • 2012-12-25
    • US12163788
    • 2008-06-27
    • David L. DetlefsVinod K. GroverYosseff LevanoniMichael M. Magruder
    • David L. DetlefsVinod K. GroverYosseff LevanoniMichael M. Magruder
    • G06F7/00G06F17/00G06F13/00G06F13/28G06F15/16
    • G06F9/466
    • A software transactional memory system is provided that generates and stores compressed transactional locks in a portion of object headers. The software transactional memory system allocates preferred write log memory with a predefined size of memory that corresponds to a number of bits in the compressed transactional locks. The compressed transactional locks identify write log entries in corresponding write logs in the preferred write log memory. If the preferred write log memory becomes full, additional write log memory is allocated for write log entries and subsequent transactional locks are stored uncompressed in an auxiliary memory. A pointer that may be used to locate the uncompressed transactional lock is stored in the header. If an object header with a compressed transactional lock is needed for another use, the compressed transactional lock is uncompressed and stored in the auxiliary memory. A pointer that may be used to locate the uncompressed transactional lock is stored in the header.
    • 提供了一种软件事务存储器系统,其在对象头部的一部分中生成并存储压缩事务锁。 软件事务存储系统将优选的写日志存储器与对应于压缩事务锁中的多个位的预定义大小的存储器分配。 压缩事务锁在首选写入日志存储器中的相应写入日志中标识写入日志条目。 如果首选的写入日志内存已满,则会为写入日志条目分配额外的写入日志内存,而后续的事务锁存在未压缩的辅助存储器中。 可用于定位未压缩事务锁的指针存储在标题中。 如果需要具有压缩事务锁定的对象标头进行另一次使用,压缩事务锁将被解压缩并存储在辅助存储器中。 可用于定位未压缩事务锁的指针存储在标题中。
    • 8. 发明申请
    • RECONSTRUCTING PROGRAM CONTROL FLOW
    • 重新编制程序控制流程
    • US20120159458A1
    • 2012-06-21
    • US12972198
    • 2010-12-17
    • Yosseff LevanoniWeirong ZhuLingli ZhangJohn Lee RappAndrew L. Bliss
    • Yosseff LevanoniWeirong ZhuLingli ZhangJohn Lee RappAndrew L. Bliss
    • G06F9/45
    • G06F8/51G06F8/53
    • The present invention extends to methods, systems, and computer program products for reconstructing program control flow. Embodiments include implementing or morphing a control flow graph (“CFG”) into an arbitrary loop structure to reconstruct (preserve) control flow from original source code. Loop structures can be optimized and can adhere to target platform constraints. In some embodiments, C++ source code (a first higher level format) is translated into a CFG (a lower level format). The CFG is then translated into HLSL source code (a second different higher level format) for subsequent compilation into SLSL bytecode (that can then be executed at a Graphical Processing Unit (“GPU”)). The control flow from the C++ source code is preserved in the HLSL source code.
    • 本发明扩展到用于重建程序控制流的方法,系统和计算机程序产品。 实施例包括将控制流程图(“CFG”)实现或变形为任意循环结构,以重构(保留)来自原始源代码的控制流程。 循环结构可以进行优化,并可以遵守目标平台约束。 在一些实施例中,将C ++源代码(第一较高级格式)转换成CFG(较低级格式)。 然后将CFG转换为HLSL源代码(第二种不同的较高级别格式),以便后续编译成SLSL字节码(然后可以在图形处理单元(“GPU”)中执行)。 来自C ++源代码的控制流将保留在HLSL源代码中。