-
公开(公告)号：US06598143B1
公开(公告)日：2003-07-22
申请号：US09513819
申请日：2000-02-24
IPC分类号： G06F1200
CPC分类号： G06F12/023 , G06F12/0292 , Y10S707/99953 , Y10S707/99957
摘要： Initially, data is copied from a disk to a page frame and then to a read buffer, for instance. Next, a check is made to determine whether the percent of real memory occupied by file pages is less than a preset maximum volume. If so, no space is allocated for additional file page and no page frames are returned to the free list. If not, the VMM selects the best candidate file pages in real memory and returns them to the free list. Ideal candidates are a thread's memory pages, from a thread doing sequential I/O the file system. In so doing, the page frames are added to the free list as soon as the I/O is complete.
摘要翻译： 最初，例如，数据从磁盘复制到页面帧，然后复制到读取缓冲区。 接下来，进行检查以确定文件页面占用的实际内存的百分比是否小于预设的最大音量。 如果是这样，没有为额外的文件页面分配空间，并且没有页面框架返回到空闲列表。 如果没有，则VMM将选择真实内存中的最佳候选文件页面并将其返回到空闲列表。 理想的候选人是一个线程的内存页面，从线程执行顺序I / O文件系统。 一旦I / O完成，就可以将页面框架添加到空闲列表中。
-
公开(公告)号：US20100287319A1
公开(公告)日：2010-11-11
申请号：US12436902
申请日：2009-05-07
IPC分类号： G06F13/22
CPC分类号： G06F9/505 , G06F11/302 , G06F11/3065 , G06F11/3089 , G06F2209/5019 , G06F2209/508
摘要： A method, system, and computer usable program product for adjusting processor utilization data in polling environments are provided in the illustrative embodiments. An amount of a computing resource consumed during polling performed by the polling application over a predetermined period is received at a processor in a data processing system from a polling application executing in the data processing system. The amount forms a polling amount of the computing resource. Using the polling amount of the computing resource, another amount of the computing resource consumed for performing meaningful task is determined. The other amount forms a work amount of the computing resource. Using the work amount of the computing resource, an adjusted utilization of the computing resource is computed over a utilization interval. The data of the adjusted utilization is saved.
摘要翻译： 在说明性实施例中提供了用于在轮询环境中调整处理器利用数据的方法，系统和计算机可用程序产品。 在数据处理系统中的处理器处，从在数据处理系统中执行的轮询应用程序接收在轮询应用程序执行的轮询预定期间消耗的计算资源量。 数量形成计算资源的轮询量。 使用计算资源的轮询量，确定用于执行有意义的任务所消耗的另一数量的计算资源。 其他数量形成计算资源的工作量。 使用计算资源的工作量，在利用间隔内计算计算资源的调整后的利用率。 保存调整后的利用率的数据。
-
公开(公告)号：US08589926B2
公开(公告)日：2013-11-19
申请号：US12436902
申请日：2009-05-07
IPC分类号： G06F9/46
CPC分类号： G06F9/505 , G06F11/302 , G06F11/3065 , G06F11/3089 , G06F2209/5019 , G06F2209/508
摘要： A method, system, and computer usable program product for adjusting processor utilization data in polling environments are provided in the illustrative embodiments. An amount of a computing resource consumed during polling performed by the polling application over a predetermined period is received at a processor in a data processing system from a polling application executing in the data processing system. The amount forms a polling amount of the computing resource. Using the polling amount of the computing resource, another amount of the computing resource consumed for performing meaningful task is determined. The other amount forms a work amount of the computing resource. Using the work amount of the computing resource, an adjusted utilization of the computing resource is computed over a utilization interval. The data of the adjusted utilization is saved.
摘要翻译： 在说明性实施例中提供了用于在轮询环境中调整处理器利用数据的方法，系统和计算机可用程序产品。 在数据处理系统中的处理器处，从在数据处理系统中执行的轮询应用程序接收在轮询应用程序执行的轮询预定期间消耗的计算资源量。 数量形成计算资源的轮询量。 使用计算资源的轮询量，确定用于执行有意义的任务所消耗的另一数量的计算资源。 其他数量形成计算资源的工作量。 使用计算资源的工作量，在利用间隔内计算计算资源的调整利用率。 保存调整后的利用率的数据。
-
公开(公告)号：US08230238B2
公开(公告)日：2012-07-24
申请号：US12197314
申请日：2008-08-25
申请人： Miriam Allalouf , Michael E. Factor , Ronen Itshak Kat , Lee Charles LaFrese , Dalit Naor , David Blair Whitworth
发明人： Miriam Allalouf , Michael E. Factor , Ronen Itshak Kat , Lee Charles LaFrese , Dalit Naor , David Blair Whitworth
CPC分类号： G06F1/32 , G06F1/3221 , G06F11/3428 , G06F11/3485 , G06F2201/88 , Y02D10/154 , Y02D10/34
摘要： A method for determining power consumption in a data storage system is provided. The method comprises determining data access patterns for at least a first storage device in a storage system based on operations performed by the first storage device; and calculating power consumption for the storage system by interpolating costs associated with the operations performed by the first storage device, wherein the cost associated with each operation is determined based on: (1) various levels of activities for the first storage device and a mix of workload characteristics, and (2) predetermined power consumption measurements obtained from one or more benchmarks for same operations performed by a second storage device in a test environment.
摘要翻译： 提供了一种用于确定数据存储系统中的功耗的方法。 该方法包括基于由第一存储设备执行的操作确定存储系统中的至少第一存储设备的数据访问模式; 以及通过内插与由所述第一存储设备执行的操作相关联的成本来计算所述存储系统的功耗，其中与每个操作相关联的成本基于：（1）第一存储设备的各种活动级别和 工作负载特征，以及（2）从测试环境中由第二存储设备执行的相同操作的一个或多个基准获得的预定功耗测量值。
-
公开(公告)号：US09733991B2
公开(公告)日：2017-08-15
申请号：US13616980
申请日：2012-09-14
申请人： Kevin John Ash , Michael Thomas Benhase , Lokesh Mohan Gupta , Kenneth Wayne Todd , David Blair Whitworth
发明人： Kevin John Ash , Michael Thomas Benhase , Lokesh Mohan Gupta , Kenneth Wayne Todd , David Blair Whitworth
IPC分类号： G06F12/12 , G06F9/52 , G06F12/0866 , G06F12/123 , G06F3/06
CPC分类号： G06F9/526 , G06F3/0659 , G06F12/0866 , G06F12/123
摘要： Data operations, requiring a lock, are batched into a set of operations to be performed on a per-core basis. A global lock for the set of operations is periodically acquired, the set of operations is performed, and the global lock is freed so as to avoid excessive duty cycling of lock and unlock operations in the computing storage environment.
-
6.发明申请METHOD TO RETAIN CRITICAL DATA IN A CACHE IN ORDER TO INCREASE APPLICATION PERFORMANCE 审中-公开在缓存中保留关键数据的方法可以提高应用程序性能公开(公告)号：US20080086599A1
公开(公告)日：2008-04-10
申请号：US11539894
申请日：2006-10-10
IPC分类号： G06F12/00
CPC分类号： G06F12/123 , G06F12/126
摘要： A computer implemented method, apparatus, and computer usable program code for managing data in a cache. Data in the cache is identified that has been designated by an application to form identified data. The identified data is aged in the cache at a slower rate than other data in the cache that is undesignated for slower aging in response to identifying the data in the cache.
摘要翻译： 用于管理高速缓存中的数据的计算机实现的方法，装置和计算机可用程序代码。 识别由应用程序指定以形成识别的数据的高速缓存中的数据。 响应于识别高速缓存中的数据，所识别的数据在缓存中以比未缓存的缓存老化的数据更慢的速率进行老化。
-
7.发明授权Method and apparatus for managing access contention to a linear list without the use of locks 有权用于在不使用锁的情况下管理对线性列表的访问争用的方法和装置公开(公告)号：US06651146B1
公开(公告)日：2003-11-18
申请号：US09513810
申请日：2000-02-24
IPC分类号： G06F1200
CPC分类号： G06F7/785 , G06F5/10 , G06F9/526 , G06F2205/064 , G06F2205/123 , Y10S707/99938
摘要： The present invention discloses a method of managing lists in a multiprocessor system without the use of locks that prevent contention for the list. List management in a linear list with a front and a back of the list has applications where it is desirable to manage the list in a Last In First Out (LIFO) and a First In First Out (FIFO) or a combination of LIFO and FIFO. LIFO and FIFO list management can be done by restrictively adding data elements to the front, back and removing data elements from the front of a managed list. At certain times there can be contention for a list and either locking routines are in place to prevent contention or some other method is used to guarantee data element integrity. The present invention discloses a set of operations that when used with certain protocols allow two or more processors to access a list as a LIFO or FIFO in a multiprocessor system without the use of locks.
摘要翻译： 本发明公开了一种在多处理器系统中管理列表的方法，而不使用防止列表竞争的锁。 具有列表前面和后面的线性列表中的列表管理具有应用程序，其中希望以先出先出（LIFO）和先进先出（FIFO）或LIFO和FIFO的组合来管理列表 。 LIFO和FIFO列表管理可以通过限制性地将数据元素添加到前端，后端和从托管列表的前面移除数据元素来完成。 在某些时候，可能会有一个列表的争用，并且锁定例程已经到位以防止争用，或者使用其他一些方法来保证数据元素的完整性。 本发明公开了一组操作，当与某些协议一起使用时，允许两个或多个处理器在不使用锁的情况下在多处理器系统中作为LIFO或FIFO访问列表。
-
公开(公告)号：US08719504B2
公开(公告)日：2014-05-06
申请号：US13616902
申请日：2012-09-14
CPC分类号： G06F12/0871 , G06F12/0804 , G06F12/0855 , G06F12/0866 , G06F12/0868 , G06F12/0877 , G06F13/4068 , G06F13/4221 , G06F2212/462 , G06F2212/603 , G06F2212/604
摘要： For a plurality of input/output (I/O) operations waiting to assemble complete data tracks from data segments, a process, separate from a process responsible for the data assembly into the complete data tracks, is initiated for waking a predetermined number of the waiting I/O operations. A total number of I/O operations to be awoken at each of an iterated instance of the waking is limited.
-
公开(公告)号：US08453122B2
公开(公告)日：2013-05-28
申请号：US12616005
申请日：2009-11-10
IPC分类号： G06F9/44
CPC分类号： G06F11/3636 , G06F11/3404 , G06F11/3409 , G06F11/3471 , G06F2201/865 , G06F2201/885
摘要： A symmetric multi-processor SMP system includes an SMP processor and operating system OS software that performs automatic SMP lock tracing analysis on an executing application program. System administrators, users or other entities initiate an automatic SMP lock tracing analysis. A particular thread of the executing application program requests and obtains a lock for a memory address pointer. A subsequent thread requests the same memory address pointer lock prior to the particular thread release of that lock. The subsequent thread begins to spin waiting for the release of that address pointer lock. When the subsequent thread reaches a predetermined maximum amount of wait time, MAXSPIN, a lock testing tool in the kernel of the OS detects the MAXSPIN condition. The OS performs a test to determine if the subsequent thread and address pointer lock meet the list of criteria set during initiation of the automatic lock trace method. The OS initiates an SMP lock trace capture automatically if all criteria or the arguments of the lock trace method are met. System administrators, software programmers, users or other entities interpret the results of the SMP lock tracing method that the OS stores in a trace table to determine performance improvements for the executing application program.
摘要翻译： 对称多处理器SMP系统包括一个SMP处理器和操作系统OS软件，对执行的应用程序执行自动SMP锁跟踪分析。 系统管理员，用户或其他实体启动自动SMP锁跟踪分析。 执行应用程序的特定线程请求并获得用于存储器地址指针的锁。 随后的线程在该锁的特定线程释放之前请求相同的内存地址指针锁。 随后的线程开始旋转等待释放该地址指针锁。 当后续线程达到预定的最大等待时间时，MAXSPIN，OS内核中的锁定测试工具将检测MAXSPIN条件。 OS执行测试以确定后续线程和地址指针锁是否符合在启动自动锁定跟踪方法期间设置的条件列表。 如果符合锁跟踪方法的所有条件或参数，OS将自动启动SMP锁跟踪捕获。 系统管理员，软件程序员，用户或其他实体解释OS存储在跟踪表中的SMP锁跟踪方法的结果，以确定执行的应用程序的性能改进。
-
公开(公告)号：US20100050008A1
公开(公告)日：2010-02-25
申请号：US12197314
申请日：2008-08-25
申请人： Miriam Allalouf , Michael E. Factor , Ronen Itshak Kat , Lee Charles LaFrese , Dalit Naor , David Blair Whitworth
发明人： Miriam Allalouf , Michael E. Factor , Ronen Itshak Kat , Lee Charles LaFrese , Dalit Naor , David Blair Whitworth
CPC分类号： G06F1/32 , G06F1/3221 , G06F11/3428 , G06F11/3485 , G06F2201/88 , Y02D10/154 , Y02D10/34
摘要： A method for determining power consumption in a data storage system is provided. The method comprises determining data access patterns for at least a first storage device in a storage system based on operations performed by the first storage device; and calculating power consumption for the storage system by interpolating costs associated with the operations performed by the first storage device, wherein the cost associated with each operation is determined based on: (1) various levels of activities for the first storage device and a mix of workload characteristics, and (2) predetermined power consumption measurements obtained from one or more benchmarks for same operations performed by a second storage device in a test environment.
摘要翻译： 提供了一种用于确定数据存储系统中的功耗的方法。 该方法包括基于由第一存储设备执行的操作确定存储系统中的至少第一存储设备的数据访问模式; 以及通过内插与由所述第一存储设备执行的操作相关联的成本来计算所述存储系统的功耗，其中与每个操作相关联的成本基于：（1）第一存储设备的各种活动级别和 工作负载特征，以及（2）从测试环境中由第二存储设备执行的相同操作的一个或多个基准获得的预定功耗测量值。
-
-
-
-
-
-
-
-
-
搜索结果
11 条记录 (耗时 0.025 秒)