1 / 4

Optimization of Memory Allocation in VSIPL

Explore how to enhance memory allocation in the Vector, Signal, and Image Processing Library (VSIPL) for efficient operations. Learn about proposed implementations using lightweight indexes, focusing on speed over memory efficiency. Results for matrix addition and maximum on Intel Core 2 Duo E6400 2.1 GHz with Linux kernel version 2.6.9-5.

duncan-shaw
Télécharger la présentation

Optimization of Memory Allocation in VSIPL

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Optimization of Memory Allocation in VSIPL Jinwoo Suh, Janice O. McMahon, Stephen P. Crago, and Dong-In Kang University of Southern California Information Sciences Institute September 18, 2007

  2. Memory Allocation in VSIPL • VSIPL: Vector, Signal, and Image Processing Library • Reference implementation: straightforward memory allocations • Uses malloc() and free() handled by operating system • Costs many cycles • Library overhead for management, bookkeeping, etc. • Proposed implementation • Uses light-weight indexes to manage memory space • Emphasis on fast operation over efficient use of memory • First-fit-based algorithm

  3. Results for Matrix Addition • Results on Intel Core 2 Duo E6400 2.1 GHz • Linux kernel version 2.6.9-5

  4. Results for Matrix Maximum • Results similar to Matrix Addition

More Related