会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Common memory programming
    • 常用内存编程
    • US08438341B2
    • 2013-05-07
    • US12816588
    • 2010-06-16
    • Ulrich A. FinklerSteven N. HirschHarold E. Reindel
    • Ulrich A. FinklerSteven N. HirschHarold E. Reindel
    • G06F12/00
    • G06F9/544
    • A method for unidirectional communication between tasks includes providing a first task having access to an amount of virtual memory, blocking a communication channel portion of said first task's virtual memory, such that the first task cannot access said portion, providing a second task, having access to an amount of virtual memory equivalent to the first task's virtual memory, wherein a communication channel portion of the second task's virtual memory corresponding to the blocked portion of the first task's virtual memory is marked as writable, transferring the communication channel memory of the second task to the first task, and unblocking the communication channel memory of the first task.
    • 一种用于任务之间的单向通信的方法包括提供具有对一定量的虚拟存储器的访问的第一任务,阻止所述第一任务的虚拟存储器的通信信道部分,使得第一任务不能访问所述部分,提供第二任务, 涉及与第一任务的虚拟存储器相当的虚拟存储器的量,其中与第一任务的虚拟存储器的被阻止部分相对应的第二任务的虚拟存储器的通信信道部分被标记为可写,传送第二任务的通信信道存储器 到第一个任务,并解除第一个任务的通信通道存储器。
    • 2. 发明申请
    • COMMON MEMORY PROGRAMMING
    • 通用记忆编程
    • US20110314238A1
    • 2011-12-22
    • US12816588
    • 2010-06-16
    • Ulrich A. FinklerSteven N. HirschHarold E. Reindel
    • Ulrich A. FinklerSteven N. HirschHarold E. Reindel
    • G06F12/00G06F12/10G06F12/14G06F12/16
    • G06F9/544
    • A method for unidirectional communication between tasks includes providing a first task having access to an amount of virtual memory, blocking a communication channel portion of said first task's virtual memory, such that the first task cannot access said portion, providing a second task, having access to an amount of virtual memory equivalent to the first task's virtual memory, wherein a communication channel portion of the second task's virtual memory corresponding to the blocked portion of the first task's virtual memory is marked as writable, transferring the communication channel memory of the second task to the first task, and unblocking the communication channel memory of the first task.
    • 一种用于任务之间的单向通信的方法包括提供具有对一定量的虚拟存储器的访问的第一任务,阻止所述第一任务的虚拟存储器的通信信道部分,使得第一任务不能访问所述部分,提供第二任务, 涉及与第一任务的虚拟存储器相当的虚拟存储器的量,其中与第一任务的虚拟存储器的被阻止部分相对应的第二任务的虚拟存储器的通信信道部分被标记为可写,传送第二任务的通信信道存储器 到第一个任务,并解除第一个任务的通信通道存储器。
    • 6. 发明授权
    • Parallel intrusion search in hierarchical VLSI designs with substituting scan line
    • 在具有替代扫描线的分层VLSI设计中的并行入侵搜索
    • US08006207B2
    • 2011-08-23
    • US12198172
    • 2008-08-26
    • Ulrich A. Finkler
    • Ulrich A. Finkler
    • G06F17/50
    • G06F17/5081
    • Mechanisms are provided for performing intrusion searching of a hierarchical integrated circuit design. These mechanisms may receive the hierarchical integrated circuit design and perform a parallel intrusion search operation, that utilizes a substituting scan line, on the hierarchical integrated circuit design to identify intrusions of geometric objects in the hierarchical integrated circuit design. The mechanisms may further record intrusions of geometric objects in the hierarchical integrated circuit design identified by the parallel intrusion search operation. The parallel intrusion search operation may utilize a plurality of separate intrusion searches executed by the data processing system in parallel on the hierarchical integrated circuit design.
    • 提供了用于执行分级集成电路设计的入侵搜索的机制。 这些机制可以接收分级集成电路设计,并且在分层集成电路设计中执行使用替代扫描线的并行入侵搜索操作来识别分层集成电路设计中的几何对象的入侵。 这些机制可以进一步记录通过并行入侵搜索操作识别的分层集成电路设计中的几何对象的入侵。 并行入侵搜索操作可以在分层集成电路设计上并行地利用由数据处理系统执行的多个单独的入侵搜索。
    • 8. 发明授权
    • Asynchronous symmetric multiprocessing
    • 异步对称多处理
    • US07475198B2
    • 2009-01-06
    • US11873464
    • 2007-10-17
    • Ulrich A. Finkler
    • Ulrich A. Finkler
    • G06F13/14
    • G06F9/5016G06F12/0815G06F12/0828G06F2212/1032G06F2212/1048
    • An apparatus for serializing concurrent requests to multiple processors includes a signal merging tree structure and a traversal mechanism. The tree structure has a root node and leaf nodes for connecting a data consumer to the root. The tree structure serializes concurrent requests in the presence of race conditions, and connects each request producer from among the processors to a respective leaf node. The mechanism enables a producer to transmit a signal from a corresponding leaf node to the consumer at the root node by setting all nodes on a path from the leaf node to the root node to a Boolean true. The mechanism enables the consumer to trace signal submissions of the producers such that submission traversals by the producers and trace traversals by the consumer can be concurrently performed to allow data races between signal submissions by producers and between signal submissions by producers and the consumer.
    • 用于将并发请求串行化到多个处理器的装置包括信号合并树结构和遍历机制。 树结构具有用于将数据消费者连接到根的根节点和叶节点。 树状结构在存在竞争条件的情况下对并发请求进行了序列化,并将处理器中的每个请求生产者连接到相应的叶节点。 该机制使生产者能够通过将从叶节点到根节点的路径上的所有节点设置为布尔值true,将信号从相应的叶节点传送到根节点处的消费者。 该机制使得消费者能够跟踪生产者的信号提交,使得生产者的提交遍历和消费者的跟踪遍历可以同时执行,以允许生产者提供的信号提交和生产者和消费者的信号提交之间的数据竞赛。
    • 10. 发明申请
    • LAYOUT QUALITY EVALUATION
    • 布局质量评估
    • US20110289472A1
    • 2011-11-24
    • US12782926
    • 2010-05-19
    • Ulrich A. FinklerMark A. LavinAmith Singhee
    • Ulrich A. FinklerMark A. LavinAmith Singhee
    • G06F17/50
    • G06F17/5068
    • A method for quantifying and improving layout quality of an IC is disclosed. The method includes receiving a drawn layout and placing essentially one dimensional measurement markers (chords) at various location in the drawn layout. This placement is done in such manner that contours of shapes in the drawn layout intersect a chord in at least two places. The length of the chord is defined as its portion delimited by the intersections, and a measurement of the chord is defined as obtaining its length. The drawn layout is subjected, with the exception of the chords, to a patterning simulation at a selected processing point. Following the simulation the chords are measured and the obtained lengths associated with the drawn layout and the processing point. The patterning simulation may be carried out at a variety processing points and the chord lengths following each simulation are associated with the respective processing point. The sets of lengths obtained at the various processing points are used to quantitatively evaluate the layout quality, to improve the layout quality and tune the processing window.
    • 公开了一种量化和提高IC布局质量的方法。 该方法包括接收绘制的布局并且在绘制的布局中的各个位置放置基本上一维的测量标记(和弦)。 这种放置以这样的方式完成,使得绘制布局中的形状的轮廓在至少两个地方与弦并行。 弦的长度被定义为由交点限定的部分,并且弦的测量被定义为获得其长度。 除了和弦之外,绘制的布局受到所选处理点处的图案化模拟的影响。 在模拟之后,测量和弦并获得与绘制的布局和处理点相关联的长度。 图案化模拟可以在各种处理点处执行,并且每个模拟之后的弦长与相应的处理点相关联。 在各种处理点获得的长度集合用于定量评估布局质量,提高布局质量并调整处理窗口。