会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Advancing cars in trains managed by a collector based on the train algorithm
    • 基于列车算法,在收集者管理的列车中推进汽车
    • US07085790B2
    • 2006-08-01
    • US10313476
    • 2002-12-06
    • Alexander T. Garthwaite
    • Alexander T. Garthwaite
    • G06F12/00G06F17/30
    • G06F12/0276Y10S707/99953Y10S707/99957
    • In a garbage collector that employs the train algorithm, the collector identifies cars that are located far back in the collection order but already have large remembered sets, and it advances their collection. One way of doing so includes advancing a car's nominal position in the collection order, placing it nominally ahead of erstwhile “older” cars as well as actually. Another way does not include changing the advanced car's nominal position. The advancement operation is simpler with the latter approach, but normal updating is simpler with the former. Although both approaches tend to increase the number of entries in the remembered set of the car thus advanced, they actually reduce the overall memory cost of remembered-set maintenance.
    • 在使用列车算法的垃圾收集器中,收集器识别位于收集顺序远的位置的汽车,但已经具有大的记忆集,并且它们提前收集。 这样做的一种方法包括提高汽车在收货秩序中的名义头寸,将其名义上超前于以前的“老”车以及实际上。 另一种方式不包括改变先进车的名义位置。 前面的操作比较简单,但前者更为简单。 虽然这两种方法都倾向于增加记忆集合中的条目数量,因此,它们实际上降低了记忆集维护的整体内存成本。
    • 5. 发明授权
    • Efficient collocation of evacuated objects in a copying garbage collector using variably filled local allocation buffers
    • 使用可变填充的本地分配缓冲区在复制垃圾收集器中有效地排列撤离对象
    • US07069281B2
    • 2006-06-27
    • US10372890
    • 2003-02-24
    • Alexander T. Garthwaite
    • Alexander T. Garthwaite
    • G06F17/30
    • G06F12/0276G06F9/4493G06F12/0253Y10S707/99953Y10S707/99957
    • A copying garbage collector evacuates to a to space the objects in a from space that are referred to by references, including references in previously evacuated objects, that are located outside the from space. It divides the to space into local-allocation buffers (“LABs”), and it adopts one of these as a destination LAB, i.e., as the LAB into which it places the objects that it evacuates. When a destination LAB becomes full, the thread adopts a new LAB as its destination LAB. When a destination LAB's contents fill it to some predetermined fill threshold, that destination LAB becomes the source LAB, i.e., the LAB that the collector scans for references to the collection-set objects. If a previous source LAB's contents has not yet been completely scanned when the collector thus adopts a new source LAB, the previous source LAB is placed on a LAB stack. When no more references to unevacuated collection-set objects remain in its current source LAB, the collector then pops a LAB from its LAB stack on a last-in, first-out basis and adopts that LAB as the source LAB.
    • 复制垃圾收集器撤离到空间中的对象,该对象在引用的参考空间中,包括位于空间外部的先前抽空物体中的引用。 它将空间划分为本地分配缓冲区(“LAB”),并将它们中的一个作为目的地LAB,即作为其放置对象的LAB作为LAB。 当目的地LAB变满时,线程采用新的LAB作为其目的地LAB。 当目的地LAB的内容将其填充到某个预定的填充阈值时,该目的地LAB成为源LAB,即收集者扫描对集合集对象的引用的LAB。 如果当收集器采用新的源LAB时,以前的源LAB的内容尚未被完全扫描,则先前的源LAB被放置在LAB堆栈上。 当没有更多的对未完成的集合集对象的引用仍保留在其当前的源LAB中时,收集器然后以先前先出的方式从其LAB堆栈中弹出LAB,并采用该LAB作为源LAB。
    • 7. 发明授权
    • Parallel non-contiguous allocation and card parsing
    • 并行非连续分配和卡解析
    • US07043509B2
    • 2006-05-09
    • US10368970
    • 2003-02-19
    • David L. Detlefs
    • David L. Detlefs
    • G06F17/30
    • G06F12/0276Y10S707/99957
    • A garbage collector operates in multiple threads, and one thread can be parsing a region containing a free block while another thread is allocating space from that free block for an object being relocated to that region. The object being relocated may be an array object, for which the length determination is based on more than one word in the object; it may be based on a class-identifying word and a number-of-elements word. To prevent a parsing thread from parsing erroneously by reading both of those words between the relocating thread's writing one of them and writing the other, the relocating thread first writes into the classifying word a distinguished value from which a parsing thread can conclude that the values it reads in other fields of the block are not to be trusted. The relocating thread then completes writing the other fields before it writes the relocated object's classifying word, and any parsing thread repeats the size-determining routine until the uninitialized value is removed and it can therefore rely on other values in the block.
    • 垃圾收集器在多个线程中运行,一个线程可以解析包含空闲块的区域,而另一个线程从被重新定位到该区域的对象的空闲块分配空间。 重新定位的对象可以是数组对象,其长度确定基于对象中的多于一个字; 它可以基于类识别词和元数字词。 为了防止解析线程通过读取重定位线程写入其中一个并写入另一个之间的这两个字来解析错误,首先将重定位线程写入分类词中,分析线程可以从中解析出线程可以断定其值 对块的其他字段的读取不被信任。 然后,重定位线程在写入重定位对象的分类字之前完成写入其他字段,并且任何解析线程重复大小确定例程,直到未初始化的值被移除,并且因此可以依赖该块中的其他值。
    • 8. 发明授权
    • Combining entries in a card object table
    • 组合卡对象表中的条目
    • US07039664B2
    • 2006-05-02
    • US10309909
    • 2002-12-04
    • Alexander T. Garthwaite
    • Alexander T. Garthwaite
    • G06F17/30
    • G06F12/0276Y10S707/955Y10S707/968Y10S707/99957
    • A garbage collector divides the garbage-collected heap into “cards.” It maintains a table containing a card-object table entry for each card. A card's entry contains information from which the collector can determine where any references in the card are located and thereby identify objects that may be reachable. Specifically, although each entry is smaller than a memory address, it has enough possible values to give the relative location of the object in which the associated card begins or to direct the collector to another entry for that information. But the entries are additionally grouped into sequences of contiguous entries that together are large enough to contain a complete address. When every card associated with a entry in a given (address-sized) entry sequence begins in the same object, that entry sequence is together given a value that the collector can recognize as indicating that object's absolute location.
    • 垃圾收集器将垃圾收集堆分成“卡”。 它维护一个包含每个卡的卡对象表条目的表。 卡的条目包含收集者可以确定卡中的任何引用位置的信息,从而识别可达到的对象。 具体来说,虽然每个条目都小于存储器地址,但是它具有足够的可能值来给出相关卡开始的对象的相对位置,或将收集器引导到该信息的另一条目。 但是条目另外被分组成连续条目的序列,其一起足够大以包含完整的地址。 当与给定(地址大小)条目序列中的条目相关联的每个卡片都在同一对象中开始时,该条目序列一起给出了收集器可以识别为指示对象的绝对位置的值。
    • 10. 发明授权
    • Method and apparatus for reordering data items
    • 重新排序数据项的方法和装置
    • US07017118B1
    • 2006-03-21
    • US09752337
    • 2000-12-29
    • Michael E. Carroll
    • Michael E. Carroll
    • G06F3/00
    • G06F3/0481
    • A swapping utility enables directional commands from a graphic user interface and/or keyboard to be utilized to swap data items associated with lists, tables or other series of data items. Upon receipt of both a directional command, e.g. up, down, left, or right, and a swap command, the utility uses the current position of the cursor or a selected entity to identify a first data item to be swapped and the relative direction thereto to identify a second, adjacent data item to be swapped. If both identified data items are of the same data type, their respective contents are exchanged within the ordered list or table without the need to cut and paste the content. In alternative embodiments, multiple adjacent data items may be swapped, or, in an embodiment which utilizes multiple selection icons, single or multiple nonadjacent entities may be directly swapped.
    • 交换实用程序使得来自图形用户界面和/或键盘的定向命令可用于交换与列表,表或其他一系列数据项相关联的数据项。 一旦接收到方向命令,例如 上,下,左或右,以及交换命令,该实用程序使用光标或所选实体的当前位置来识别要交换的第一数据项及其相对方向,以识别第二相邻数据项 被交换 如果两个识别的数据项都是相同的数据类型,则它们各自的内容在有序列表或表中交换,而不需要剪切和粘贴内容。 在替代实施例中,可以交换多个相邻数据项,或者在利用多个选择图标的实施例中,可以直接交换单个或多个不相邻的实体。