Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Kumar, Sunnyvale
Aditya Kumar, Sunnyvale, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20100174773 | SYNCHRONIZING PRESENTATION STATES BETWEEN MULTIPLE APPLICATIONS - A presentation state is received from the presenting application. The presentation state may represent a current state of the local presentation. A request for the presentation state is received from the viewing application. In response to receiving the request for the presentation state, the presentation state is provided to the viewing application. A request for presentation data synchronized to the presentation state is received from the viewing application. In response to receiving the request for presentation data synchronized to the presentation state, the presentation file is transformed into the presentation data synchronized to the presentation state. The presentation data synchronized to the presentation state is provided to the viewing application. The viewing application may be operative to read the presentation data and to display a remote presentation in response to reading the presentation data. | 07-08-2010 |
Akhiles Kumar, Sunnyvale, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20090019267 | Method, System, and Apparatus for Dynamic Reconfiguration of Resources - A dynamic reconfiguration to include on-line addition, deletion, and replacement of individual modules of to support dynamic partitioning of a system, interconnect (link) reconfiguration, memory RAS to allow migration and mirroring without OS intervention, dynamic memory reinterleaving, CPU and socket migration, and support for global shared memory across partitions is described. To facilitate the on-line addition or deletion, the firmware is able to quiesce and de-quiesce the domain of interest so that many system resources, such as routing tables and address decoders, can be updated in what essentially appears to be an atomic operation to the software layer above the firmware. | 01-15-2009 |
| 20090024715 | Method, System, and Apparatus for Dynamic Reconfiguration of Resources - A dynamic reconfiguration to include on-line addition, deletion, and replacement of individual modules of to support dynamic partitioning of a system, interconnect (link) reconfiguration, memory RAS to allow migration and mirroring without OS intervention, dynamic memory reinterleaving, CPU and socket migration, and support for global shared memory across partitions is described. To facilitate the on-line addition or deletion, the firmware is able to quiesce and de-quiesce the domain of interest so that many system resources, such as routing tables and address decoders, can be updated in what essentially appears to be an atomic operation to the software layer above the firmware. | 01-22-2009 |
| 20090055600 | Method, System, and Apparatus for Dynamic Reconfiguration of Resources - A dynamic reconfiguration to include on-line addition, deletion, and replacement of individual modules of to support dynamic partitioning of a system, interconnect (link) reconfiguration, memory RAS to allow migration and mirroring without OS intervention, dynamic memory reinterleaving, CPU and socket migration, and support for global shared memory across partitions is described. To facilitate the on-line addition or deletion, the firmware is able to quiesce and de-quiesce the domain of interest so that many system resources, such as routing tables and address decoders, can be updated in what essentially appears to be an atomic operation to the software layer above the firmware. | 02-26-2009 |
Akhilesh Kumar, Sunnyvale, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20090254712 | ADAPTIVE CACHE ORGANIZATION FOR CHIP MULTIPROCESSORS - A method, chip multiprocessor tile, and a chip multiprocessor with amorphous caching are disclosed. An initial processing core | 10-08-2009 |
| 20090265472 | Method, System, and Apparatus for System Level Initialization - Multiple initialization techniques for system and component in a point-to-point architecture are discussed. Consequently, the techniques allow for flexible system/socket layer parameters to be tailored to the needs of the platform, such as, desktop, mobile, small server, large server, etc., as well as the component types such as IA32/IPF processors, memory controllers, IO Hubs, etc. Furthermore, the techniques facilitate powering up with the correct set of POC values, hence, it avoids multiple warm resets and improves boot time. In one embodiment, registers to hold new values, such as, Configuration Values Driven during Reset (CVDR), and Configuration Values Captured during Reset (CVCR) may be eliminated. | 10-22-2009 |
| 20090313435 | Optimizing concurrent accesses in a directory-based coherency protocol - In one embodiment, the present invention includes a directory to aid in maintaining control of a cache coherency protocol. The directory can be coupled to multiple caching agents via an interconnect, and be configured to store a entries associated with cache lines. The directory also includes logic to determine a time delay before the directory can send a concurrent snoop request. Other embodiments are described and claimed. | 12-17-2009 |
| 20100250861 | FAIRNESS MECHANISM FOR STARVATION PREVENTION IN DIRECTORY-BASED CACHE COHERENCE PROTOCOLS - Methods and apparatus relating to a fairness mechanism for starvation prevention in directory-based cache coherence protocols are described. In one embodiment, negatively-acknowledged (nack'ed) requests from a home agent may be tracked (e.g., using distributed linked-lists). In turn, the tracked requests may be served in a fair order. Other embodiments are also disclosed. | 09-30-2010 |
| 20110145506 | Replacing Cache Lines In A Cache Memory - In one embodiment, the present invention includes a cache memory including cache lines that each have a tag field including a state portion to store a cache coherency state of data stored in the line and a weight portion to store a weight corresponding to a relative importance of the data. In various implementations, the weight can be based on the cache coherency state and a recency of usage of the data. Other embodiments are described and claimed. | 06-16-2011 |
Ambuj Kumar, Sunnyvale, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20100309918 | METHOD AND SYSTEM FOR ORDERING POSTED PACKETS AND NON-POSTED PACKETS TRANSFER - A system for ordering packets. The system includes a first memory, e.g., FIFO, storing transition information for posted packets, e.g., 1 when a posted packet transitions from a non-posted packet and 0 otherwise. A second memory stores transition information for non-posted packets, e.g., 1 when a non-posted packet transitions from a posted packet and 0 otherwise. A counter increments responsive to detecting a transition in the first memory and decrements responsive to detecting a transition in the second memory. A controller orders a posted packet for transmission prior to a non-posted packet if a value of the counter is negative and when a transitional value associated with the non-posted packet is 1, and wherein the controller orders either a posted packet or a non-posted packet otherwise. The first and the second memory may be within a same memory component. | 12-09-2010 |
Anjani Kumar, Sunnyvale, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20080306784 | Computer-implemented methods and systems for analyzing clauses of contracts and other business documents - A computer-implemented method for analyzing clauses of business documents of an enterprise may include steps of providing a database and storing a plurality of business documents used by the enterprise in the database. Each of the plurality of business document stored in the database may include a plurality of clauses, and each of the plurality of clauses may be associated with a plurality of clause attributes and a clause attribute value for each of the plurality of clause attributes. The method may include steps of prompting for a value of at least one of the clause attributes; obtaining at least one value for the prompted clause attributes and querying the database to identify all occurrences of clauses used in at least one of the stored business documents whose clause attribute values match each obtained value for the prompted clause attributes. A business document clause analysis report may then be generated that includes each identified matching clause occurrence. | 12-11-2008 |
Kapil Kumar, Sunnyvale, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20090006792 | System and Method to Identify Changed Data Blocks - Differences between data objects stored on a mass storage device can be identified quickly and efficiently by comparing block numbers stored in data structures that describe the data objects. Bit-by-bit or byte-by-byte comparisons of the objects' actual data need only be performed if the block numbers are different. Objects that share many data blocks can be compared much faster than by a direct comparison of all the objects' data. The fast comparison techniques can be used to improve storage server mirrors and database storage operations, among other applications. | 01-01-2009 |
Mahendra Kumar, Sunnyvale, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20090307599 | VIRTUAL PRIVATE SUPPLY CHAIN - A generic Internet based system for viewing supply chain data is provided. The system includes an Internet based data viewing engine and a data store that holds both viewable data and metadata associated with the viewable data. The metadata can be employed by the Internet based data viewing engine to control the presentation of the viewable data. The generic Internet based supply chain data viewing engine may be employed in a virtual private supply chain (VPSC). A VPSC includes a data acceptor that can receive supply chain data items from supply chain members, a supply chain data store that can store transformed, validated supply chain data items received from the supply chain members and a data accessor operable to selectively present supply chain data items stored in the supply chain data store to viewing supply chain members. One example of the data accessor is the generic Internet based viewing engine. | 12-10-2009 |
Nirman Kumar, Sunnyvale, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20090037495 | METHOD AND SYSTEM FOR STATE MAINTENANCE OF A LARGE OBJECT - A method, system and computer program product are described for state maintenance of a large object. In one approach, the method, system and computer program product perform by associating one or more buffers with a transaction involving a large object, the large object data may be accessed using the one or more buffers during the transaction, and storing data for the large object from the one or more buffers in one or more sets of contiguous blocks. | 02-05-2009 |
Pradeep Kumar, Sunnyvale, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20090221277 | DISCONNECTION TECHNIQUES IN WIRELESS COMMUNICATIONS NETWORKS - An apparatus includes a host, and a communications control module. The communications control module exchanges information with a communications network, such as a Universal Mobile Telecommunications System (UMTS) network. The host determines whether a termination condition exists. Based on this determination, the communications control module performs a signaling connection release indication procedure when a termination condition exists. | 09-03-2009 |
Prem Kumar, Sunnyvale, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20090265609 | Method and System for Producing and Organizing Electronically Stored Information - The invention provides techniques for efficiently organizing and reviewing electronic documents to be produced in the course of a discovery process. The technique provides for marking the master or pivot document with review information, and identifying a plurality of duplicate documents related to the master or pivot document. The technique provides for reviewing a master or pivot document and propagating the review information to a set of related documents. The technique provides for producing a plurality of electronic documents where each of the electronic documents is marked up in accordance with the review information. The method provides for organizing the plurality of electronic documents so it can be presented and searched in an efficient manner. | 10-22-2009 |
Saket Kumar, Sunnyvale, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20090307182 | METHODS AND APPARATUS FOR DETERMINING AN IDENTITY OF A USER - Methods and apparatuses for determining the identity of the user detect a current user's electronic device activity pattern; compare the detected activity pattern against a plurality of user action identification profiles, wherein each user action identification profile is associated with a particular user; and use the comparing to identify the current user as being the particular user. | 12-10-2009 |
Sandeep Kumar, Sunnyvale, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20090081302 | PULMONARY DELIVERY OF POLYENE ANTIFUNGAL AGENTS - The present invention provides spray-dried polyene compositions for oral inhalation to the lung. The polyene antifungal compositions demonstrate superior aerosol properties, do not exhibit appreciable degradation of the polyene upon spray-drying, and are useful in the treatment and prophylaxis of both pulmonary and systemic fungal infections. | 03-26-2009 |
Srihari Kumar, Sunnyvale, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20100131835 | SYSTEM AND METHODS FOR INFERRING INTENT OF WEBSITE VISITORS AND GENERATING AND PACKAGING VISITOR INFORMATION FOR DISTRIBUTION AS SALES LEADS OR MARKET INTELLIGENCE - A system for inferring intent of visitors to a Website has a visitor-tracking application executing from a digital medium coupled to a server hosting the Website, the server connected to a repository adapted to store data about visitor behavior, and an inference engine for processing the data to infer the intent of visitors. Visitor behavior relative to links is tracked, and intent of a visitor is inferred from one or both, or a combination of analysis of the behavior and deducing meaning for anchor text of links selected. | 05-27-2010 |
Srin Kumar, Sunnyvale, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20100169283 | RECOVERY POINT DATA VIEW FORMATION WITH GENERATION OF A RECOVERY VIEW AND A COALESCE POLICY - Methods, software suites, networks, and systems of recovery point data view formation with generation of a recovery view and a coalesce policy are disclosed. In one embodiment, a network includes a virtualization module to form a data view around a recovery point, a recovery module to generate a recovery snapshot having an ability to position forward and backward from the recovery point when a rolling algorithm is applied, and an events module to generate a coalesce policy around the recovery point to reduce a storage requirement. The network may include an export module to transfer the data view to an external processing device as a virtual volume using one or more of an iSCSI and a fiber channel transport interface. The export module may automatically communicate the data view to a backup tape to provide extended data retention using a lifecycle management policy. | 07-01-2010 |
| 20100169592 | GENERATING A RECOVERY SNAPSHOT AND CREATING A VIRTUAL VIEW OF THE RECOVERY SNAPSHOT - Methods, software suites, and systems of generating a recovery snapshot and creating a virtual view of the recovery snapshot are disclosed. In an embodiment, a method includes generating a recovery snapshot at a predetermined interval to retain an ability to position forward and backward when a delayed roll back algorithm is applied and creating a virtual view of the recovery snapshot using an algorithm tied to an original data, a change log data, and a consistency data related to an event. The method may include redirecting an access request to the original data based on a meta-data information provided in the virtual view. The method may further include substantially retaining a timestamp data, a location of a change, and a time offset of the change as compared with the original data. | 07-01-2010 |
| 20100280999 | ENSURING DATA PERSISTENCE AND CONSISTENCY IN ENTERPRISE STORAGE BACKUP SYSTEMS - Ensuring data persistence and consistency in enterprise storage backup systems method and apparatus are disclosed. In one embodiment, a method includes creating a data log structure (e.g., a log file) on a storage device (e.g., a Serial ATA drive, a SCSI drive, a SAS drive, a storage are network, etc.) coupled to an application server to store a backup data generated by a filter module in a continuous backup environment and buffering the backup data generated by the filter module through a memory module that transfers the backup data to the data log structure on the storage device based on an occurrence of an event. The data log structure may be created by configuring a portion of the storage device as a dedicated resource available to the memory module to copy the backup data and the data log structure may be a file on the storage device coupled to the application server having the file system. | 11-04-2010 |
Srinivasan Kumar, Sunnyvale, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20100161451 | EFFICIENT COMPUTATION OF AVAILABLE TO PROMISE (ATP) IN SUPPLY CHAINS - An inventory supply management procedure involves representing inventory supply events in a data processing device memory with indications of times at which the supply events take place, and associating with each supply event at least an Available to Promise (ATP) and an ATP Restoration Guide (ATPRG) value. | 06-24-2010 |
| 20110137708 | Prioritized Promising with Preemption in Supply Chains - A supply chain management plan includes supply events for inventory and times at which the supplies will be received. The plan further includes demand events and when they occur. The demands may be prioritized. For each demand priority, an available to promise (ATP) amount of supply is determined in accordance with demand events of that priority. The ATP is determined for higher priority demand events before it is determined for lower priority demand events. Cancellations of a priority k order may be processed by determining, for each demand priority context i=k+1 to N, an amount of inventory to restore to available status at a particular supply event based upon a minimum ATPRG value between the particular supply event and the order committed date. | 06-09-2011 |