| Patent application number | Description | Published |
|---|
| 20090031317 | SCHEDULING THREADS IN MULTI-CORE SYSTEMS - Scheduling of threads in a multi-core system is performed using per-processor queues for each core to hold threads with fixed affinity for each core. Cores are configured to pick the highest priority thread among the global run queue, which holds threads without affinity, and their respective per-processor queue. To select between two threads with same priority on both queues, the threads are assigned sequence numbers based on their time of arrival. The sequence numbers may be weighted for either queue to prioritize one over the other. | 01-29-2009 |
| 20090031318 | APPLICATION COMPATIBILITY IN MULTI-CORE SYSTEMS - Scheduling of threads in a multi-core system running various legacy applications along with multi-core compatible applications is configured such that threads from older single thread applications are assigned fixed affinity. Threads from multi-thread/single core applications are scheduled such that one thread at a time is made available to the cores based on the thread priority preventing conflicts and increasing resource efficiency. Threads from multi-core compatible applications are handled regularly. | 01-29-2009 |
| 20090249436 | Centralized Enforcement of Name-Based Computer System Security Rules - This disclosure describes techniques of using a centralized rule database to control the abilities of software processes to perform actions with regard to resources provided by a computer. As described herein, each software process executing in a computer executes within a chamber and each resource provided by the computer is associated with a canonical name that uniquely identifies the resource. Furthermore, the computer stores a set of security rules in a centralized rule database. In addition, this disclosure describes techniques of enforcing the rules stored in the centralized rule database. | 10-01-2009 |
| 20090328180 | Granting Least Privilege Access For Computing Processes - Embodiments provide a security infrastructure that may be configured to run on top of an existing operating system to control what resources can be accessed by an applications and what APIs an application can call. Security decisions are made by taking into account both the current thread's identity and the current thread's call chain context to enable minimal privilege by default. The current thread context is captured and a copy of it is created to be used to perform security checks asynchronously. Every thread in the system has an associated identity. To obtain access to a particular resource, all the callers on the current thread are analyzed to make sure that each caller and thread has access to that resource. Only when each caller and thread has access to that resource is the caller given access to that resource. | 12-31-2009 |
| Patent application number | Description | Published |
|---|
| 20080301206 | Efficient Data Transfer To/From Storage Medium of Computing Device - An application issues an application command to a file system of the computing device, where the application command includes a location of data at a source. The file system allocates space on a medium for the data and compiles a list including an identification of each portion of the medium that is to be used to store the data. The file system then issues a file system command to a block driver of the medium, where the file system command includes the location of the data at the source and the compiled list. The block driver contacts the source, requests the data at the location thereof, and writes the data to the portions of the medium included in the compiled list. | 12-04-2008 |
| 20090259795 | POLICY FRAMEWORK TO TREAT DATA - Data can be retained upon a storage medium that has characteristics suitable for the data. However, as the storage mediums are used, time passes, etc., characteristics of memory can change and therefore data can reside upon an improper medium. Data can be dynamically moved from one storage location to another automatically and intelligently based upon a change in characteristics. In addition, new data can be placed on a storage medium based upon characteristics of the medium in a current state. | 10-15-2009 |
| 20090271563 | FLASH MEMORY TRANSACTIONING - Providing for improved transactioning for Flash memory is described herein. By way of example, transactioning operations associated with abstract data structures can be bundled into a common layer of a Flash management protocol stack, to reduce transaction redundancy at abstracted layers. In some aspects, the common layer can be a block level layer providing relatively direct access to low level Flash. Thus, a file system or database application, operating at a higher, abstracted layer of the Flash management protocol stack, can offload transactioning operations to a block level process that has access to underlying Flash memory. As a result, increased efficiency, throughput, and added flexibility can be achieved for storage system transactioning. | 10-29-2009 |
| 20100115006 | COMPUTING DEVICE WITH RELATIVELY LIMITED STORAGE SPACE AND OPERATING/FILE SYSTEM THEREOF - A computing device includes a storage device and a file system for storing and retrieving files on the storage device. The storage device includes storage space divided into sectors and the file system externally addresses the storage device on a per-sector basis, but internally divides each sector of the storage device into chunks and manages data within each sector on a per-chunk basis. Thus, the file system reads a chunk from or writes a chunk to the storage device by reading or writing the sector having the chunk. | 05-06-2010 |
