Search

Radha Kandadai Phones & Addresses

  • 32 Knoll Ct, Fishkill, NY 12524 (845) 896-1486
  • 26 Jeanette Ln, Lake Katrine, NY 12449 (845) 336-4152
  • 7 Jeanette Ln, Lake Katrine, NY 12449 (845) 336-4152
  • Port Ewen, NY
  • 32 Knoll Ct, Fishkill, NY 12524

Work

Position: Professional/Technical

Education

Degree: Associate degree or higher

Publications

Us Patents

Mapping A Logical Address To A Plurality On Non-Logical Addresses

View page
US Patent:
6782464, Aug 24, 2004
Filed:
Jul 17, 2001
Appl. No.:
09/906860
Inventors:
Robert S. Blackmore - Poughkeepsie NY
Radha R. Kandadai - Lake Katrine NY
Chulho Kim - Poughkeepsie NY
Gili Mendel - Cary NC
Gautam H. Shah - Worcester MA
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 1200
US Classification:
711202, 711209
Abstract:
Communication between different entities of a computing environment is facilitated by an address mapping capability. Messages are sent between the entities to have desired tasks performed. Instead of providing within the messages the actual non-logical addresses (e. g. , virtual, real addresses) used to perform the tasks, logical addresses are provided. The logical addresses are then mapped to the non-logical addresses. Each logical address can map to a plurality of non-logical addresses.

Dynamic Quorum Adjustment

View page
US Patent:
6904448, Jun 7, 2005
Filed:
Dec 20, 2001
Appl. No.:
10/028493
Inventors:
Eugene Johnson - Austin TX, US
Radha R. Kandadai - Lake Katrine NY, US
Frank J. Mangione - Saugerties NY, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F015/16
US Classification:
709201, 709209, 709219, 709220, 709223, 709224, 709226, 709246, 707 8, 707 10, 714 4
Abstract:
In a multinode data processing system capable of partitioning operations a method is provided for adding nodes to a configuration of nodes in a manner which node quorums are employed but in which two quorum values (ideal and enforced) are employed and in which old nodes using a given file system are distinguished from new nodes. The method prevents even the transient use of inappropriate quorum values.

Support For Single-Node Quorum In A Two-Node Nodeset For A Shared Disk Parallel File System

View page
US Patent:
6915391, Jul 5, 2005
Filed:
Dec 15, 2000
Appl. No.:
09/737393
Inventors:
Robert J. Curran - West Hurley NY, US
Radha R. Kandadai - Lake Katrine NY, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F012/00
US Classification:
711150, 711147, 711148, 711152, 713200, 713202, 713201, 713153, 714100
Abstract:
A method is provided for continuing node operations in quorum-based protocols. This is particularly valuable in the situation in which a group of nodes includes only two nodes and in which communications to a node is lost. Provision is made for adding additional status indications to each node indicating whether or not it is enabled for single-node quorum operation. Provision is also made for identifying one node as a primary node and another node as a secondary node for time-out response purposes.

Recovery Support For Reliable Messaging

View page
US Patent:
20030014516, Jan 16, 2003
Filed:
Jul 13, 2001
Appl. No.:
09/905308
Inventors:
Robert Blackmore - Poughkeepsie NY, US
Amy Chen - Poughkeepsie NY, US
Kevin Gildea - Bloomington NY, US
Rama Govindaraju - Poughkeepsie NY, US
Anand Hudli - Hopewell Junction NY, US
Radha Kandadai - Lake Katrine NY, US
Chulho Kim - Poughkeepsie NY, US
Richard Rosenthal - Poughkeepsie NY, US
Gautam Shah - Poughkeepsie NY, US
Assignee:
INTERNATIONAL BUSINESS MACHINES CORPORATION - ARMONK NY
International Classification:
G06F015/173
US Classification:
709/224000, 709/238000
Abstract:
Interconnected data processing nodes can from time to time experience temporary failures or losses of communication links between system nodes. In systems which have a mechanism for determining whether the data processing nodes are operative or not, by providing an epoch number for use as an instance identifier and by providing a mechanism for controlling the generation and propagation of the epoch number, such systems are able to resume their respective tasks when failed nodes or communication links are restored.

Efficient Notification Of Multiple Message Completions In Message Passing Multi-Node Data Processing Systems

View page
US Patent:
20030023775, Jan 30, 2003
Filed:
Jul 13, 2001
Appl. No.:
09/904815
Inventors:
Robert Blackmore - Poughkeepsie NY, US
Amy Chen - Poughkeepsie NY, US
Kevin Gildea - Bloomington NY, US
Rama Govindaraju - Poughkeepsie NY, US
Anand Hudli - Hopewell Junction NY, US
Radha Kandadai - Lake Katrine NY, US
Chulho Kim - Poughkeepsie NY, US
Gautam Shah - Poughkeepsie NY, US
Assignee:
INTERNATIONAL BUSINESS MACHINES CORPORATION - ARMONK NY
International Classification:
G06F009/00
G06F009/46
US Classification:
709/330000, 709/313000, 709/318000, 709/328000
Abstract:
A system and method for message processing in a distributed, multi-node data processing system is structured to permit a sending process running on one node to send messages to a selectable subset of nodes via an interface mechanism which places a sending process in an inactive or idle state pending receipt of either all responses from the selected destination nodes or of a notification via the interface that one or more responses will not arrive.

Data Movement Management System And Method For A Storage Area Network File System Employing The Data Management Application Programming Interface

View page
US Patent:
20050125556, Jun 9, 2005
Filed:
Dec 8, 2003
Appl. No.:
10/730508
Inventors:
Robert Curran - West Hurley NY, US
Radha Kandadai - Lake Katrine NY, US
Irit Loy - Binyamina, IL
John Marberg - Haifa, IL
Assignee:
INTERNATIONAL BUSINESS MACHINES CORPORATION - ARMONK NY
International Classification:
G06F015/173
US Classification:
709238000
Abstract:
A system and method of managing data movement are provided in which a processing environment is established in a cluster of nodes. The nodes have common access to data residing in one or more data storage units. A data management application (DM) is initiated in the environment. One of the nodes of the cluster is assigned as a coordinating node for managing data movement. Thereafter, a worker thread is posted to one or more of the nodes in the cluster to perform one or more data movement tasks in response to the event. Preferably, a process session is established in the cluster. A session identifier and a data management access right are provided to one or more nodes to permit only the node or nodes having them to execute the worker thread posted to it.

Parallel File System And Method For Independent Metadata Loggin

View page
US Patent:
60215089, Feb 1, 2000
Filed:
Jul 11, 1997
Appl. No.:
8/893627
Inventors:
Frank B. Schmuck - Campbell CA
Radha R. Kandadai - Lake Katrine NY
Anthony J. Zlotek - Pleasant Valley NY
Robert J. Curran - West Hurley NY
William A. Kish - Millerton NY
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 1100
US Classification:
714 4
Abstract:
A computer system having a shared disk file system running on multiple computers each having their own instance of an operating system and being coupled for parallel data sharing access to files residing on network attached shared disks. Locking techniques reduce the overhead of a token manager which is also used in the file system recovery if a computer participating in the management of shared disks becomes unavailable or failed. Synchronous and asynchronous takeover of a metadata node occurs for correction of metadata which was under modification and a new computer node to be a metadata node for that file. Locks are not constantly required to allocate new blocks on behalf of a user.
Radha R Kandadai from Fishkill, NY, age ~72 Get Report