Brent A. Kingsbury - Beaverton OR Corene Casper - Beaverton OR Phillip E. Krueger - Lake Oswego OR Paul E. McKenney - Beaverton OR
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 1202
US Classification:
711170, 711153, 711171, 711172, 711173
Abstract:
A method for a user process to specify a policy for allocating pages of physical memory on the nodes of a multinode multiprocessor computer system. Through means such as a system call, an application program can specify to the operating system that physical pages of memory for an application-specified portion of virtual address space are to be physically allocated upon a specified set of nodes, subject to the additional selection criteria that the pages are to be allocated at first reference upon: 1) the node upon which the reference first occurs; 2) the node which has the most free memory, or 3) that the pages should be evenly distributed across the indicated set of nodes. In effect, the operating system remembers the specified allocation policy and node set from which the physical pages can be subsequently allocated as established by a system call. Subsequent use of the virtual address space for which the allocation policy is defined results in the memory being allocated accordingly. In this way, an application program can use memory with the memory-locality most advantageous to it.
Using Hardware Counters To Estimate Cache Warmth For Process/Thread Schedulers
Paul E. McKenney - Beaverton OR Phillip E. Krueger - Lake Oswego OR
Assignee:
International Business Machines, Corporation - Armonk NY
International Classification:
G06F 1200
US Classification:
711118, 709102
Abstract:
A method and computer system for estimating cache warmth for thread schedulers in a processor of a multiprocessor system. A mathematical model based upon a Markov Model of queuing theory is used to determine flow probability. The method incorporates data received from cache counters to measure cache hits, cache misses, cache invalidations and cache roll-outs. Based upon the Model and the data received from the counters and the assumption that cache decays exponentially, a nominal lifetime of a cache line is computed and the state of the system is manipulated in accordance with the computed lifetime of the cache line. The method may be applied to either a two way LRU cache or a four way LRU cache for computing an average lifetime of a cache line. Accordingly, cache affinity and thread migration decisions are enhanced thereby providing an efficient method of operating a computer system.
Memory Allocator For A Multiprocessor Computer System
Paul E. McKenney - Beaverton OR Phillip E. Krueger - Lake Oswego OR Stuart A. Friedberg - Aloha OR Brent A. Kingsbury - Beaverton OR
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 900
US Classification:
718104, 709226, 709229, 710243, 711147
Abstract:
Methods for dynamically allocating memory in a multiprocessor computer system such as a non-uniform memory access (NUMA) machine having distributed shared memory. The methods include allocating memory by specified node, memory class, or memory pool in response to requests by the system (kernel memory allocation) or a user (application memory allocation). Through these methods memory is allocated more efficiently in a NUMA machine. For example, allocating memory on a specified node in a NUMA machine, such as the same node on which a process requiring the memory is running, reduces memory access time. Allocating memory from a specified memory class allows device drivers with restricted DMA ranges to operate with dynamically allocated memory. Other benefits of these methods include minimizing expensive remote-memory accesses using a distributed reference count mechanism and lock-free cache access.
System And Method For Synchronization For Enforcing Mutual Exclusion Among Multiple Negotiators
A system and method are disclosed for providing a synchronization mechanism for access to shared information. According to an embodiment of the present invention, a lock with more than one part can be obtained or leased by writing to the first part, writing to the second part, reading the first part to determine whether the first part reads what was written to it, and obtaining the lock if what is read is the same as what was written.
Memory Allocator For A Multiprocessor Computer System
Paul E. McKenney - Beaverton OR, US Phillip E. Krueger - Lake Oswego OR, US Stuart A. Friedberg - Aloha OR, US Brent A. Kingsbury - Beaverton OR, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 12/00
US Classification:
711147, 711148, 711153, 711170, 711171
Abstract:
Methods for dynamically allocating memory in a multiprocessor computer system such as a non-uniform memory access (NUMA) machine having distributed shared memory. The methods include allocating memory by specified node, memory class, or memory pool in response to requests by the system (kernel memory allocation) or a user (application memory allocation). Through these methods memory is allocated more efficiently in a NUMA machine. For example, allocating memory on a specified node in a NUMA machine, such as the same node on which a process requiring the memory is running, reduces memory access time. Allocating memory from a specified memory class allows device drivers with restricted DMA ranges to operate with dynamically allocated memory. Other benefits of these methods include minimizing expensive remote-memory accesses using a distributed reference count mechanism and lock-free cache access.
System And Method For Maintaining Solvency Within A Cache
Phillip E. Krueger - Portland OR, US Christopher August Shaffer - Portland OR, US
Assignee:
DELL PRODUCTS L.P. - Round Rock TX
International Classification:
G06F 15/167
US Classification:
709216
Abstract:
In one embodiment, a computing system includes a cache including one or more memories and a cache manager. The cache manager is able to determine an amount of accessible data for a portion of the cache associated with the cache manager; compare the amount of accessible data to a threshold value; determine, for one or more clients associated with the cache manager, an amount of releasable data if the amount of accessible data exceeds the threshold value; communicate, to one or more clients associated with the cache manager, the amount of releasable data for the client; receive from one or more clients associated with the cache manager information associated with data released by the one or more clients; and determine an amount of data released by the one or more clients associated with the cache manager.
Scott David Peterson - Beaverton OR, US Christopher August Shaffer - Portland OR, US Phillip E. Krueger - Portland OR, US
Assignee:
DELL PRODUCTS L.P. - Round Rock TX
International Classification:
G06F 12/08
US Classification:
711118, 711E12017
Abstract:
In one embodiment, a computing system includes a cache having one or more memories and a cache manager. The cache manager is able to receive a request to write data to a first portion of the cache, write the data to the first portion of the cache, update a first map corresponding to the first portion of the cache, receive a request to read data from the first portion of the cache, read from a storage communicatively linked to the computing system data according to the first map, and update a second map corresponding to the first portion of the cache. The cache manager may also be able to write data to the storage according to the first map.
System And Method For Data Redundancy Within A Cache
Scott David Peterson - Beaverton OR, US Phillip E. Krueger - Portland OR, US
Assignee:
DELL PRODUCTS L.P. - Round Rock TX
International Classification:
G06F 12/08
US Classification:
711123, 711E12024
Abstract:
In one embodiment, a computing system includes a cache and a cache manager. The cache manager is able to receive data, write the data to a first portion of the cache, write the data to a second portion of the cache, and delete the data from the second portion of the cache when the data in the first portion of the cache is flushed.
Discussing the risks posed by the pandemic, as well as the areas of opportunity in the region, Phillip Krueger, RSM South Africa, commented, In South Africa, the middle market has certainly been significantly impacted by the pandemic. In general, the economy contracted over the last couple of years
Date: Nov 22, 2022
Category: More news
Source: Google
Youtube
Dr. Philip Krueger | In the Life | TeamHealth
Dr. Philip Krueger's, Facility Medical Director, Orthopedic Surgery, t...
Duration:
2m 36s
The harsh truth about Nitrocellulose Lacquer
Win A Custom Zither Guitar Stand with KYG Logo Link to Instagram Thi...
Duration:
2h 15m 35s
Phillip Krueger Introduction
A lonely ginger sim beings his adventure. Can he be somebody before he...
Duration:
9m 53s
A Nightmare on Elm Street 3: Dream Warriors P...
I DON'T OWN THIS VIDEO***** This is a Nightmare on elm street 3 Philip...
Duration:
3m 18s
Nightmare on Elm Street Phillip
Clips of Phillip from the movie Nightmare on Elm Street 3.
Duration:
5m 9s
What's the difference Time Warp (V4) vs. Nick...
After a bit of study of the O.G. Sydney Bouldering guidebook and the o...