Patents by Inventor Jayashri Visvanathan

Jayashri Visvanathan 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).

  • Method and apparatus for freeing memory from an extensible markup language document object model tree active in an application cache
    Patent number: 6542911
    Abstract: The present invention relates to a garbage collector that uses an LRU algorithm to free memory from an XML DOM tree active in an application cache. According to one or more embodiments of the present invention, a threshold for the amount of memory permitted to reside in an application cache is set. Then, a garbage collector removes entries from the cache until it falls below the threshold. In one or more embodiments, a node table is used. When nodes are added to the XML DOM tree in the application cache the node table is updated. When the threshold for the amount of memory permitted to reside in the application cache is exceeded, the garbage collector applies an LRU algorithm uses the node table to determine which nodes to remove from the application cache. In one embodiment, the LRU algorithm scans the node table to determine the least recently used node in the table by examining time stamp entries in the table.
    Type: Grant
    Filed: March 1, 2001
    Date of Patent: April 1, 2003
    Assignee: Sun Microsystems, Inc.
    Inventors: Krishnendu Chakraborty, Jayashri Visvanathan
  • Method and apparatus for freeing memory from an extensible markup language document object model tree active in an application cache
    Publication number: 20020165870
    Abstract: The present invention relates to a garbage collector that uses an LRU algorithm to free memory from an XML DOM tree active in an application cache. According to one or more embodiments of the present invention, a threshold for the amount of memory permitted to reside in an application cache is set. Then, a garbage collector removes entries from the cache until it falls below the threshold. In one or more embodiments, a node table is used. When nodes are added to the XML DOM tree in the application cache the node table is updated. When the threshold for the amount of memory permitted to reside in the application cache is exceeded, the garbage collector applies an LRU algorithm uses the node table to determine which nodes to remove from the application cache. In one embodiment, the LRU algorithm scans the node table to determine the least recently used node in the table by examining time stamp entries in the table.
    Type: Application
    Filed: March 1, 2001
    Publication date: November 7, 2002
    Inventors: Krishnendu Chakraborty, Jayashri Visvanathan