会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Process-specific views of large frame pages with variable granularity
    • 具有可变粒度的大框架页面的特定于流程的视图
    • US09158701B2
    • 2015-10-13
    • US13541055
    • 2012-07-03
    • Ahmed GheithEric Van HensbergenJames Xenidis
    • Ahmed GheithEric Van HensbergenJames Xenidis
    • G06F12/00G06F12/10
    • G06F12/1009G06F12/109
    • The page tables in existing art are modified to allow virtual address resolution by mapping to multiple overlapping entries, and resolving a physical address from the most specific entry. This enables more efficient use of system resources by allowing smaller frames to shadow larger frames. A page table is selected. When a virtual address in a request corresponds to an entry in the page table, which identifies a next page table associated with the large frame, a determination is made that the virtual address corresponds to an entry in the next page table, the entry in the next page table referencing a small frame overlay for the large frame. The virtual address is mapped to a physical address in the small frame overlay using data of the entry in the next page table. The physical address in a process-specific view of the large frame is returned.
    • 现有技术中的页表被修改为允许通过映射到多个重叠条目来实现虚拟地址解析,并从最特定的条目解析物理地址。 通过允许较小的帧来遮蔽较大的帧,这样可以更有效地利用系统资源。 选择页表。 当请求中的虚拟地址对应于页表中的与大帧相关联的下一页表的条目时,确定虚拟地址对应于下一页表中的条目, 引用大帧的小帧覆盖的下一页表。 使用下一页表中条目的数据将虚拟地址映射到小帧覆盖中的物理地址。 返回大帧的进程特定视图中的物理地址。
    • 3. 发明申请
    • USING LARGE FRAME PAGES WITH VARIABLE GRANULARITY
    • 使用可变尺寸的大框架页
    • US20140013073A1
    • 2014-01-09
    • US13541055
    • 2012-07-03
    • Ahmed GheithEric Van HensbergenJames Xenidis
    • Ahmed GheithEric Van HensbergenJames Xenidis
    • G06F12/10
    • G06F12/1009G06F12/109
    • The page tables in existing art are modified to allow virtual address resolution by mapping to multiple overlapping entries, and resolving a physical address from the most specific entry. This enables more efficient use of system resources by allowing smaller frames to shadow larger frames. A page table is selected. When a virtual address in a request corresponds to an entry in the page table, which identifies a next page table associated with the large frame, a determination is made that the virtual address corresponds to an entry in the next page table, the entry in the next page table referencing a small frame overlay for the large frame. The virtual address is mapped to a physical address in the small frame overlay using data of the entry in the next page table. The physical address in a process-specific view of the large frame is returned.
    • 现有技术中的页表被修改为允许通过映射到多个重叠条目来实现虚拟地址解析,并从最特定的条目解析物理地址。 通过允许较小的帧来遮蔽较大的帧,这样可以更有效地利用系统资源。 选择页表。 当请求中的虚拟地址对应于页表中的与大帧相关联的下一页表的条目时,确定虚拟地址对应于下一页表中的条目, 引用大帧的小帧覆盖的下一页表。 使用下一页表中条目的数据将虚拟地址映射到小帧覆盖中的物理地址。 返回大帧的进程特定视图中的物理地址。
    • 9. 发明授权
    • System and method for virtualization of processor resources
    • 处理器资源虚拟化的系统和方法
    • US07290112B2
    • 2007-10-30
    • US10955093
    • 2004-09-30
    • Maximino Aguilar, Jr.Michael Norman DayMark Richard NutterJames Xenidis
    • Maximino Aguilar, Jr.Michael Norman DayMark Richard NutterJames Xenidis
    • G06F12/00
    • G06F12/109G06F12/0284G06F12/1045
    • A system and method for virtualization of processor resources is presented. A thread is created on a processor and the processor's local memory is mapped into an effective address space. In doing so, the processor's local memory is accessible by other processors, regardless of whether the processor is running. Additional threads create additional local memory mappings into the effective address space. The effective address space corresponds to either a physical local memory or a “soft” copy area. When the processor is running, a different processor may access data that is located in the first processor's local memory from the processor's local storage area. When the processor is not running, a softcopy of the processor's local memory is stored in a memory location (i.e. locked cache memory, pinned system memory, virtual memory, etc.) for other processors to continue accessing.
    • 提出了一种用于处理器资源虚拟化的系统和方法。 在处理器上创建线程,并将处理器的本地内存映射到有效的地址空间。 这样做,处理器的本地内存可以由其他处理器访问,无论处理器是否正在运行。 附加线程会在有效地址空间中创建额外的本地内存映射。 有效地址空间对应于物理本地存储器或“软”复制区域。 当处理器运行时,不同的处理器可以从处理器的本地存储区域访问位于第一处理器的本地存储器中的数据。 当处理器未运行时,处理器的本地存储器的软拷贝存储在其他处理器的存储器位置(即锁定的高速缓冲存储器,固定的系统存储器,虚拟存储器等)中以继续访问。
    • 10. 发明申请
    • System and method for grouping processors
    • 用于分组处理器的系统和方法
    • US20050081201A1
    • 2005-04-14
    • US10670833
    • 2003-09-25
    • Maximino AguilarMichael DayMark NutterJames Xenidis
    • Maximino AguilarMichael DayMark NutterJames Xenidis
    • G06F9/46G06F9/50
    • G06F9/5061G06F2209/5012
    • A system and method for grouping processors is presented. A processing unit (PU) initiates an application and identifies the application's requirements. The PU assigns one or more synergistic processing units (SPUs) and a memory space to the application in the form of a group. The application specifies whether the task requires shared memory or private memory. Shared memory is a memory space that is accessible by the SPUs and the PU. Private memory, however, is a memory space that is only accessible by the SPUs that are included in the group. When the application executes, the resources within the group are allocated to the application's execution thread. Each group has its own group properties, such as address space, policies (i.e. real-time, FIFO, run-to-completion, etc.) and priority (i.e. low or high). These group properties are used during thread execution to determine which groups take precedence over other tasks.
    • 提出了一种用于分组处理器的系统和方法。 处理单元(PU)启动应用程序并识别应用程序的要求。 PU以组的形式向应用分配一个或多个协同处理单元(SPU)和存储器空间。 应用程序指定任务是否需要共享内存或专用内存。 共享内存是可由SPU和PU访问的内存空间。 然而,专用内存是只能由组中包含的SPU访问的内存空间。 当应用程序执行时,组内的资源被分配给应用程序的执行线程。 每个组都有自己的组属性,如地址空间,策略(即实时,FIFO,运行完成等)和优先级(即低或高)。 在线程执行期间使用这些组属性来确定哪些组优先于其他任务。