-
公开(公告)号：US08095770B2
公开(公告)日：2012-01-10
申请号：US12437683
申请日：2009-05-08
IPC分类号： G06F12/00
CPC分类号： G06F12/109
摘要： The invention relates to mapping data to a process. A method of the invention includes receiving a request to copy a parent process, where the parent process is associated with a first virtual memory address space that includes a first mapping to a page of a file loaded into physical memory. The method includes creating a child process (of the parent process) associated with a second virtual memory address space. The method includes determining that a fork count is greater than a fork count threshold and a COW count to fork count ratio is greater than a threshold ratio. The fork count is associated with the file and the COW count is associated with the page. The method includes creating a copy of the page in physical memory and further includes creating a second mapping from the second virtual memory address space to the copy of the page.
摘要翻译： 本发明涉及将数据映射到过程。 本发明的方法包括接收复制父进程的请求，其中父进程与第一虚拟存储器地址空间相关联，第一虚拟存储器地址空间包括到加载到物理存储器中的文件的页面的第一映射。 该方法包括创建与第二虚拟存储器地址空间相关联的子进程（父进程）。 该方法包括确定叉计数大于叉计数阈值，并且COW计数到叉计数比率大于阈值比。 叉数与文件相关联，COW计数与页面相关联。 该方法包括在物理存储器中创建页面的副本，并且还包括创建从第二虚拟存储器地址空间到页面的副本的第二映射。
-
公开(公告)号：US20100287347A1
公开(公告)日：2010-11-11
申请号：US12437683
申请日：2009-05-08
CPC分类号： G06F12/109
摘要： The invention relates to mapping data to a process. A method of the invention includes receiving a request to copy a parent process, where the parent process is associated with a first virtual memory address space that includes a first mapping to a page of a file loaded into physical memory. The method includes creating a child process (of the parent process) associated with a second virtual memory address space. The method includes determining that a fork count is greater than a fork count threshold and a COW count to fork count ratio is greater than a threshold ratio. The fork count is associated with the file and the COW count is associated with the page. The method includes creating a copy of the page in physical memory and further includes creating a second mapping from the second virtual memory address space to the copy of the page.
摘要翻译： 本发明涉及将数据映射到过程。 本发明的方法包括接收复制父进程的请求，其中父进程与第一虚拟存储器地址空间相关联，第一虚拟存储器地址空间包括到加载到物理存储器中的文件的页面的第一映射。 该方法包括创建与第二虚拟存储器地址空间相关联的子进程（父进程）。 该方法包括确定叉计数大于叉计数阈值，并且COW计数到叉计数比率大于阈值比。 叉数与文件相关联，COW计数与页面相关联。 该方法包括在物理存储器中创建页面的副本，并且还包括创建从第二虚拟存储器地址空间到页面的副本的第二映射。
-
公开(公告)号：US20100283793A1
公开(公告)日：2010-11-11
申请号：US12437626
申请日：2009-05-08
申请人： George R. Cameron , Blake A. Jones , Kit M. Chow
发明人： George R. Cameron , Blake A. Jones , Kit M. Chow
IPC分类号： G09G5/02
CPC分类号： G06F12/084 , G06F12/0842
摘要： A method involving receiving an indication of a requirement to allocate at least one page for a process, where pages are associated with cache colors; generating a selection bitmap by performing a logical operation of a system available colors bitmap and a process bitmap, where the system available colors bitmap and the process bitmap each include one bit corresponding to each cache color, where each bit of the system available colors bitmap indicates whether a number of pages associated with a corresponding cache color that are available to be allocated is above a minimum threshold, and where each bit of the process bitmap indicates whether any pages associated with the corresponding cache color have been recently allocated for the process. The method also includes selecting, using the selection bitmap, a cache color; and allocating a page for the process, wherein the allocated page is associated with the selected cache color.
摘要翻译： 一种方法，该方法包括接收用于为进程分配至少一个页面的要求的指示，其中页面与高速缓存颜色相关联; 通过执行系统可用颜色位图和处理位图的逻辑操作来生成选择位图，其中系统可用颜色位图和处理位图各自包括与每个高速缓存颜色相对应的一个位，其中系统可用颜色位图的每个位指示 与可用于分配的对应高速缓存颜色相关联的多个页面是否高于最小阈值，并且其中处理位图的每个位指示是否已经最近为该处理分配了与对应的高速缓存颜色相关联的任何页面。 该方法还包括使用选择位图选择高速缓存颜色; 以及为所述处理分配页面，其中所分配的页面与所选择的高速缓存颜色相关联。
-
公开(公告)号：US20080189502A1
公开(公告)日：2008-08-07
申请号：US11670412
申请日：2007-02-01
申请人： Blake A. Jones , George R. Cameron , Eric E. Lowe
发明人： Blake A. Jones , George R. Cameron , Eric E. Lowe
IPC分类号： G06F12/00
CPC分类号： G06F12/023 , G06F9/5016 , G06F12/12 , G06F2209/504 , Y02D10/22
摘要： Managing physical memory for one or more processes with both a minimum and a maximum amount of physical memory. Memory sets are created, each specifying a number of credits. The total number of credits specified by all memory sets are equal to the total number of pages in physical memory. One or more processes are bound to a memory set. All of the processes bound to a memory set are collectively referred to as the workload of the memory set. Each physical page is accounted for to ensure that each workload can utilize at least the number of physical pages equaling the number of credits in its memory set. Additionally, a workload is permitted to use physical pages that are being explicitly shared by workloads of other memory sets. Accordingly, a workload with both a minimum and a maximum amount of physical memory is specified by its memory set.
摘要翻译： 管理具有最小和最大物理内存量的一个或多个进程的物理内存。 创建内存集，每个都指定一定数量的积分。 所有存储器集合指定的信用总数等于物理内存中的总页数。 一个或多个进程绑定到一个内存集。 绑定到存储器集合的所有进程统称为存储器集合的工作负载。 每个物理页面被考虑以确保每个工作负载可以利用至少等于其存储器组中的信用数量的物理页面的数量。 另外，允许工作负载使用由其他存储器集合的工作负载显式共享的物理页面。 因此，具有最小和最大物理存储量的工作负载由其存储器集指定。
-
公开(公告)号：US08930894B2
公开(公告)日：2015-01-06
申请号：US12247797
申请日：2008-10-08
CPC分类号： G06F17/30235 , G06F8/656 , G06F17/30067 , G06F17/30115 , G06F21/51 , G06F21/6218
摘要： A method for executing an executable file. The method includes executing instructions in the executable file by a first process, receiving a write request from a second process to write to the executable file, generating an anonymous file from the executable file in response to the write request, executing the anonymous file by the first process, and accessing the executable file by the second process.
摘要翻译： 一种用于执行可执行文件的方法。 该方法包括通过第一进程执行可执行文件中的指令，从第二进程接收写入请求以写入可执行文件，响应于写入请求从可执行文件生成匿名文件，执行匿名文件 第一进程，以及通过第二进程访问可执行文件。
-
公开(公告)号：US08274521B2
公开(公告)日：2012-09-25
申请号：US12437626
申请日：2009-05-08
申请人： George R. Cameron , Blake A. Jones , Kit M. Chow
发明人： George R. Cameron , Blake A. Jones , Kit M. Chow
IPC分类号： G09G5/36
CPC分类号： G06F12/084 , G06F12/0842
摘要： A method involving receiving an indication of a requirement to allocate at least one page for a process, where pages are associated with cache colors; generating a selection bitmap by performing a logical operation of a system available colors bitmap and a process bitmap, where the system available colors bitmap and the process bitmap each include one bit corresponding to each cache color, where each bit of the system available colors bitmap indicates whether a number of pages associated with a corresponding cache color that are available to be allocated is above a minimum threshold, and where each bit of the process bitmap indicates whether any pages associated with the corresponding cache color have been recently allocated for the process. The method also includes selecting, using the selection bitmap, a cache color; and allocating a page for the process, wherein the allocated page is associated with the selected cache color.
摘要翻译： 一种方法，该方法包括接收用于为进程分配至少一个页面的要求的指示，其中页面与高速缓存颜色相关联; 通过执行系统可用颜色位图和处理位图的逻辑操作来生成选择位图，其中系统可用颜色位图和处理位图各自包括与每个高速缓存颜色相对应的一个位，其中系统可用颜色位图的每个位指示 与可用于分配的对应高速缓存颜色相关联的多个页面是否高于最小阈值，并且其中处理位图的每个位指示是否已经最近为该处理分配了与对应的高速缓存颜色相关联的任何页面。 该方法还包括使用选择位图选择高速缓存颜色; 以及为所述处理分配页面，其中所分配的页面与所选择的高速缓存颜色相关联。
-
公开(公告)号：US08127295B1
公开(公告)日：2012-02-28
申请号：US11833907
申请日：2007-08-03
申请人： Blake A. Jones , George R. Cameron , Eric E. Lowe
发明人： Blake A. Jones , George R. Cameron , Eric E. Lowe
IPC分类号： G06F9/46
CPC分类号： G06F9/5011 , G06F2209/5011
摘要： A device, system, and method are directed towards managing limited resources in a computer system with multiple processing units. Each processing unit has a corresponding bucket. Each thread executing on a processing unit has a corresponding wallet. Buckets and wallets contain credits corresponding to units of the limited resource. When a request for the resource is made, mechanisms of the invention attempt to fulfill the request by looking in a local wallet, a local bucket, or non-local buckets. In a resource shortage situation, credits may be moved to a primary bucket. A load balancing mechanism may distribute credits among buckets, or move credits from wallets to buckets.
摘要翻译： 设备，系统和方法旨在管理具有多个处理单元的计算机系统中的有限资源。 每个处理单元都有相应的桶。 在处理单元上执行的每个线程具有相应的钱包。 桶和钱包包含对应于有限资源单位的信用额度。 当对资源进行请求时，本发明的机制尝试通过查看本地钱包，本地桶或非本地桶来满足请求。 在资源短缺情况下，信用额度可能会移动到主存储桶。 负载平衡机制可以在桶中分配信用，或将信用从钱包移动到桶。
-
公开(公告)号：US20100287356A1
公开(公告)日：2010-11-11
申请号：US12437628
申请日：2009-05-08
CPC分类号： G06F12/1027 , G06F12/1036 , G06F2212/652
摘要： A method for loading shared libraries. The method includes receiving an indication of a requirement to load the shared library into the virtual memory and determining that the shared library is a candidate for using shared large pages. Further, the method includes, in response to the determination, storing a text section of the shared library in a shared large page of the virtual memory and storing a data section of the shared library in a page of the virtual memory, where the virtual memory is mapped to a physical memory of the computer, where, within an address space of the virtual memory, a starting address of the text section of the shared library is separated from a starting address of the data section of the shared library by a predefined distance, and where the predefined distance is larger than a size of the large page.
摘要翻译： 一种加载共享库的方法。 该方法包括接收将共享库加载到虚拟存储器中并且确定共享库是使用共享大页面的候选者的要求的指示。 此外，该方法响应于确定，将共享库的文本部分存储在虚拟存储器的共享大页面中，并且将共享库的数据部分存储在虚拟存储器的页面中，其中虚拟存储器 被映射到计算机的物理存储器，其中在虚拟存储器的地址空间内，共享库的文本部分的起始地址与共享库的数据部分的起始地址以预定距离分开 ，并且其中预定距离大于大页面的大小。
-
公开(公告)号：US08095772B2
公开(公告)日：2012-01-10
申请号：US12437628
申请日：2009-05-08
IPC分类号： G06F12/10
CPC分类号： G06F12/1027 , G06F12/1036 , G06F2212/652
摘要： A method for loading shared libraries. The method includes receiving an indication of a requirement to load the shared library into the virtual memory and determining that the shared library is a candidate for using shared large pages. Further, the method includes, in response to the determination, storing a text section of the shared library in a shared large page of the virtual memory and storing a data section of the shared library in a page of the virtual memory, where the virtual memory is mapped to a physical memory of the computer, where, within an address space of the virtual memory, a starting address of the text section of the shared library is separated from a starting address of the data section of the shared library by a predefined distance, and where the predefined distance is larger than a size of the large page.
摘要翻译： 一种加载共享库的方法。 该方法包括接收将共享库加载到虚拟存储器中并且确定共享库是使用共享大页面的候选者的要求的指示。 此外，该方法响应于确定，将共享库的文本部分存储在虚拟存储器的共享大页面中，并且将共享库的数据部分存储在虚拟存储器的页面中，其中虚拟存储器 被映射到计算机的物理存储器，其中在虚拟存储器的地址空间内，共享库的文本部分的起始地址与共享库的数据部分的起始地址以预定距离分开 ，并且其中预定距离大于大页面的大小。
-
公开(公告)号：US07873801B2
公开(公告)日：2011-01-18
申请号：US11670412
申请日：2007-02-01
申请人： Blake A. Jones , George R. Cameron , Eric E. Lowe
发明人： Blake A. Jones , George R. Cameron , Eric E. Lowe
IPC分类号： G06F12/00
CPC分类号： G06F12/023 , G06F9/5016 , G06F12/12 , G06F2209/504 , Y02D10/22
摘要： Managing physical memory for one or more processes with both a minimum and a maximum amount of physical memory. Memory sets are created, each specifying a number of credits. The total number of credits specified by all memory sets are equal to the total number of pages in physical memory. One or more processes are bound to a memory set. All of the processes bound to a memory set are collectively referred to as the workload of the memory set. Each physical page is accounted for to ensure that each workload can utilize at least the number of physical pages equaling the number of credits in its memory set. Additionally, a workload is permitted to use physical pages that are being explicitly shared by workloads of other memory sets. Accordingly, a workload with both a minimum and a maximum amount of physical memory is specified by its memory set.
摘要翻译： 管理具有最小和最大物理内存量的一个或多个进程的物理内存。 创建内存集，每个都指定一定数量的积分。 所有存储器集合指定的信用总数等于物理内存中的总页数。 一个或多个进程绑定到一个内存集。 绑定到存储器集合的所有进程统称为存储器集合的工作负载。 每个物理页面被考虑以确保每个工作负载可以利用至少等于其存储器组中的信用数量的物理页面的数量。 另外，允许工作负载使用由其他存储器集合的工作负载显式共享的物理页面。 因此，具有最小和最大物理存储量的工作负载由其存储器集指定。
-
-
-
-
-
-
-
-
-
搜索结果
21 条记录 (耗时 0.021 秒)
