| Patent application number | Description | Published |
|---|
| 20080209327 | Persistent spatial collaboration - Persistent, spatial collaboration on the web supports a free-form, user-intuitive approach to a variety of projects and activities. Users can place differing object types at any time any where on a web page and/or the system can automatically, and with no user effort, affect object placement based on one or more meta data characteristics. A user can, in real-time, see changes made by another user to a web page, and, if desired, react accordingly, enabling true collaboration even if the various users are at remote locations. The flexibility of the methodology and system provides a platform for users to engage in projects and activities in a manner and environment suited to the users' mind sets, creativity, and natural proclivities. | 08-28-2008 |
| 20080320300 | Authorisation and Authentication - The invention relates to content distribution over a network and provides methods of controlling the distribution, of receiving the content and of publishing content. The method of controlling distribution of content over a network includes receiving a content description and location information for a source of the content from a publisher, where the content description comprises authorisation details associated with the publisher. The validity of the authorisation details is checked and if found to be valid, the content description is provided to a node in the network | 12-25-2008 |
| 20090138486 | Secure Content Descriptions - The invention describes a control node for a content distribution network and a method of automatically verifying content distributed over a network at a node in the network. In the method, a content description is received which comprises a content identifier, a publisher identifier, publisher authorisation information and content checking information. The integrity and validity of this information are checked and if both the checks are passed, the content description is stored. | 05-28-2009 |
| 20090265473 | Topology Management in Peer-to-Peer Content Distribution Clouds - A topology management process is implemented in peer-to-peer content distribution clouds using tracker nodes. Tracker nodes have information about available peers and assist peers in finding other peers to connect to. Various algorithms for use at the tracker nodes are described for selecting which peers to return as potentials for forming connections to. In addition, architectures and algorithms to allow efficient scaling of tracker nodes in peer-to-peer clouds are described. | 10-22-2009 |
| 20110209185 | MEDIA CONTENT CATALOG SERVICE - Aggregating media content catalog data from a plurality of content providers. The catalog data is merged according to rules and provided to a user on a scheduled basis or on demand. In an embodiment, the merged catalog data represents an incremental update to previously delivered catalog data. | 08-25-2011 |
| Patent application number | Description | Published |
|---|
| 20080235457 | Dynamic quality of service (QoS) for a shared cache - In one embodiment, the present invention includes a method for associating a first priority indicator with data stored in a first entry of a shared cache memory by a core to indicate a priority level of a first thread, and associating a second priority indicator with data stored in a second entry of the shared cache memory by a graphics engine to indicate a priority level of a second thread. Other embodiments are described and claimed. | 09-25-2008 |
| 20080244587 | Thread scheduling on multiprocessor systems - A thread scheduler may be used in a chip multiprocessor or symmetric multiprocessor system to schedule threads to processors. The scheduler may determine the bandwidth utilization of the two threads in combination and whether that utilization exceeds the threshold value. If so, the threads may be scheduled on different processor clusters that do not have the same paths between the common memory and the processors. If not, then the threads may be allocated on the same processor cluster that shares cache among processors. | 10-02-2008 |
| 20090328047 | DEVICE, SYSTEM, AND METHOD OF EXECUTING MULTITHREADED APPLICATIONS - Device, system, and method of executing multithreaded applications. Some embodiments include a task scheduler to receive application information related to one or more parameters of at least one multithreaded application to be executed by a multi-core processor including a plurality of cores and, based on the application information and based on architecture information related to an arrangement of the plurality of cores, to assign one or more tasks of the multithreaded application to one or more cores of the plurality of cores. Other embodiments are described and claimed. | 12-31-2009 |
| 20100138609 | Technique for controlling computing resources - A technique to enable resource allocation optimization within a computer system. In one embodiment, a gradient partition algorithm (GPA) module is used to continually measure performance and adjust allocation to shared resources among a plurality of data classes in order to achieve optimal performance. | 06-03-2010 |
| 20110145501 | CACHE SPILL MANAGEMENT TECHNIQUES - An apparatus and method is described herein for intelligently spilling cache lines. Usefulness of cache lines previously spilled from a source cache is learned, such that later evictions of useful cache lines from a source cache are intelligently selected for spill. Furthermore, another learning mechanism—cache spill prediction—may be implemented separately or in conjunction with usefulness prediction. The cache spill prediction is capable of learning the effectiveness of remote caches at holding spilled cache lines for the source cache. As a result, cache lines are capable of being intelligently selected for spill and intelligently distributed among remote caches based on the effectiveness of each remote cache in holding spilled cache lines for the source cache. | 06-16-2011 |
| 20120124587 | THREAD SCHEDULING ON MULTIPROCESSOR SYSTEMS - A thread scheduler may be used in a chip multiprocessor or symmetric multiprocessor system to schedule threads to processors. The scheduler may determine the bandwidth utilization of the two threads in combination and whether that utilization exceeds the threshold value. If so, the threads may be scheduled on different processor clusters that do not have the same paths between the common memory and the processors. If not, then the threads may be allocated on the same processor cluster that shares cache among processors. | 05-17-2012 |
| Patent application number | Description | Published |
|---|
| 20100223243 | AUTOMATIC DETECTION AND CORRECTION OF HOT PAGES IN A DATABASE SYSTEM - According to one embodiment of the present invention, a method for detecting and correcting hot pages in a database system is provided. According to one embodiment of the present invention, a method includes monitoring transactions involving pages in a database and determining if one of the transactions had to wait for access to one of the pages; incrementing a page contention counter each time one of the transactions had to wait for access to one of the pages. The method then determines if the page contention counter exceeds a predetermined threshold and monitors transactions on one of the pages for which the page contention count was exceeded. The method then determines if a row was accessed in the page for which the page contention count was exceeded and increments a reference count for the accessed row. the accessed rows are flagged when the reference count exceeds a second predetermined threshold. The flagged rows are moved to another page in the database. | 09-02-2010 |
| 20110131192 | Approaches to Reducing Lock Communications In a Shared Disk Database - Lock communications in a shared disk database system is reduced by several approaches: sending a single message to a lock manager for locks required for an operation and locks that will be required in the future, the operations may include row update, row delete, large scan, and row insert; performing an operation in two executions, where in a first execution locks required for the operation is determined without performing the operation, and in a second execution a single message is sent to a lock manager for the required locks and the operation is performed; in free space searching, sending a single message to a lock manager for row and page locks before a row insert is actually performed; and granting locks in an unfair manner. | 06-02-2011 |
| 20110137861 | Methods for Achieving Efficient Coherent Access to Data in a Cluster of Data Processing Computing Nodes - A coherency manager provides coherent access to shared data by receiving a copy of updated database data from a host computer through RDMA, the copy including updates to a given database data; storing the copy of the updated database data as a valid copy of the given database data in local memory; invalidating local copies of the given database data on other host computers through RDMA; receiving acknowledgements from the other host computers through RDMA that the local copies of the given database data have been invalidated; and sending an acknowledgement of receipt of the copy of the updated database data to the host computer through RDMA. When the coherency manager receives a request for the valid copy of the given database data from a host computer through RDMA, it retrieves the valid copy of the given database data from the local memory and returns the valid copy through RDMA. | 06-09-2011 |
| 20110137874 | Methods to Minimize Communication in a Cluster Database System - An ordering of operations in log records includes: performing update operations on a shared database object by a node; writing log records for the update operations into a local buffer by the node, the log records each including a local virtual timestamp; determining that a log flush to write the log records in the local buffer to a persistent storage is to be performed; in response, sending a request from the node to a log flush sequence server for a log flush sequence number; receiving the log flush sequence number by the node; inserting the log flush sequence number into the log records in the local buffer; and performing the log flush to write the log records in the local buffer to the persistent storage, where the log records written to the persistent storage comprises the local virtual timestamps and the log flush sequence number. | 06-09-2011 |
