The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Apr. 25, 2006
Filed:
Aug. 13, 2002
Claude Basso, Raleigh, NC (US);
Matthew William Kilpatrick Brown, Durham, NC (US);
Gordon Taylor Davis, Chapel Hill, NC (US);
Marco Heddes, Lawrence, MA (US);
Piyush Chunilal Patel, Cary, NC (US);
Grayson Warren Randall, Cary, NC (US);
Sonia Kiang Rovner, Chapel Hill, NC (US);
Colin Beaton Verrilli, Apex, NC (US);
Claude Basso, Raleigh, NC (US);
Matthew William Kilpatrick Brown, Durham, NC (US);
Gordon Taylor Davis, Chapel Hill, NC (US);
Marco Heddes, Lawrence, MA (US);
Piyush Chunilal Patel, Cary, NC (US);
Grayson Warren Randall, Cary, NC (US);
Sonia Kiang Rovner, Chapel Hill, NC (US);
Colin Beaton Verrilli, Apex, NC (US);
International Business Machines Corporation, Armonk, NY (US);
Abstract
A method, system and computer program product for eliminating memory corruption when performing multi-threaded tree operations. A network processor may receive a command to perform a tree operation on a tree on one or more of multiple threads. Upon performing the requested tree operation, the network processor may lock one or more resources during a portion of the execution of the requested tree operation using one or more semaphores. A semaphore may refer to a flag used to indicate whether to 'lock' or make available the resource associated with the semaphore. Locking may refer to preventing the resource from being available to other threads. Hence, by locking one or more resources during a portion of the tree operation, memory corruption may be eliminated in a multiple thread system while preventing these resources from being used by other threads for a minimal amount of time.