Patents by Inventor Raju C. Bopardikar
Raju C. Bopardikar has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20140316539Abstract: Disclosed herein is a technique to transfer at least one unfinished operation from one controller to a second controller, if the first controller has ceased.Type: ApplicationFiled: January 31, 2012Publication date: October 23, 2014Inventors: Raju C. Bopardikar, Douglas L. Voigt, Dwight L. Barron, Paul L. Perez
-
Patent number: 8825882Abstract: A data system architecture is described that allows multiple processing and storage resources to be connected to multiple clients so as 1) to distribute the clients' workload efficiently across the available resources; and 2) to enable scaleable expansion, both in terms of the number of clients and in the number of resources. The major features of the architecture are separate, modular, client and resource elements that can be added independently, a high-performance cross-bar data switch interconnecting these various elements, separate serial communication paths for controlling the cross-bar switch settings, separate communication paths for passing control information among the various elements and a resource utilization methodology that enables clients to distribute processing or storage tasks across all available resources, thereby eliminating “hot spots” resulting from uneven utilization of those resources.Type: GrantFiled: March 20, 2006Date of Patent: September 2, 2014Assignee: EMC CorporationInventors: Raju C. Bopardikar, Jacob Y. Bast, Gary A. Cardone, David E. Kaufman, Stuart P. MacEachern, Bruce D. McLeod, James M. Nolan, Zdenek Radouch, Jack J. Stiffler, James A. Wentworth
-
Publication number: 20140237178Abstract: A technique to adjust storage resource acknowledgments and a method thereof is Provided. In one aspect, a request for an operation associated with data is received, and it is determined whether the operation has attained a particular state. In a further aspect, the particular state is adjustable. In another example, the operation has reached the particular state, completion of the operation is acknowledged.Type: ApplicationFiled: September 29, 2011Publication date: August 21, 2014Inventor: Raju C. Bopardikar
-
Publication number: 20120324159Abstract: A data system architecture is described that allows multiple processing and storage resources to be connected to multiple clients so as 1) to distribute the clients' workload efficiently across the available resources; and 2) to enable scaleable expansion, both in terms of the number of clients and in the number of resources. The major features of the architecture are separate, modular, client and resource elements that can be added independently, a high-performance cross-bar data switch interconnecting these various elements, separate serial communication paths for controlling the cross-bar switch settings, separate communication paths for passing control information among the various elements and a resource utilization methodology that enables clients to distribute processing or storage tasks across all available resources, thereby eliminating “hot spots” resulting from uneven utilization of those resources.Type: ApplicationFiled: August 22, 2012Publication date: December 20, 2012Applicant: EMC CORPORATIONInventors: Raju C. BOPARDIKAR, Jacob Y. BAST, Gary A. CARDONE, David E. KAUFMAN, Stuart P. MACEACHERN, Bruce D. MCLEOD, James M. NOLAN, JR., Zdenek RADOUCH, Jack J. STIFFLER, James A. WENTWORTH, II
-
Patent number: 8291094Abstract: A data system architecture is described that allows multiple processing and storage resources to be connected to multiple clients so as 1) to distribute the clients' workload efficiently across the available resources; and 2) to enable scaleable expansion, both in terms of the number of clients and in the number of resources. The major features of the architecture are separate, modular, client and resource elements that can be added independently, a high-performance cross-bar data switch interconnecting these various elements, separate serial communication paths for controlling the cross-bar switch settings, separate communication paths for passing control information among the various elements and a resource utilization methodology that enables clients to distribute processing or storage tasks across all available resources, thereby eliminating “hot spots” resulting from uneven utilization of those resources.Type: GrantFiled: March 20, 2006Date of Patent: October 16, 2012Assignee: EMC CorporationInventors: Raju C. Bopardikar, Jacob Y. Bast, Gary A. Cardone, David E. Kaufman, Stuart P. MacEachern, Bruce D. McLeod, James M. Nolan, Zdenek Radouch, Jack J. Stiffler, James A. Wentworth
-
Patent number: 8281022Abstract: A data system architecture is described that allows multiple processing and storage resources to be connected to multiple clients so as 1) to distribute the clients' workload efficiently across the available resources; and 2) to enable scaleable expansion, both in terms of the number of clients and in the number of resources. The major features of the architecture are separate, modular, client and resource elements that can be added independently, a high-performance cross-bar data switch interconnecting these various elements, separate serial communication paths for controlling the cross-bar switch settings, separate communication paths for passing control information among the various elements and a resource utilization methodology that enables clients to distribute processing or storage tasks across all available resources, thereby eliminating “hot spots” resulting from uneven utilization of those resources.Type: GrantFiled: June 30, 2000Date of Patent: October 2, 2012Assignee: EMC CorporationInventors: Raju C. Bopardikar, Jacob Y. Bast, Gary A. Cardone, David E. Kaufman, Stuart P. MacEachern, Bruce D. McLeod, James M. Nolan, Jr., Zdenek Radouch, Jack J. Stiffler, James A. Wentworth, II
-
Patent number: 7194492Abstract: Metadata that relates logical block addresses of data used by a file system with the physical block addresses at which the data is stored is maintained in nodes that are arranged into a hierarchical volume map tree that extends from a root node to a plurality of leaf nodes. A copy of the volume map tree root node is maintained in a data structure called a delta that represents the data in the covolume and the modifications to that volume map tree copy represent all additions, changes or deletions made to the volume. A copy of the data, or a new covolume, can be made by creating a new delta containing a new copy of the volume map tree root node as it existed at the time the new covolume was created. The deltas are arranged into a tree structure that represents the data in a covolume and whether the data is unchanged from a previous covolume or changed in that covolume. The delta tree structure can be used to determine whether a delta is not shared so that its covolume can be deleted.Type: GrantFiled: June 2, 2003Date of Patent: March 20, 2007Assignee: EMC CorporationInventors: Thomas Seidenberg, Raju C. Bopardikar
-
Patent number: 6941503Abstract: Each time data, in the form of data blocks protected by code checks, must be reformatted, the original data is broken into new data blocks and a new code check is calculated from, and combined with, each new data block, but the new data blocks and new code checks are both reconstituted versions of the original data blocks and the original code checks. Consequently, the data is never left without protection. In one embodiment, an ingress encoder recomputes an ingress code check from an original data block and its associated header. An egress encoder computes an egress code check from the egress header for an outgoing data block reformatted from the original data block and the ingress code check. The outgoing information is then assembled from the egress header, the outgoing data block and the newly computed egress code check.Type: GrantFiled: December 11, 2001Date of Patent: September 6, 2005Assignee: EMC CorporationInventors: Michael J. Homberg, Joris Wils, Jack J. Stiffler, Raju C. Bopardikar
-
Patent number: 6848017Abstract: A procedure is described for determining which source to connect to which destination in a non-blocking crossbar switch through which a plurality of sources may be attempting to gain access to a plurality of destinations. To this end, a metric is dynamically associated with each source and with each destination. Matching of sources to destinations is accomplished by iteratively assigning the destination having the smallest metric of all currently unmatched destinations to the source having the smallest metric of all currently unmatched source.Type: GrantFiled: October 24, 2001Date of Patent: January 25, 2005Assignee: EMC CorporationInventors: Stuart P. MacEachern, Jacob Y. Bast, Raju C. Bopardikar, Jack J. Stiffler
-
Patent number: 6826778Abstract: Video data in the form of a plurality of digitized frames, is stored on a plurality of magnetic disks. Each image frame is striped across a plurality of disks and redundant parity information, derived from the stripes, is written to an additional disk. Disk failure is detected and in response to this detection missing data is regenerated from the parity information. This allows the transfer of video data in real time to be maintained for output so that the system remains operational. While data is being read in real time, derived from regenerated data, the regenerated data is written to an operational disk, thereby reprotecting the data in the event of a subsequent failure. Frame supplied to output are labelled as being protected or unprotected and application programs may respond to this status information as considered appropriate.Type: GrantFiled: March 13, 2002Date of Patent: November 30, 2004Assignee: Autodesk Canada Inc.Inventors: Raju C. Bopardikar, Adrian R. Braine
-
Publication number: 20040098424Abstract: Metadata that relates logical block addresses of data used by a file system with the physical block addresses at which the data is stored is maintained in nodes that are arranged into a hierarchical volume map tree that extends from a root node to a plurality of leaf nodes. A copy of the volume map tree root node is maintained in a data structure called a delta that represents the data in the covolume and the modifications to that volume map tree copy represent all additions, changes or deletions made to the volume. A copy of the data, or a new covolume, can be made by creating a new delta containing a new copy of the volume map tree root node as it existed at the time the new covolume was created. The deltas are arranged into a tree structure that represents the data in a covolume and whether the data is unchanged from a previous covolume or changed in that covolume. The delta tree structure can be used to determine whether a delta is not shared so that its covolume can be deleted.Type: ApplicationFiled: June 2, 2003Publication date: May 20, 2004Applicant: EMC CorporationInventors: Thomas Seidenberg, Raju C. Bopardikar
-
Publication number: 20030225974Abstract: A time-weighted metric is associated with each line of data that is being held in a data cache. The value of the metric is recomputed as the lines are accessed and the metric value is used to group cache lines for paging purposes. The metrics are computed and stored and the stored metrics are maintained by linking the storage locations together in several linked lists that allow the metrics to be easily manipulated for updating purposes and for determining which metrics represent the most active cache lines. In particular, indices are maintained which identify linked lists of metrics with similar values. At regular predetermined time intervals, these indices are then used to assemble an ordered linked list of metrics corresponding to cache lines with similar metric values. This ordered list can be traversed in order to select cache lines for removal.Type: ApplicationFiled: March 12, 2001Publication date: December 4, 2003Inventors: Raju C. Bopardikar, Jack J. Stiffler
-
Patent number: 6654855Abstract: A time-weighted metric is associated with each line of data that is being held in a data cache. The value of the metric is recomputed as the lines are accessed and the metric value is used to group cache lines for paging purposes. The metrics are computed and stored and the stored metrics are maintained by linking the storage locations together in several linked lists that allow the metrics to be easily manipulated for updating purposes and for determining which metrics represent the most active cache lines. In particular, indices are maintained which identify linked lists of metrics with similar values. At regular predetermined time intervals, these indices are then used to assemble an ordered linked list of metrics corresponding to cache lines with similar metric values. This ordered list can be traversed in order to select cache lines for removal.Type: GrantFiled: March 12, 2001Date of Patent: November 25, 2003Assignee: EMC CorporationInventors: Raju C. Bopardikar, Jack J. Stiffler
-
Patent number: 6640285Abstract: Cache memory lines are dynamically paged out to underlying storage in accordance with their current levels of activity and are clustered for paging purposes on the same basis. Activity measures are assigned to each line when it is paged into cache; these measures are updated whenever a cached line is re-accessed. When space is needed in the cache for new lines, the activity measures are sorted based on their relative activity levels and those lines that are least active are grouped onto pages and paged out together. In this manner, the currently most active lines are retained in the cache; and lines having the same temporal characteristics and access frequencies are grouped together on the same page, thereby increasing the likelihood that when a new line is brought into the cache, the other lines that are on the same page, and hence that are brought into cache along with requested line, will themselves soon again become active.Type: GrantFiled: October 26, 2000Date of Patent: October 28, 2003Assignee: EMC CorporationInventors: Raju C. Bopardikar, Jack J. Stiffler
-
Publication number: 20020181449Abstract: A procedure is described for determining which source to connect to which destination in a non-blocking crossbar switch through which a plurality of sources may be attempting to gain access to a plurality of destinations. To this end, a metric is dynamically associated with each source and with each destination. Matching of sources to destinations is accomplished by iteratively assigning the destination having the smallest metric of all currently unmatched destinations to the source having the smallest metric of all currently unmatched source.Type: ApplicationFiled: October 24, 2001Publication date: December 5, 2002Applicant: Cereva Networks, Inc.Inventors: Stuart P. MacEachern, Jacob Y. Bast, Raju C. Bopardikar, Jack J. Stiffler
-
Publication number: 20020094195Abstract: Video data in the form of a plurality of digitised frames, is stored on a plurality of magnetic disks. Each image frame is striped across a plurality of disks and redundant parity information, derived from the stripes, is written to an additional disk. Disk failure is detected and in response to this detection missing data is regenerated from the parity information. This allows the transfer of video data in real time to be maintained for output so that the system remains operational. While data is being read in real time, derived from regenerated data, the regenerated data is written to an operational disk, thereby reprotecting the data in the event of a subsequent failure. Frame supplied to output are labelled as being protected or unprotected and application programs may respond to this status information as considered appropriate.Type: ApplicationFiled: March 13, 2002Publication date: July 18, 2002Applicant: Discreet Logic Inc.Inventors: Raju C. Bopardikar, Adrian R. Braine
-
Patent number: 6404975Abstract: Video data in the form of a plurality of digitised frames, is stored on a plurality of magnetic disks. Each image frame is striped across a plurality of disks and redundant parity information, derived from the stripes, is written to an additional disk. Disk failure is detected and in response to this detection missing data is regenerated from the parity information. This allows the transfer of video data in real time to be maintained for output so that the system remains operational. While data is being read in real time, derived-from regenerated data, the regenerated data is written to an operational disk, thereby reprotecting the data in the event of a subsequent failure. Frame supplied to output are labelled as being protected or unprotected and application programs may respond to this status information as considered appropriate.Type: GrantFiled: April 14, 1997Date of Patent: June 11, 2002Assignee: Discreet Logic Inc.Inventors: Raju C. Bopardikar, Adrian R. Braine
-
Patent number: 6118931Abstract: Video storage is shown in which stripes of video data, derived from video frames or video fields, are written to respective magnetic storage disks. Each disk is provided with a unique serial number during manufacture and the position of a stripe within an image frame is mapped to these unique serial numbers. In this way, it is possible for the physical locations of the disks within the array to be changed while maintaining correct alignment of the stripes making up each image frame.Type: GrantFiled: April 11, 1997Date of Patent: September 12, 2000Assignee: Discreet Logic Inc.Inventor: Raju C. Bopardikar
-
Patent number: 6055354Abstract: Video data storage apparatus includes a plurality of storage disks arranged to store portions of video frames. Incoming data is analysed to determine the number of storage devices required to store a frame. The data is then written to the storage devices as so determined. In addition, in accordance with the size of an incoming frame, the size of each stripe may also be modified. By adjusting the number stripes and the size of each stripe it is possible to write the optimum amount of data to each stripe thereby enhancing the transfer characterstics.Type: GrantFiled: April 11, 1997Date of Patent: April 25, 2000Assignee: Discreet Logic Inc.Inventor: Raju C. Bopardikar