Table of Contents

Introduction

Chapter 1 Context

1.1. Embedded systems

1.2. Memory management for decreasing power consumption, performance and area in embedded systems

1.3. State of the art in optimization techniques for memory management and data assignment

1.4. Operations research and electronics

Chapter 2 Unconstrained Memory Allocation Problem

2.1. Introduction

2.2. An ILP formulation for the unconstrained memory allocation problem

2.3. Memory allocation and the chromatic number

2.4. An illustrative example

2.5. Three new upper bounds on the chromatic number

2.6. Theoretical quality assessment of three upper bounds

2.7. Computational assessment of three upper bounds

2.8. Conclusion

Chapter 3 Memory Allocation Problem With Constraint on the Number of Memory Banks

3.1. Introduction

3.2. An ILP formulation for the memory allocation problem with constraint on the number of memory banks

3.3. An illustrative example

3.4. Proposed metaheuristics

3.5. Computational results and discussion

3.6. Conclusion

Chapter 4 General Memory Allocation Problem

4.1. Introduction

4.2. ILP formulation for the general memory allocation problem

4.3. An illustrative example

4.4. Proposed metaheuristics

4.5. Computational results and discussion

4.6. Statistical analysis

4.7. Conclusion

Chapter 5 Dynamic Memory Allocation Problem

5.1. Introduction

5.2. ILP formulation for dynamic memory allocation problem

5.3. An illustrative example

5.4. Iterative metaheuristic approaches

5.5. Computational results and discussion

5.6. Statistical analysis

5.7. Conclusion

Chapter 6 MemExplorer: Cases Studies

6.1. The design flow

6.2. Example of MemExplorer utilization

Chapter 7 General Conclusions and Future Work

7.1. Summary of the memory allocation problem versions

7.2. Intensification and diversification

7.3. Conclusions

7.4. Future works

Bibliography

Index