Multiprocessor Programming Toolkit for Design Reuse
US-2024394048-A1 · Nov 28, 2024 · US
Optimizing heap memory usage
US8959490B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-8959490-B2 |
| Application number | US-201213462766-A |
| Country | US |
| Kind code | B2 |
| Filing date | May 2, 2012 |
| Priority date | Oct 4, 2007 |
| Publication date | Feb 17, 2015 |
| Grant date | Feb 17, 2015 |
How to read this patent
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
- Title
What the patent document calls the invention.
- Abstract
A short plain-language summary of the technical disclosure.
- Assignees and inventors
Who owns or filed the patent and who is credited as inventor.
- Key dates
Filing, priority, publication, and grant dates set the timeline.
- First independent claim
The legal scope of protection — read this for what is actually claimed.
- CPC / IPC classifications
Technology tags used to group this patent with similar filings.
- Citations and related patents
Prior art links and similar publications in this corpus.
Abstract
Official abstract text for this publication.
Embodiments of the present invention provide a computing system and method to profile a program for finding potential optimization in heap usage by reducing lag and drag in lifetimes of heap memory blocks. The process consists of three steps. First, an instrumentation engine analyzes a given program and inserts additional code at interesting locations to collect needed information. Second, when the instrumented program is executed on a set of test cases, runtime data is collected. Third, since this data is large for a complex and long running program, data is processed to present it to a user in useful ways so that a programmer improves the heap utilization in the program.
First claim
Opening claim text (preview).
We claim: 1. A computer implemented method for optimizing usage of heap memory, the method comprising: loading into memory of a computer by a processor of the computer, existing program code instructions of a computer program; inserting additional program code instructions at predefined locations of the existing program code, the additional program code instructions being configured upon execution to search a header of a heap memory block utilized by the computer program and to…
Assignees
Inventors
Classifications
- G06F8/443Primary
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
Patent family
Related publications grouped by family.
External sources
Next steps
Free tools are coming soon. Tell us what you want to track and we'll notify you.
Frequently asked questions
Answers are generated from the same data shown on this page.
- What does patent US8959490B2 cover?
- Embodiments of the present invention provide a computing system and method to profile a program for finding potential optimization in heap usage by reducing lag and drag in lifetimes of heap memory blocks. The process consists of three steps. First, an instrumentation engine analyzes a given program and inserts additional code at interesting locations to collect needed information. Second, when…
- Who is the assignee on this patent?
- Gupta Satish Chandra, Rangarajan Kumar, IBM
- What technology area does this patent fall under?
- Primary CPC classification G06F8/443. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Feb 17 2015 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
- What related patents are in patentsdb?
- We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).