Improving Cache Behavior of Dynamically Allocated Data Structures
(275KB ps.gz)
Dan Truong,
Francois Bodin and
André Seznec
In the proceedings of the eight IEEE International Conference on Parallel Architecture and Compilation Techniques
(PACT'98),
Paris, France, october 12-18 1998.
| Copyright © 1998 IEEE. Published in the Proceedings of PACT'98, 12-18 October 1998 in Paris, France. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works, must be obtained from the IEEE. Contact: Manager, Copyrights and Permissions / IEEE Service Center / 445 Hoes Lane / P.O. Box 1331 / Piscataway, NJ 08855-1331, USA. Telephone: + Intl. 732-562-3966. If you post an electronic version of your paper, you must provide the IEEE with the electronic address (URL, FTP address, etc.) of the posting. For your convenience, you may forward this information to our FTP site: /pub/incoming/cspress/Web-pprs and we will send it on to the Copyrights Department. |
Considerations on Dynamically Allocated Data Structure Layout Optimization
(32KB ps.gz)
Dan Truong.
In the proceedings of the first Workshop on Profile and Feedback-Directed Compilation
(PFDC-1),
in conjunction with PACT'98, Paris, France, Oct. 12 1998.
The presentation slides are available on this site
( ps.gz).
Optimisations logicielles de la localité : le placement précis des données en mémoire
(1MB ps.gz)
Dan Truong
Manuscrit de thèse à l'Université de Rennes-1,
numéro d'ordre 2040, 21 Sept. 1998.
Accurate Data Layout Into Blocks May Boost Cache Performance
(152KB ps.gz)
Dan Truong,
Francois Bodin and
André Seznec
In the proceedings of the second IEEE TCCA Workshop on Interaction between Compilers and Computer Architecture
(Interact-2),
in conjunction with HPCA-3, San Antonio, Texas, Feb. 1, 1997.
The presentation slides are available on this site
(42KB ps.gz).
| Copyright © 1998 IEEE. Extended abstract published in IEEE TTCA Newsletter, june 1997, Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works, must be obtained from the IEEE. Contact: Manager, Copyrights and Permissions / IEEE Service Center / 445 Hoes Lane / P.O. Box 1331 / Piscataway, NJ 08855-1331, USA. Telephone: + Intl. 732-562-3966. If you post an electronic version of your paper, you must provide the IEEE with the electronic address (URL, FTP address, etc.) of the posting. For your convenience, you may forward this information to our FTP site: /pub/incoming/cspress/Web-pprs and we will send it on to the Copyrights Department. |
Ialloc 1.0: An optimized dynamic allocation library for data structures, written in C. Allocation and deallocation is fast, and memory management is memory savy and can improve program's spatial locality. This is because Ialloc uses arenas to allocate instances of structures. This library also supports instance interleaving, a data structure layout optimization which can improve cache performance drastically by maximizing spatial locality between allocated instances (see PACT'98 and PFDC-1 papers).
M2C: A multi-cache configuration simulation suite to evaluate software and hardware cache optimizations on a range of cache configurations. The simulation environment allows simulation of Hill's 3C's or Sugumar's miss classifications, which are frequently used to evaluate hardware cache configurations efficiency. Furthermore, it supports a new miss classification which can also evaluate the potential impact on cache miss ratios of data layout or code transformation techniques (for example, for arrays these can be respectively padding and tiling). Simulations are performed on a range of cache configurations (i.e. varying cache sizes, line sizes and associativities). Results can be viewed graphically directly from simulation results by using the Mathematica notebook front end, or can be exported to different graphic formats (eps, gif, g3d). Examples are available on M2C web pages.