Patents by Inventor Anindya Banerjee
Anindya Banerjee 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).
-
Patent number: 8868839Abstract: A computer-implemented method may include identifying a file that includes one or more data blocks stored within a storage device. The computer-implemented method may also include determining that the file has been accessed more frequently than one or more other files stored within the storage device and then tracking the number of times that at least one data block associated with the file is accessed in the storage device. The computer-implemented method may further include determining that the number of times that the data block associated with the file has been accessed in the storage device is above a predetermined threshold. In addition, the computer-implemented method may include caching the data block associated with the file in a caching mechanism to decrease the amount of time required to access the data block. Various other methods, systems, and computer-readable media are also disclosed.Type: GrantFiled: April 7, 2011Date of Patent: October 21, 2014Assignee: Symantec CorporationInventors: Anindya Banerjee, Amit Jambure, Kedar Patwardhan, Niranjan Pendharkar
-
Patent number: 8818970Abstract: A process for reading entries in a directory is initiated. A first index is maintained to indicate how far the read has progressed in the directory. If, during execution of the process, the directory is partitioned into subdirectories, then a second index is maintained for each of the subdirectories to indicate how far the read has progressed in each of the subdirectories. A third index that indicates how far the read has progressed in the partitioned directory is also maintained.Type: GrantFiled: April 8, 2011Date of Patent: August 26, 2014Assignee: Symantec CorporationInventors: Anindya Banerjee, Maneesh Pusalkar
-
Patent number: 8819823Abstract: A method and apparatus for notifying a recipient of a threat within previously communicated data is described. In one embodiment, network activity amongst at least two computer is analyzed to determine a threat communicated to a computer of the at least two computers. Furthermore, the computer is notified as to the previous communication of the threat.Type: GrantFiled: June 2, 2008Date of Patent: August 26, 2014Assignee: Symantec CorporationInventor: Anindya Banerjee
-
Patent number: 8775732Abstract: A system and method for passing data access information to a disk array are provided. Data access statistics are received from a first source. Thereafter, a determination is made as to whether such data access statistics are to be included in a list of data access statistics. A frequency analysis is then performed by a disk array using the list of data access statistics. An assignment of data to storage blocks within the disk array is then made according to results of the frequency analysis.Type: GrantFiled: April 29, 2011Date of Patent: July 8, 2014Assignee: Symantec CorporationInventor: Anindya Banerjee
-
Patent number: 8732217Abstract: A method for identifying data for relocation in a multivolume file system. The method includes generating a file location map, the file location map containing a list of the locations of files that occupy space on each of a plurality of volumes of the file system, wherein The file system comprising least a first volume and a second volume. The method further includes updating the file location map in accordance with changes in a file change log for the file system, and identifying data residing on the first volume of the file system by scanning the file location map. Using the identified data, a ratio of per-file activity during a first time period relative to overall file system activity over a second time period is calculated to derive a file activity ratio for each of the files of the identified data. Files are then selected for relocation based on the file activity ratio.Type: GrantFiled: October 30, 2009Date of Patent: May 20, 2014Assignee: Symantec CorporationInventors: Murthy V. Mamidi, Kadir Ozdemir, Charles Silvers, Paul Massiglia, Anindya Banerjee, Ronald Karr
-
Patent number: 8725866Abstract: A method of updating a link count in a partitioned directory shared by a plurality of computers within a cluster. The partitioned directory is traversed once by a first computer to obtain a link count. The link count is stored in the first computer and broadcast to a cluster of computers. A total number of allocated links is less than a maximum limit on link count minus the link count. A respective number of links is allocated to each computer within the cluster. Delta values of each computer are updated in real-time as subdirectories are created/erased. A delta value associated with each of the plurality of computers is received. A delta value represents a net number of links created or removed by each computer. The link count is updated based on the previous link count and further based on each of the delta values and further based a delta value associated with the first computer. The updated link count is stored by the first computer and broadcast to the plurality of computers.Type: GrantFiled: August 16, 2010Date of Patent: May 13, 2014Assignee: Symantec CorporationInventors: Rahul Ravindra Borade, Anindya Banerjee, Kedar Patwardhan
-
Patent number: 8695056Abstract: A method for information flow tracking is provided using, for example, a functional programming language based on lambda calculus, ?I. The method provides a unified information-tracking framework that supports multiple, interdependent dimensions of information. An expressive policy-specification system is separated from the underlying information-flow tracking mechanism. Arbitrary domain-specific policies are supported that can be developed and enforced independent of information flow tracking. Information-flow metadata is treated as a first-class entity, and information flow is correctly tracked on the metadata itself. Classes of information flow polices are defined using multiple dimensions that are application to both information flow data and to the information flows themselves. These classes of polices accurately model more realistic security policies, based on partial trust relations.Type: GrantFiled: January 26, 2008Date of Patent: April 8, 2014Assignee: International Business Machines CorporationInventors: Anindya Banerjee, Marco Pistoia, Avraham Shinnar
-
Patent number: 8640190Abstract: Various systems and methods generate access control policies. For example, one method can receive attribute information regarding a computer user. The method can compare the attribute information with access control information and select a value of an access restriction based on a result of the comparing. The access restriction indicates whether a computer resource can be accessed or not. The method then generates an access control policy that includes the value of the access restriction.Type: GrantFiled: February 9, 2012Date of Patent: January 28, 2014Assignee: Symantec CorporationInventor: Anindya Banerjee
-
Publication number: 20130346724Abstract: A region of memory is logically divided into a number of segments, each of which is logically divided into a number of blocks. Blocks are allocated sequentially. A head pointer and a tail pointer demarcate the section of allocated blocks. As allocated blocks are added, the tail pointer is moved so that it remains at the end of the section of allocated blocks. If the tail pointer is within a threshold distance of the head pointer, then the head pointer is moved from its current position to a new position, and the allocated blocks between the current and new positions are freed (deallocated and/or erased). Thus, writes to the memory can be performed sequentially, and blocks can be freed in advance of when they are actually needed.Type: ApplicationFiled: June 20, 2012Publication date: December 26, 2013Applicant: SYMANTEC CORPORATIONInventors: Dilip Madhusudan Ranade, Niranjan Pendharkar, Anindya Banerjee
-
Solid state drive caching using memory structures to determine a storage space replacement candidate
Patent number: 8510499Abstract: A mechanism to identify data that can be removed from a solid state drive (SSD) cache by determining a least recently accessed memory region of the SSD is provided. This functionality is provided by using a tree data structure to store a table mapping storage volume data locations to SSD data locations and associating a time stamp with each entry. The time stamp is updated with each access to the associated SSD location. Advantages of the tree data structure are utilized to efficiently determine an SSD memory location associated with an oldest time stamp in order to make that SSD memory location available for storage of recently accessed data from the storage volume.Type: GrantFiled: August 30, 2010Date of Patent: August 13, 2013Assignee: Symantec CorporationInventor: Anindya Banerjee -
Patent number: 8495705Abstract: A computer-implemented method for data-loss prevention may include: 1) identifying data associated with a user, 2) determining that the data is subject to a data-loss-prevention scan, 3) identifying a data-loss-prevention reputation associated with the user, and then 4) performing a data-loss-prevention operation based at least in part on the data-loss-prevention reputation associated with the user. Various other methods, systems, and computer-readable media are also disclosed.Type: GrantFiled: April 20, 2010Date of Patent: July 23, 2013Assignee: Symantec CorporationInventors: Amit Verma, Anindya Banerjee, Rajorshi Ghosh Choudhury, Sumesh Jaiswal
-
Patent number: 8438362Abstract: A method, in one embodiment, can include determining whether an administrative task for a file system is to be performed within a thin storage memory array. Furthermore, if the administrative task for the file system is to be performed, a determination is made as to whether memory space is freed up while performing the administrative task. If memory space is freed up while performing the administrative task, a determination is made as to whether the freed up memory space satisfies a predefined contiguous memory space threshold. If the predefined contiguous memory space threshold is satisfied by the freed up memory space, a determination is made as to whether a memory space reclamation process is to be performed. If the memory space reclamation process is to be performed, the freed up memory space is reclaimed from the file system.Type: GrantFiled: June 15, 2010Date of Patent: May 7, 2013Assignee: Symantec CorporationInventors: Anirban Mukherjee, Anindya Banerjee, Daniel James Fillingham
-
Patent number: 8429209Abstract: A method of reading data from a partitioned directory incident to a serialized process. A first read and an offset value are received. A first data block in a modeled fully partitioned directory is identified based on the offset value and a predetermined number of entries associated with a buffer. It is determined whether the first data block in the fully partitioned directory is present in the actual partitioned directory. Zeros are written in the buffer if the first data block in the fully partitioned directory is not present in the actual partitioned directory otherwise the first data block associated with the actual partitioned directory is written to the buffer. A second data block is similarly read by a second read operation and written. The second data block is associated with a second subdirectory, selected based on a horizontal node traversal at a node level of said first subdirectory.Type: GrantFiled: August 16, 2010Date of Patent: April 23, 2013Assignee: Symantec CorporationInventors: Mitul Kothari, Brad Boyer, Anindya Banerjee, Kedar Patwardhan, Ryan Robert Lefevre
-
Patent number: 8392437Abstract: A method of maintaining and providing information relating to file deduplication. A first portion of a first file and a second portion of a second file that contain a first content are identified. A first header associated with the first portion is created. The first header identifies the first portion and the second portion containing the first content. The first header is appended to a storage location of the first content of the first portion to form a first data structure for the first file. The first data structure is stored. The first data structure is provided to an application requesting the first file so that duplicate data processing can be avoided by the application. The first data structure is updated when the first file or the second file are altered. A similar process may occur to generate a data structure for the second file.Type: GrantFiled: March 15, 2010Date of Patent: March 5, 2013Assignee: Symantec CorporationInventors: Anirban Mukherjee, Anindya Banerjee
-
Patent number: 8392478Abstract: A method of reading data from a partitioned directory incident to a serialized process. A first read and an offset value are received. A first data block in a modeled fully partitioned directory is identified based on the offset value and a predetermined number of entries associated with a buffer. It is determined whether the first data block in the fully partitioned directory is present in the actual partitioned directory. Zeros are written in the buffer if the first data block in the fully partitioned directory is not present in the actual partitioned directory otherwise the first data block associated with the actual partitioned directory is written to the buffer. A second data block is similarly read by a second read operation and written. The second data block is associated with a second subdirectory, selected based on a horizontal node traversal at a node level of said first subdirectory.Type: GrantFiled: August 16, 2010Date of Patent: March 5, 2013Assignee: Symantec CorporationInventors: Mitul Kothari, Brad Boyer, Anindya Banerjee, Kedar Patwardhan, Ryan Robert Lefevre
-
Patent number: 8386717Abstract: A mechanism is provided for identifying data that can be removed from a cache memory by determining a memory region of the cache that is less recently accessed than other memory regions in the cache. A tree data structure is used to store a mapping of storage volume data locations to cache data locations. A counter reflecting recency of access to the cache data location is associated with each entry. The counter is incremented, along with counters associated with keys leading to a node including the entry, with each access to the associated cache memory location, while other counters in each affected node are decremented. Advantages of the tree data structure are used to efficiently locate a cache memory location associated with a counter reflecting a less recently accessed state in order to make that cache memory location available for storage of recently accessed data from the storage volume.Type: GrantFiled: September 8, 2010Date of Patent: February 26, 2013Assignee: Symantec CorporationInventors: Anindya Banerjee, Niranjan Pendharkar, Michael Patrick Wahl
-
Patent number: 8332690Abstract: A method and apparatus for providing information to mitigate a current failure in a datacenter is described. The method comprises processing historical data regarding at least one failure. The historical data includes at least one action related to the at least one failure. The method further includes determining information for mitigating the current failure based on the historical data.Type: GrantFiled: June 27, 2008Date of Patent: December 11, 2012Assignee: Symantec CorporationInventors: Anindya Banerjee, Bijaya Laxmi Nanda, Navin Kabra
-
Publication number: 20120259823Abstract: A process for reading entries in a directory is initiated. A first index is maintained to indicate how far the read has progressed in the directory. If, during execution of the process, the directory is partitioned into subdirectories, then a second index is maintained for each of the subdirectories to indicate how far the read has progressed in each of the subdirectories. A third index that indicates how far the read has progressed in the partitioned directory is also maintained.Type: ApplicationFiled: April 8, 2011Publication date: October 11, 2012Applicant: SYMANTEC CORPORATIONInventors: Anindya Banerjee, Maneesh Pusalkar
-
Publication number: 20120042063Abstract: A method of updating a link count in a partitioned directory shared by a plurality of computers within a cluster. The partitioned directory is traversed once by a first computer to obtain a link count. The link count is stored in the first computer and broadcast to a cluster of computers. A total number of allocated links is less than a maximum limit on link count minus the link count. A respective number of links is allocated to each computer within the cluster. Delta values of each computer are updated in real-time as subdirectories are created/erased. A delta value associated with each of the plurality of computers is received. A delta value represents a net number of links created or removed by each computer. The link count is updated based on the previous link count and further based on each of the delta values and further based a delta value associated with the first computer. The updated link count is stored by the first computer and broadcast to the plurality of computers.Type: ApplicationFiled: August 16, 2010Publication date: February 16, 2012Applicant: SYMANTEC CORPORATIONInventors: Rahul Ravindra Borade, Anindya Banerjee, Kedar Patwardhan
-
Publication number: 20120041923Abstract: A method of reading data from a partitioned directory incident to a serialized process. A first read and an offset value are received. A first data block in a modeled fully partitioned directory is identified based on the offset value and a predetermined number of entries associated with a buffer. It is determined whether the first data block in the fully partitioned directory is present in the actual partitioned directory. Zeros are written in the buffer if the first data block in the fully partitioned directory is not present in the actual partitioned directory otherwise the first data block associated with the actual partitioned directory is written to the buffer. A second data block is similarly read by a second read operation and written. The second data block is associated with a second subdirectory, selected based on a horizontal node traversal at a node level of said first subdirectory.Type: ApplicationFiled: August 16, 2010Publication date: February 16, 2012Applicant: SYMANTEC CORPORATIONInventors: Mitul Kothari, Brad Boyer, Anindya Banerjee, Kedar Patwardhan, Ryan Robert Lefevre