Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Gunda, US
Arun Gunda, San Jose, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20100162060 | DFT TECHNIQUE TO APPLY A VARIABLE SCAN CLOCK INCLUDING A SCAN CLOCK MODIFIER ON AN IC - A scan clock modifier, a method of providing a variable scan clock, an IC including a scan clock modifier and a library including a cell of a scan clock modifier. In one embodiment, the scan clock modifier includes: (1) logic circuitry configured to provide at least one selected clock signal based on a test scan clock signal and a first clock control signal, both of the test scan clock signal and the first clock control signal received from test equipment and (2) comparison logic configured to provide a scan clock signal based on the at least one selected clock signal and at least one other clock control signal received from the test equipment, wherein the first and the at least one other clock control signals are different clock control signals. | 06-24-2010 |
Arun K. Gunda, San Jose, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20090106613 | TESTING A CIRCUIT WITH COMPRESSED SCAN CHAIN SUBSETS - A test system tests a circuit. Compressed scan data subsets are stored, one at a time, in a memory of the test system. The multiple compressed scan data subsets correspond with multiple scan chains in a function block of the tested circuit. Transmission of the compressed scan data subset from the memory to the tested circuit is controlled by the test system. The test system receives a compacted test pattern subset from the tested circuit and provides a test system output that indicates a presence of any errors in functioning of the tested circuit. | 04-23-2009 |
Kalyan C. Gunda, Wappingers Falls, NY US
| Patent application number | Description | Published |
|---|---|---|
| 20090019052 | PROVIDING FILE SYSTEM AVAILABILITY DURING LOCAL PATH FAILURE OF A NON-SERVER NODE - File system availability during local path failure of a non-server node is provided by generating a server database of one or more server nodes having access to a storage device of the file system. The storage device is accessed by a non-server node over a local path to implement one or more input/output (I/O) operations. Upon failure of an I/O operation over the local path, the server database is queried to identify one or more server nodes having access to the storage device. One or more subsequent I/O operations for the storage device are implemented using the one or more identified server nodes. After a restoration of the local path is detected, I/O operations for the storage device are then implemented over the local path. | 01-15-2009 |
| 20090019098 | FILE SYSTEM MOUNTING IN A CLUSTERED FILE SYSTEM - A method effectively preventing a requesting node from unfencing and mounting a file system subsequent to a failure in a cluster file system having a plurality of active nodes. The method comprising first upgrading one active node in the cluster to function as a cluster manager node. The cluster manager is in communication with all nodes. The cluster manager is assigned manager responsibilities, in part, comprising first receiving an active status request from the node requesting to mount a file system. The cluster manager first queries the quorum nodes to determine whether each node considers the cluster manager to still have cluster management responsibilities for the file system. If a majority of quorum nodes consider the cluster manager to still have cluster management responsibilities for the file system then the cluster manager responds to the requesting node's active status request. Thereafter, the requesting node proceeds with mounting the file system. | 01-15-2009 |
| 20090177756 | MULTIPLE NETWORK SHARED DISK SERVERS - A method, information processing system, and computer program storage product access data on an information processing system. The information processing system includes a plurality of Network Shared Disk servers and at least one set of Network Shared Disks. Each of the Network Shared Disks is served by at least one of the Network Shared Disk servers. Configuration data that includes information indicating which of the Network Shared Disk servers serve each of the Network Shared Disks is analyzed. The Network Shared Disk to be accessed is identified. One of the Network Shared Disk servers is selected from the plurality of Network Shared Disk servers that serve the one Network Shared Disk to be accessed. The one Network Shared Disk to be accessed is accessed via the one Network Shared Disk server that was selected. | 07-09-2009 |
| 20100153526 | PER FILE SYSTEM USAGE OF NETWORKS - A method, information processing system, and computer program product access data in a system. The system includes a plurality of Network Shared Disk servers and at least one set of Network Shared Disks. Each of the Network Shared Disks are served by at least one of the Network Shared Disk servers across a multiple networks. Configuration data that includes information indicating which of the networks is associated with each of the Network Shared Disks for the one node is analyzed. A first of the Network Shared Disks to be accessed is identified. One of the networks that is associated with the first Network Shared Disk is selected based on the configuration data. The first Network Shared Disk is accessed via the one network that was selected. | 06-17-2010 |
Pradeep Kumar Gunda, Mountain View, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20100241828 | General Distributed Reduction For Data Parallel Computing - General-purpose distributed data-parallel computing using high-level computing languages is described. Data parallel portions of a sequential program written in a high-level language are automatically translated into a distributed execution plan. Map and reduction computations are automatically added to the plan. Patterns in the sequential program can be automatically identified to trigger map and reduction processing. Direct invocation of map and reduction processing is also provided. One or more portions of the reduce computation are pushed to the map stage and dynamic aggregation is inserted when possible. The system automatically identifies opportunities for partial reductions and aggregation, but also provides a set of extensions in a high-level computing language for the generation and optimization of the distributed execution plan. The extensions include annotations to declare functions suitable for these optimizations. | 09-23-2010 |
| 20110072006 | MANAGEMENT OF DATA AND COMPUTATION IN DATA CENTERS - Data and computation may be unified (i.e., integrated) in a data center using a single query interface. Users may interact with the data center via a query interface to provide a query (i.e., a computation) to the data center. The results of the query may be referred to as derived datasets and may be managed by a cache server. In an implementation, a derived dataset is uniquely referenced by the query that computes it. Shared common computations are computed only once and may be reused by other computations. The result of a query may be computed (if not previously cached) and returned to the user. Infrequently used derived datasets may be garbage collected (e.g., deleted or otherwise removed from storage) by a garbage collector. This integration of data and computation provides efficient resource management for data center. | 03-24-2011 |
Siva Gangadhar Gunda, Davis, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20100212346 | WICKING CONDENSATE EVAPORATOR FOR AN AIR CONDITIONING SYSTEM - One embodiment of the present invention provides an air conditioning (AC) system that evaporates its own condensate. This AC system includes a condenser coil and an evaporator coil that produces condensate. The AC system also includes a wicking-evaporative device that is configured to wick and evaporate the condensate in the vicinity of the condenser coil. | 08-26-2010 |