ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Discrete Applied Mathematics
Volume 155, Issue 14, 1 September 2007, Pages 1795-1811
3rd Cologne/ Twente Workshop on Graphs and Combinatorial Optimization - CTW2004
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (796 K)

Article Toolbox
  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.dam.2007.03.019    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2007 Published by Elsevier B.V.

Memory management optimization problems for integrated circuit simulators

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Timothée Bossarta, E-mail The Corresponding Author, Alix Munier Kordona, E-mail The Corresponding Author and Francis Sourda, E-mail The Corresponding Author

aLIP6 - Université Pierre et Marie Curie, 4 place Jussieu, 75252 Paris Cedex 05, France


Received 30 September 2004; 
revised 15 June 2005; 
accepted 19 May 2006. 
Available online 27 March 2007.

Abstract

In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to the great number of tests to be performed, optimization of the simulation code is of prime importance. This paper describes two mathematical models for the minimization of the memory access times for a cycle-based simulator.

An integrated circuit being viewed as a directed acyclic graph, the problem consists in building a graph order on the vertices, compatible with the relation order induced by the graph, in order to minimize a cost function that represents the memory access time. For both proposed cost functions, we show that the corresponding problems are NP-complete. However, we show that the special cases where the graphs are in-trees or out-trees can be solved in polynomial time.

Keywords: Graph ordering; Integrated circuit simulation; Complexity

Article Outline

1. Introduction
2. Models
2.1. Directed sum cut
2.2. Uniform cost stack
2.2.1. Optimal execution of an order
2.3. Remarks
3. The DSC model
3.1. Complexity
3.2. Polynomial cases
3.2.1. In-tree
3.2.2. Out-tree
4. The UCS model
4.1. Complexity of UCS for a bipartite graph
4.2. Polynomial cases
4.2.1. In-tree
4.2.2. Out-tree
5. Conclusion
References













Discrete Applied Mathematics
Volume 155, Issue 14, 1 September 2007, Pages 1795-1811
3rd Cologne/ Twente Workshop on Graphs and Combinatorial Optimization - CTW2004
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.