会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method and apparatus for dynamically sizing non-contiguous runtime stacks
    • 用于动态调整非连续运行时堆栈的方法和装置
    • US5835958A
    • 1998-11-10
    • US740445
    • 1996-10-29
    • Dean R. E. LongAlan G. BishopNedim Fresko
    • Dean R. E. LongAlan G. BishopNedim Fresko
    • G06F9/45G06F9/40G06F9/42G06F12/00
    • G06F9/4426G06F9/4425Y10S707/99953Y10S707/99956
    • A method, apparatus, and software for efficiently allocating discontiguous stack space without requiring compiler changes are described. In one aspect, a method is provided for executing a compiled function that is located in a first computer memory stack chunk such that additional memory is allocated efficiently if a determination is made that such additional memory is necessary for execution of the compiled function. In one embodiment, the method includes calling a stack checking function that includes the compiled function. A determination is made if additional memory is required for executing the compiled function. If no additional memory is required, then the compiled function is called and executed. However, if additional memory is necessary, then additional memory is allocated that is discontiguous with the original memory stack.
    • 描述用于有效地分配不连续栈空间而不需要编译器改变的方法,装置和软件。 在一个方面,提供了一种用于执行位于第一计算机存储器堆栈块中的编译功能的方法,使得如果确定这样的附加存储器对于编译的功能的执行是必需的,则附加存储器被有效地分配。 在一个实施例中,该方法包括调用包括编译功能的堆栈检查功能。 确定执行编译功能需要额外的内存。 如果不需要额外的内存,则调用并执行已编译的函数。 但是,如果需要额外的内存,则分配与原始内存堆栈不相关的附加内存。
    • 2. 发明授权
    • Method and apparatus for efficiently tracking monitors
    • 用于有效跟踪显示器的方法和装置
    • US06951018B2
    • 2005-09-27
    • US09802627
    • 2001-03-08
    • Dean R. E. LongNedim Fresko
    • Dean R. E. LongNedim Fresko
    • G06F9/46
    • G06F9/52Y10S707/99953Y10S707/99957
    • Methods and apparatus for enabling the association between a monitor and an object to be maintained when a garbage collection occurs during a wait action performed with respect to the object are disclosed. According to one aspect of the present invention, a method for acquiring access to an object in a multi-threaded, object-based system includes associating a monitor with the object, and setting a pointer from a thread, which is arranged to execute on the object, to the object. The method also includes setting a reference substantially directly from the thread to the monitor. In one embodiment, setting the reference includes setting a boolean reference count. In another embodiment, setting the reference enables a garbage collector to determine whether the monitor is suitable for reclamation during a garbage collection process.
    • 公开了在相对于对象执行的等待动作期间发生垃圾收集时能够使监视器和对象之间的关联的方法和装置。 根据本发明的一个方面,一种用于获取对多线程的基于对象的系统中的对象的访问的方法,包括将监视器与对象相关联,并且从线程设置指针,该指针被安排为 对象,对象。 该方法还包括将基准直接从线程设置到监视器。 在一个实施例中,设置参考包括设置布尔引用计数。 在另一个实施例中,设置参考使得垃圾收集器能够确定监视器是否适于在垃圾收集过程期间进行回收。
    • 3. 发明授权
    • Shared JAVA JAR files
    • 共享的JAVA JAR文件
    • US07882198B2
    • 2011-02-01
    • US11824850
    • 2007-07-02
    • Erez LandauDean R. E. LongNedim Fresko
    • Erez LandauDean R. E. LongNedim Fresko
    • G06F15/167G06F12/08
    • G06F9/44563
    • Techniques are disclosed for sharing programmatic modules among isolated virtual machines. A master JVM process loads data from a programmatic module, storing certain elements of that data into its private memory region, and storing other elements of that data into a “read-only” area of a shareable memory region. The master JVM process copies loaded data from its private memory region into a “read/write” area of the shareable memory region. Instead of re-loading the data from the programmatic module, other JVM processes map to the read-only area and also copy the loaded data from the read/write area into their own private memory regions. The private memory areas of all of the JVM processes begin at the same virtual memory address, so references between read-only data and copied data are preserved correctly. As a result, multiple JVM processes start up faster, and memory is conserved by avoiding the redundant storage of shareable data.
    • 公开了用于在隔离的虚拟机之间共享程序化模块的技术。 主JVM进程从编程模块加载数据,将该数据的某些元素存储到其专用存储器区域中,并将该数据的其他元素存储到可共享存储器区域的“只读”区域中。 主JVM进程将加载的数据从其专用存储器区域复制到可共享内存区域的“读/写”区域。 代替从编程模块重新加载数据,其他JVM进程映射到只读区域,并将加载的数据从读/写区域复制到自己的专用存储器区域中。 所有JVM进程的专用内存区域都从同一个虚拟内存地址开始,因此只读数据和复制的数据之间的引用被正确保存。 因此,多个JVM进程启动速度更快,并且通过避免可共享数据的冗余存储来节省内存。
    • 5. 发明申请
    • SHARED JAVA JAR FILES
    • 共享的JAVA JAR文件
    • US20110145358A1
    • 2011-06-16
    • US12974748
    • 2010-12-21
    • Erez LandauDean R. E. LongNedim Fresko
    • Erez LandauDean R. E. LongNedim Fresko
    • G06F15/167G06F12/08
    • G06F9/44563
    • Techniques are disclosed for sharing programmatic modules among isolated virtual machines. A master JVM process loads data from a programmatic module, storing certain elements of that data into its private memory region, and storing other elements of that data into a “read-only” area of a shareable memory region. The master JVM process copies loaded data from its private memory region into a “read/write” area of the shareable memory region. Instead of re-loading the data from the programmatic module, other JVM processes map to the read-only area and also copy the loaded data from the read/write area into their own private memory regions. The private memory areas of all of the JVM processes begin at the same virtual memory address, so references between read-only data and copied data are preserved correctly. As a result, multiple JVM processes start up faster, and memory is conserved by avoiding the redundant storage of shareable data.
    • 公开了用于在隔离的虚拟机之间共享程序化模块的技术。 主JVM进程从编程模块加载数据,将该数据的某些元素存储到其专用存储器区域中,并将该数据的其他元素存储到可共享存储器区域的“只读”区域中。 主JVM进程将加载的数据从其专用存储器区域复制到可共享内存区域的“读/写”区域。 代替从编程模块重新加载数据,其他JVM进程映射到只读区域,并将加载的数据从读/写区域复制到其自己的专用存储器区域中。 所有JVM进程的专用内存区域都从同一个虚拟内存地址开始,因此只读数据和复制的数据之间的引用被正确保存。 因此,多个JVM进程启动速度更快,并且通过避免可共享数据的冗余存储来节省内存。
    • 8. 发明授权
    • Mechanism for enabling multiple processes to share physical memory
    • 使多个进程共享物理内存的机制
    • US08255922B1
    • 2012-08-28
    • US11328965
    • 2006-01-09
    • Nedim FreskoJiangli ZhouDean R. E. Long
    • Nedim FreskoJiangli ZhouDean R. E. Long
    • G06F3/00G06F9/44G06F9/46G06F13/00G06F15/167
    • G06F9/544G06F9/45516
    • A mechanism is disclosed for enabling multiple processes to share the same portion of physical memory. The first time an instance of a process is executed, a list of common components is compiled. The compiled code is then written into a newly created mappable data structure, which is stored into persistent storage. The next time an instance of that process is executed, the mappable data structure is mapped into a portion of the process instance's virtual memory space. This enables the process instance to invoke the compiled code for the common components. Multiple instances of the process may have their virtual memory spaces mapped to the same mappable data structure in this way. Thereafter, it is up to the operating system to load the contents of the mappable data structure into a portion of physical memory, and to ensure that all of the process instances share that physical memory portion.
    • 公开了一种用于使多个进程共享物理存储器的相同部分的机制。 第一次执行进程实例时,会编译一个常用组件列表。 然后将编译的代码写入新创建的可映射数据结构,将其存储到永久存储器中。 下一次执行该进程的实例时,可映射数据结构被映射到进程实例的虚拟内存空间的一部分。 这使得流程实例可以调用公共组件的编译代码。 该过程的多个实例可能会以这种方式将其虚拟内存空间映射到相同的可映射数据结构。 此后,由操作系统将可映射数据结构的内容加载到物理内存的一部分中,并确保所有进程实例共享该物理内存部分。
    • 9. 发明授权
    • System and method for providing exceptional flow control in protected code through memory layers
    • 通过内存层在受保护的代码中提供卓越的流量控制的系统和方法
    • US07472383B2
    • 2008-12-30
    • US10918130
    • 2004-08-13
    • Dean R. E. LongNedim FreskoChristopher J. Plummer
    • Dean R. E. LongNedim FreskoChristopher J. Plummer
    • G06F9/45
    • G06F9/45504G06F11/3624G06F12/0269
    • A system and method for providing exceptional flow control in protected code through memory layers. Code is generated. The generated code includes a sequence of normal operations and is subject to protection against copying during execution of the generated code. The generated code is instantiated as a master process into a master layer in a memory space. The master process is cloned by instantiating a copy of the master process as a child layer in the memory space. Execution points within the generated code are identified. A copy of at least a portion of the generated code containing each execution point as an exception layer is instantiated in the memory space. The generated code in the exception layer is patched at each identified execution point with operations exceptional to the normal operations sequence and which are performed upon a triggering of each execution point during execution of the generated code.
    • 一种用于通过存储器层在受保护代码中提供异常流控制的系统和方法。 代码生成。 生成的代码包括正常操作的顺序,并且在执行生成的代码期间受到保护以防止复制。 将生成的代码作为主进程实例化为内存空间中的主层。 通过将主进程的副本实例化为内存空间中的子层来克隆主进程。 识别生成代码内的执行点。 将包含每个执行点的生成代码的至少一部分的副本作为异常层在内存空间中被实例化。 异常层中生成的代码在每个识别的执行点处被修补,其中操作与正常操作序列异常,并且在执行生成的代码期间触发每个执行点时执行。
    • 10. 发明授权
    • Method and apparatus for enabling threads to reach a consistent state without explicit thread suspension
    • 使线程达到一致状态而不显式线程暂停的方法和装置
    • US07086053B2
    • 2006-08-01
    • US09836931
    • 2001-04-17
    • Dean R. E. LongNedim Fresko
    • Dean R. E. LongNedim Fresko
    • G06F9/46G06F12/00
    • G06F9/52
    • Methods and apparatus for enabling inconsistent or unsafe threads to efficiently reach a consistent or safe state when a requesting thread requests a consistent state are disclosed. According to one aspect of the present invention, a method for requesting a consistent state in a multi-threaded computing environment using a first thread includes acquiring a consistent state lock using the first thread, and identifying substantially all threads in the environment that are inconsistent. The state of the inconsistent threads is altered to a consistent state, and the first thread is notified when the states of the previously inconsistent threads have been altered to be consistent. Once the first thread is notified, the first thread releases the consistent state lock. In one embodiment, the method also includes performing a garbage collection after releasing the consistent state lock using the first thread.
    • 公开了当请求线程请求一致状态时使不一致或不安全线程有效地达到一致或安全状态的方法和装置。 根据本发明的一个方面,使用第一线程在多线程计算环境中请求一致状态的方法包括使用第一线程获取一致的状态锁定,以及基本上识别环境中基本上不一致的线程。 不一致线程的状态被改变为一致的状态,并且当先前不一致的线程的状态被改变为一致时,通知第一线程。 一旦通知第一个线程,第一个线程释放一致的状态锁定。 在一个实施例中,该方法还包括在使用第一线程释放一致状态锁之后执行垃圾收集。