会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 94. 发明授权
    • Method and apparatus for providing protocol independent naming and life cycle services in an object-oriented system
    • 在面向对象系统中提供协议独立命名和生命周期服务的方法和装置
    • US07127724B2
    • 2006-10-24
    • US09244291
    • 1999-02-03
    • Stephen Lewallen
    • Stephen Lewallen
    • G06F9/00
    • G06F9/465G06F9/4493
    • A framework based Java naming and lifecycle services system includes a Moniker class which universally identifies an instance of any object model, whether the instance exists or not. Moniker objects instantiated from the Moniker class operate with a set of directory service classes and object adapters to create a directory service framework and a mechanism for connecting the directory service framework to existing directory services. A set of runtime classes provide “in process” services for objects. For example, the Moniker class is automatically substituted for a client reference when the underlying object instance is streamed or persisted. In accordance with one embodiment, life cycle services are provided by associating a predefined policy with each Moniker object, which policy specifies how and when life cycle services should be performed. Remote objects are then created or bound in accordance with these policies which eliminates the need for the client to directly incorporate life cycle services code into its logic.
    • 基于框架的Java命名和生命周期服务系统包括一个通用标识任何对象模型的实例的Moniker类,无论实例是否存在。 从Moniker类实例化的Moniker对象与一组目录服务类和对象适配器一起运行,以创建目录服务框架以及将目录服务框架连接到现有目录服务的机制。 一组运行时类为对象提供“进程中”服务。 例如,当底层对象实例被流式传输或持久化时,Moniker类将自动替换客户机引用。 根据一个实施例,通过将预定义策略与每个Moniker对象相关联来提供生命周期服务,该策略指定应该如何以及何时执行生命周期服务。 然后根据这些策略创建或绑定远程对象,这消除了客户端将生命周期服务代码直接结合到其逻辑中的需要。
    • 97. 发明授权
    • Better placement of objects promoted into a generation managed by the train algorithm
    • 更好地将对象的放置提升到由列车算法管理的一代
    • US07096329B2
    • 2006-08-22
    • US10375452
    • 2003-02-27
    • Alexander T. Garthwaite
    • Alexander T. Garthwaite
    • G06F12/00
    • G06F12/0276Y10S707/99953Y10S707/99957
    • In a garbage collector that more efficiently places newly promoted objects into a generation managed by the train algorithm, a promotion train is established near the oldest train and the objects are placed therein. If some objects are referenced from existing trains in the generation those objects are placed into those trains, and if any such objects are referenced from several existing trains, the objects are placed at the end of the youngest referencing train. The promotion train may be a new train that is placed, or a existing train that is selected, between the oldest train and the youngest train at a position based on the amount of memory compared to the size of a collection set. In the case of multiple collector threads, multiple cars in a promotion train or multiple promotion trains may be formed.
    • 在更有效地将新推进的对象放置在由列车算法管理的一代的垃圾收集器中,在最古老的列车附近建立一个升降机列,并将物体放在其中。 如果某些物体在生成中从现有列车中引用,则将这些物体放置在这些列车中,并且如果从几个现有列车引用了任何此类物体,则将物体放置在最小的引用列车的末尾。 升降机列车可以是根据与收集集的大小相比,基于记忆体量,在最早的火车和最年轻的列车之间放置的新列车或选择的现有列车。 在多个收集器线程的情况下,可以形成升级列车中的多个轿厢或多个促销列车。
    • 98. 发明授权
    • Space-efficient, depth-first parallel copying collection technique making use of work—stealing on the same structures that maintain the stack of items to be scanned
    • 空间效率,深度优先的并行复制收集技术,在同一结构上使用工作窃取,维护要扫描的物品的堆叠
    • US07092978B2
    • 2006-08-15
    • US10373147
    • 2003-02-24
    • Alexander T. Garthwaite
    • Alexander T. Garthwaite
    • G06F17/30
    • G06F12/0269Y10S707/99953Y10S707/99957
    • A copying-type garbage collector operates in multiple concurrent threads. Each thread evacuates potentially reachable objects from the from space to the to space in a depth-first manner: if a thread has evacuated an object containing references to any from-space objects, it evacuates all of that object's descendants before it evacuates any other reachable objects. To keep track of descendants that must be evacuated before non-descendants can be, the thread places objects containing references to non-evacuated objects into a linked list maintained by pointers that it installs in the from-space locations from which the objects on the list were evacuated. Additionally, it divides the to space into local-allocation buffers (“LABs”) to which respective threads exclusively evacuate objects, and each thread maintains a LAB stack representing all the LABs it has filled that still contain references to unevacuated from-space objects. When a thread has completed evacuating the descendants of evacuees in all of its LABs, it “steals” work from other threads. It may do so, for instance, by processing a reference in an object belonging to another thread's list, by transferring to its own list one or more objects from another thread's list, or by transferring to its own LAB stack one or more LABs from another thread's LAB stack.
    • 复制型垃圾收集器在多个并发线程中运行。 每个线程以深度优先的方式将潜在可达的对象从空间抽空到空间:如果线程已经抽空了包含对任何空间对象的引用的对象,则在撤销所有对象的后代之前,将其撤回所有其他可访问的对象 对象 为了跟踪在非后代之前必须撤离的后代,该线程将包含未撤离对象的引用的对象放置在由安装在列表中的对象的空间位置的指针所维护的链表中 被疏散。 此外,它将空间划分为本地分配缓冲区(“LAB”),各个线程专门排除对象,并且每个线程都维护一个LAB堆栈,代表其所填充的所有仍然包含对未完成的空间对象的引用的LAB。 当一个线程已完成撤离所有LAB中撤离人员的后代时,它从其他线程“窃取”工作。 它可以这样做,例如,通过处理属于另一个线程列表的对象中的引用,通过将自己的列表中的一个或多个对象从另一个线程的列表传输到其自身的LAB堆栈,从另一个线程列表中传递一个或多个LAB 线程的LAB堆栈。