Abstract: This functions maintains two trees: a fast access tree referring to memory blocks of a size most often requested, and a general access tree referring to memory blocks of a size less often requested. After satisfying a request for a memory block, the function adjusts the trees to ensure that the fast access tree refers to memory blocks of the size most often requested. By providing such functionality, the function improves its performance over time through self-adaptation.

Abstract: Methods, systems, and articles of manufacture consistent with the present invention provide a development tool that enables computer programmers to design and develop a data flow program for execution in a multiprocessor computer system. The tool allows the programmer to define a region divided into multiple blocks, wherein each block is associated with data operated on by code segments of the data flow program. The development tool also maintains dependencies among the blocks, each dependency indicating a relationship between two blocks that indicates that the portion of the program associated with a first block of the relationship needs the resultant data provided by the portions of the program associated with a second block of the relationship. The development tool supports several optimization commands, including analyzing node execution patterns and characteristics, and modeling the effect of changes in node execution time and node data.

Abstract: Methods, systems, and articles of manufacture consistent with the present invention assist a programmer in the optimization of an application program by displaying information about memory use in a manner useful to the programmer. A programmer selects an application program that he wishes to optimize. The application program is submitted to an instrumentation process that inserts additional instructions into the code of the application program so that, when executed, the instrumented code produces an output file, called a trace output file. The trace output file contains information about memory accesses. The trace output file is then submitted to a second program, or visualizer, that visually displays the memory accesses using a different visual effect for each type of memory access operation. The visualizer may be run at different speeds, forwards or backwards, paused, or may step through the memory accesses frame-by-frame.