Bibliography

[ANG 05] ANGIOLINI F., BENINI L., CAPRARA A., “An efficient profile-based algorithm for scratchpad memory partitioning”, IEEE Transactions on CAD of Integrated Circuits and Systems, vol. 24, no. 11, pp. 1660–1676, 2005.

[AOU 10a] AOUAD M.I., IDOUMGHAR L., SCHOTT R., ZENDRA O., “Reduction of energy consumption in embedded systems: a hybrid evolutionary algorithm”, Proceedings of the 3rd International Conference on Metaheuristics and Nature Inspired Computing, vol. 95, Djerba, Tunisia, 27–31 October 2010.

[AOU 10b] AOUAD M.I., IDOUMGHAR L., SCHOTT R., ZENDRA O., “Sequential and distributed hybrid GA-SA algorithms for energy optimization in embedded systems”, Proceedings of the International Conference Applied Computing, Timisoara, Roumania, pp. 167–174, 21–23 October 2010.

[AOU 10c] AOUAD M.I., SCHOTT R., ZENDRA O., “A Tabu search heuristic for scratch-pad memory management”, Proceedings of the International Conference on Software Engineering and Technology, Rome, Italy, pp. 386–390, 28–30 April 2010.

[AOU 10d] AOUAD M.I., SCHOTT R., ZENDRA O., “Genetic heuristics for reducing memory energy consumption in embedded systems”, Proceedings of the 5th International Conference on Software Engineering and Data Technologies, Athens, Greece, pp. 394–402, 22–24 July 2010.

[AOU 10e] AOUAD M.I., SCHOTT R., ZENDRA O., “Hybrid heuristics for optimizing energy consumption in embedded systems”, Proceedings of the 25th International Symposium on Computer and Information Sciences, London, pp. 409–414, 22–24 September 2010.

[AVI 02] AVISSAR O., BARUA R., STEWART D., “An optimal memory allocation scheme for scratch-pad-based embedded systems”, ACM Transactions on Embedded Computing Systems, vol. 1, no. 1, pp. 6–26, 2002.

[BAJ 97] BAJWA R., HIRAKI M., KOJIMA H., GORNY D., NITTA K., SHRIDHAR A., SEKI K., SASAKI K., “Instruction buffering to reduce power in processors for signal processing”, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 5, no. 4, pp. 417–424, 1997.

[BAL 88] BALAKRISHNAN M., MAJUMDAR A., BANERJI D., LINDERS J., MAJITHIA J., “Allocation of multiport memories in data path synthesis”, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 7, no. 4, pp. 536–540, 1988.

[BAL 07] BALASA F., Z. H., LUICAN I., “Computation of storage requirements for multi-dimensional signal processing applications”, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 15, no. 4, pp. 447–460, 2007.

[BAL 08] BALASA F., KJELDSBERG P. G., VANDECAPPELLE A., PALKOVIC M., HU Q., ZHU H., CATTHOOR F., “Storage estimation and design space exploration methodologies for the memory management of signal processing applications”, Journal of Signal Processing Systems, vol. 53, nos. 1–2, pp. 51–71, 2008.

[BAN 02] BANAKAR R., STEINKE S., LEE B.-S., BALAKRISHNAN M., MARWEDEL P., “Scratchpad memory: design alternative for cache on-chip memory in embedded systems”, Proceedings of the 10th International Symposium on Hardware/Software Codesign, New York, pp. 73–78, 6–8 May 2002.

[BAR 06] BARR M., MASSA A., Programming Embedded Systems: With C and GNU Development Tools, 2nd ed., O’Reilly Media, 2006.

[BAT 94] BATTITI R., TECCHIOLLI G., “The reactive Tabu search”, Informs Journal on Computing, vol. 6, no. 2, pp. 126–140, 1994.

[BEN 00a] BENINI L., MACII A., MACII E., PONCINO M., “Increasing energy efficiency of embedded systems by application-specific memory hierarchy generation”, IEEE Design and Test Computers, vol. 17, no. 2, pp. 74–85, 2000.

[BEN 00b] BENINI L., MACII A., PONCINO M., “A recursive algorithm for low-power memory partitioning”, Proceedings of the International Symposium on Low Power Electronics and Design, Rapallo, Italy, pp. 78–83, 26–27 July 2000.

[BEN 00c] BENINI L., MICHELI G., “System-level power optimization: techniques and tools”, ACM Transactions on Design Automation of Electronic Systems, vol. 5, no. 2, pp. 115–192, 2000.

[BEN 02a] BENINI L., BRUNI D., MACII A., MACII E., “Hardware-assisted data compression for energy minimization in systems with embedded processors”, Proceedings of the Conference on Design, Automation and Test in Europe, Washington, DC, pp. 449–453, 2002.

[BEN 02b] BENINI L., BRUNI D., RICCÒ B., MACII A., MACII E., “An adaptive data compression scheme for memory traffic minimization in processor-based systems”, Proceedings of IEEE International Symposium on Circuits and Systems., pp. 866–869, 2002.

[BEN 02c] BENINI L., MACCHIARULO L., MACII A., PONCINO M., “Layout-driven memory synthesis for embedded systems-on-chip”, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 10, no. 2, pp. 96–105, 2002.

[BES 04] BESBES H., JEBARA S. F., “A solution to reduce noise enhancement in pre-whitened LMS-type algorithms: the double direction adaptation”, Proceedings of the Control, Communications and Signal Processing, pp. 717–720, 2004.

[BLA 05] BLACK P., “Greedy algorithm”, Dictionary of Algorithms and Data Structures, U.S. National Institute of Standards and Technology, 2005.

[BLA 10] BLAZY S., ROBILLARD B., APPEL A., “Formal verification of coalescing graph-coloring register allocation”, Proceedings of the European Symposium On Programming, Paphos, Cyprus, pp. 145–164, 2010.

[BRÉ 79] BRÉLAZ D., “New methods to color the vertices of a graph”, Communications of the Association of Computer Machinery, vol. 22, no. 4, pp. 251–256, 1979.

[BRE 08] BRENNER U., STRUZYNA M., VYGEN J., “BonnPlace: placement of leading-edge chips by advanced combinatorial algorithms”, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 27, no. 9, pp. 1607–1620, 2008.

[BRO 00] BROCKMEYER E., GHEZ C., BAETENS W., CATTHOOR F., “Low-power processor-level data transfer and storage exploration”, European Low Power Initiative for electronic system Design. Unified low-power design flow for data-dominated multimedia and telecom applications, Kluwer Academic Publishers, Dordrecht, pp. 26–63, 2000.

[BUI 08] BUI T., NGUYEN T., PATEL C., PHAN K., “An ant-based algorithm for coloring graphs”, Discrete Applied Mathematics, vol. 156, no. 2, pp. 190–200, 2008.

[CAR 66] CARLSON R., NEMHAUSER G., “Scheduling to minimize interaction cost”, Operations Research, vol. 14, no. 1, pp. 52–58, 1966.

[CAR 08] CARAMIA M., DELL’OLMO P., “Coloring graphs by iterated local search traversing feasible and infeasible solutions”, Discrete Applied Mathematics, vol. 156, no. 2, pp. 201–217, 2008.

[CAT 94] CATTHOOR F., FRANSSEN F., WUYTACK S., NACHTERGAELE L., DE MAN H., “Global communication and memory optimizing transformations for low power signal processing systems”, Proceedings of the VLSI Signal Processing, VII, pp. 178–187, 1994.

[CAT 98a] CATTHOOR F., JANSSEN M., NACHTERGAELE L., DE MAN H., “System-level data-flow transformation exploration and power-area trade-offs demonstrated on video coders”, The Journal of VLSI Signal Processing, vol. 18, no. 1, pp. 39–50, 1998.

[CAT 98b] CATTHOOR F., WUYTACK S., DE GREEF E., F.B., NACHTERGAELE L., VANDECAPPELLE A., Custom Memory Management Methodology, Kluwer Academic Publishers, 1998.

[CAT 98c] CATTHOOR F., WUYTACK S., DE GREEF E., FRANSSEN F., NACHTERGAELE L., DE MAN H., “System-level transformations for low power data transfer and storage”, Proceedings of the Low-Power CMOS Design, Monastir, Tunisia, pp. 609–618, 1998.

[CAT 01] CATTHOOR F., DANCKAERT K., WUYTACK S., DUTT N., “Code transformations for data transfer and storage exploration preprocessing in multimedia processors”, IEEE Design and Test computers, vol. 18, no. 3, pp. 70–82, 2001.

[CHA 95] CHANDRAKASAN A., POTKONJAK M., MEHRA R., RABAEY J., BRODERSEN R., “Optimizing power using transformations”, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 14, no. 1, pp. 12–31, 1995.

[CHA 04] CHAITIN G., “Register allocation and spilling via graph coloring”, SIGPLAN Notices, vol. 39, no. 4, pp. 66–74, 2004.

[CHA 09] CHANG Y.-W., JIANG Z.-W., CHEN T.-C., “Essential issues in analytical placement algorithms”, Information and Media Technologies, vol. 4, no. 4, pp. 815–836, 2009.

[CHI 02] CHIMIENTIA A., FANUCCI L., LOCATELLIC R., SAPONARAC S., “VLSI architecture for a low-power video codec system”, Microelectronics Journal, vol. 33, no. 5, pp. 417–427, 2002.

[CHI 07] CHIARANDINI M., PAQUETE, PREUSS M., RIDGE E., Experiments on metaheuristics: methodological overview and open issues, Report no. DMF-2007-03-003, The Danish Mathematical Society, Denmark, 2007.

[CHO 09] CHO D., PASRICHA S., ISSENIN I., DUTT N., AHN M., PAEK Y., “Adaptive scratch pad memory management for dynamic behavior of multimedia applications”, Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 28, no. 4, pp. 554–567, 2009.

[COJ 06] COJA-OGHLAN A., KUHTZ L., “An improved algorithm for approximating the chromatic number of Gn,p”, Information Processing Letters, vol. 99, no. 6, pp. 234–238, 2006.

[COL 91] COLORNI A., DORIGO M., MANIEZZO V., “Distributed optimization by ant colonies”, Proceedings of European Conference on Artificial Life, Paris, France, pp. 134–142, 1991.

[CON 99] CONOVER W. J., Practical Nonparametric Statistic, 3rd ed., Wiley, New York, 1999.

[CON 09] CONG J., JIANG W., LIU B., ZOU Y., “Automatic memory partitioning and scheduling for throughput and power optimization”, Proceedings of the IEEE/ACM International Conference on Computer-Aided Design – Digest of Technical Papers, ACM, New York, pp. 697–704, 2–5 November 2009.

[COR 90] CORMEN T., LEISERSON C., RIVEST R., STEIN C., “Greedy Algorithms”, in Introduction to Algorithms, 2nd ed., The Massachusetts Institute of Technology, pp. 370–404, 1990.

[COR 10] CORVINO R., GAMATIÉ A., BOULET P., “Architecture exploration for efficient data transfer and storage in data-parallel applications”, Proceedings of the 16th International Euro-Par Conference on Parallel Processing: Part I, Berlin, Heidelberg, pp. 101–116, 2010.

[COU 06] COUSSY P., CASSEAU E., BOMEL P., BAGANNE A., MARTIN E., “A formal method for hardware IP design and integration under I/O and timing constraints”, ACM Transactions on Embedded Computing System, vol. 5, no. 1, pp. 29–53, 2006.

[COU 09] COUSSY P., ROSSI A., SEVAUX M., SÖRENSEN K., TRABELSI K., “VNS for high-level synthesis”, Proceedings of 8th Metaheuristics International Conference, MIC 2009, Hamburg, Germany, pp. 173:1–173:10, 2009.

[CRÉ 10] CRÉPUT J.-C., DAFALI R., ROSSI A., SEVAUX M., ZERBO B., “From simple heuristics to evolutionary approach for routing messages in a NoC”, Proceedings of 10th Anniversary of the Metaheuristic Community, Lorient, France, pp. 55–57, 2010.

[CUP 98] CUPAK M., KULKARNI C., CATTHOOR F., DE MAN H., “Functional validation of system-level loop transformations for power efficient caching”, Proceedings of the Workshop on System Design Automation, Dresden, Germany, 30–31 March 1998.

[CUT 08] CUTCUTACHE I., WONG W.-F., “Fast, frequency-based, integrated register allocation and instruction scheduling”, Software: Practice and Experience, vol. 38, no. 11, pp. 1105–1126, 2008.

[DAF 08] DAFALI R., DIGUET J.-P., SEVAUX M., “Key research issues for reconfigurable Network-on-Chip”, Proceedings of the International Conference on ReConFigurable Computing and FPGAs, ReConFig’08, Cancun, Mexico, pp. 181–186, 2008.

[DAN 57] DANTZIG G. B., “Discrete-variable extremum problems”, Operations Research, vol. 5, no. 2, pp. 266–288, 1957.

[DEG 95] DE GREEF E., CATTHOOR F., DE MAN H., “Mapping real-time motion estimation type algorithms to memory efficient, programmable multi-processor architectures”, Microprocessing and Microprogramming, vol. 41, nos. 5-6, pp. 409–423, 1995. [Parallel programmable architectures and compilation.]

[DEG 97] DE GREEF E., CATTHOOR F., DE MAN H., “Memory size reduction through storage order optimization for embedded parallel multimedia applications”, Proceedings of Workshop on Parallel Processing and Multimedia, Geneva, Switzerland, pp. 84–98, 1997.

[DIE 05] DIESTEL R., Graph Theory, vol. 173 of Graduate Texts in Mathematics, Springer-Verlag, Heidelberg, 2005.

[DIM 11] DIMACS, 2011, available at http://mat.gsia.cmu.edu/COLOR/instances.html.

[DU 08] DU X., LI Z., GAO X., YAN L., “Optimizing the performance of chip shooter machine based on improved genetic algorithm”, Proceedings of the 7th World Congress on Intelligent Control and Automation, Chongqing, China, pp. 2849–2853, 2008.

[EGG 08] EGGER B., LEE J., SHIN H., “Dynamic scratchpad memory management for code in portable systems with an MMU”, ACM Transactions on Embedded Computing Systems, vol. 7, no. 2, pp. 11:1–11:38, 2008.

[FAR 95] FARRAHI A., TÉLLEZ G., SARRAFZADEH M., “Memory segmentation to exploit sleep mode operation”, Proceedings of the 32nd annual ACM/IEEE Design Automation Conference, New York, pp. 36–41, 1995.

[FIC 09] FICO, “Xpress-MP”, 2009, available at http://www.dashoptimization.com/

[FRA 94] FRANSSEN F., NACHTERGAELE L., SAMSOM H., CATTHOOR F., DE MAN H., “Control flow optimization for fast system simulation and storage minimization [real-time multidimensional signal processing]”, Proceedings of the European Conference on Design Automation, Paris, France, pp. 20–24, 1994.

[FRA 04] FRANCESCO P., MARCHAL P., ATIENZA D., BENINI L., CATTHOOR F., MENDIAS J., “An integrated hardware/software approach for run-time scratchpad management”, Proceedings of the 41st annual Design Automation Conference, New York, pp. 238–243, 2004.

[FRI 37] FRIEDMAN M., “The use of ranks to avoid the assumption of normality implicit in the analysis of variance”, Journal of the American Statistical Association, vol. 32, pp. 675–701, 1937.

[GAJ 92] GAJSKI D., DUTT N., WU A., LIN S., High-Level synthesis: Introduction to Chip and System Design, Kluwer Academic Publishers, Norwell, MA, 1992.

[GAL 99] GALINIER P., HAO J.-K., “Hybrid evolutionary algorithms for graph coloring”, Journal of Combinatorial Optimization, vol. 3, pp. 379–397, 1999.

[GAR 79] GAREY M., JOHNSON D., Computers and Intractability; A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, 1979.

[GAU 93] GAUT, “High-level synthesis tool”, 1993, available at http://hls-labsticc.univ-ubs.fr/.

[GLO 97] GLOVER F., LAGUNA M., Tabu Search, Kluwer Academic Publisher, Dordrecht, The Netherlands, 1997.

[GLO 98] GLOVER F., “A template for scatter search and path relinking”, Proceedings of the 3rd European Conference, Artificial evolution, vol. 1363, Nîmes, France, pp. 13–54, 1998.

[GLO 00] GLOVER F., LAGUNA M., MARTÍ R., “Fundamentals of scatter search and path relinking”, Control and Cybernetics, vol. 39, pp. 653–684, 2000.

[GNU 09] GNU, GLPK Linear Programming Kit, 2009, available at http://www.gnu.org/software/glpk/.

[GON 96] GONZALEZ R., HOROWITZ M., “Energy dissipation in general purpose microprocessors”, IEEE Journal of Solid-State Circuits, vol. 31, no. 9, pp. 1277–1284, 1996.

[GON 02] GONZÁLEZ-VELARDE J.-L., LAGUNA M., “Tabu search with simple ejection chains for coloring graphs”, Annals of Operations Research, vol. 117, no. 1, pp. 165–174, 2002.

[GRA 11] Graph coloring, 2011, available at http://en.wikipedia.org/wiki /Graph_coloring.

[GRU 07] GRUND D., HACK S., “A fast cutting-plane algorithm for optimal coalescing”, Proceedings of the 16th International Conference on Compiler Construction, Berlin, Heidelberg, pp. 111–125, 2007.

[HAN 09] HANSEN P., MANIEZZO V., VOSSS., “Special issue on mathematical contributions to metaheuristics editorial”, Journal of Heuristics, vol. 15, no. 3, pp. 197–199, 2009.

[HEA 03] HEATH S., Embedded Systems Design, 2nd ed., EDN series for design engineers, Elsevier, 2003.

[HEL 03] HELD S., KORTE B., MASSERG J., RINGE M., VYGEN J., “Clock scheduling and clocktree construction for high performance ASICS”, Proceedings of the 2003 IEEE/ACM International Conference on Computer-Aided Design, Washington, DC, pp. 232–239, 2003.

[HEN 07] HENNESSY J., PATTERSON D., Computer Architecture, a Quantitative Approach, 4th ed., Morgan Kaufmann, San Francisco, CA, 2007.

[HER 87] HERZ A., DE WERRA D., “Using tabu search techniques for graph coloring”, Computing, vol. 39, no. 4, pp. 345–351, 1987.

[HER 08] HERTZ A., PLUMETTAZ M., ZUFFEREY N., “Variable space search for graph coloring”, Discrete Applied Mathematics, vol. 156, no. 13, pp. 2551–2560, 2008.

[HUA 09] HUANG S.-H., CHENG C.-H., “Minimum-period register binding”, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 28, no. 8, pp. 1265–1269, 2009.

[IDO 10] IDOUMGHAR L., IDRISSI AOUAD M., MELKEMI M., SCHOTT R., “Metropolis particle swarm optimization algorithm with mutation operator for global optimization problems”, Proceedings of the 22th International Conference on Tools with Artificial Intelligence, Arras, France, pp. 35–42, 2010.

[INN 10] E-LAB INNOVATION & OPTIMISATION B., “LocalSolver 1.0”, 2010, available at http://e-lab.bouygues.com/?p=693.

[ISS 07] ISSENIN I., BROCKMEYER E., MIRANDA M., DUTT N., “DRDU: a data reuse analysis technique for efficient scratch-pad memory management”, ACM Transactions on Design Automation of Electronic Systems, vol. 12, no. 2, ACM, New York, April 2007.

[IVE 99] IVERSON M., OZGUNER F., POTTER L., “Statistical prediction of task execution times through analytic benchmarking for scheduling in a heterogeneous environment”, IEEE Transactions on Computers, vol. 48, no. 12, pp. 1374–1379, 1999.

[KAM 08] KAMAL R., Embedded Systems. Architecture, Programming and Design, 2nd ed., Tata McGraw-Hill, 2008.

[KAN 05] KANDEMIR M., IRWIN M., CHEN G., KOLCU I., “Compiler-guided leakage optimization for banked scratch-pad memories”, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 13, no. 10, pp. 1136–1146, 2005.

[KAR 72] KARP R., “Reducibility amongcombinatorial problems”, Complexity of Computer Computation, pp. 85–103, 1972.

[KHA 09] KHAN S., SHIN H., “Effective memory access optimization by memory delay modeling, memory allocation, and buffer allocation”, Proceedings of the International SoC Design Conference, Busan, Korea, pp. 153–156, 2009.

[KIE 11] KIEFFER Y., “Recherche opérationnelle pour la CAO micro-électronique”, GDR-RO micro-électronique, 2011.

[KLO 02] KLOTZ W., Graph coloring algorithms, Report, Mathematik-Bericht, Clausthal University of Technology, Clausthal, Germany, 2002.

[KNU 94] KNUTH D.E., “The Sandwich Theorem”, The Electronic Journal of Combinatorics, vol. 1, no. 1, pp. 1–49, 1994.

[KOE 06] KOES D.R., GOLDSTEIN S.C., An analysis of graph coloring register allocation, Report no. CMU-CS-06-111, Carnegie Mellon University, March 2006.

[KOE 09] KOES D.R., GOLDSTEIN S.C., “Register allocation deconstructed”, Proceedings of the 12th International Workshop on Software and Compilers for Embedded Systems, New York, pp. 21–30, 2009.

[KOL 94] KOLSON D., NICOLAU A., DUTT N., “Minimization of memory traffic in high-level synthesis”, Proceedings of the 31st Conference on Design Automation, San Diego, CA, pp. 149–154, 1994.

[KOL 95] KOLEN A., LENSTRA J., Chapter “Combinatorics in operations research”, Handbook of Combinatorics, Elsevier Science, Amsterdam, The Netherlands, pp. 1875–1910, 1995.

[KOR 04] KORANNE S., “A note on system-on-chip test scheduling formulation”, Journal of Electronic Testing, vol. 20, no. 3, pp. 309–313, 2004.

[KOR 08] KORTE B., VYGEN J., “Combinatorial problems in chip design”, in TÓTH G.F., KATONA G.O.H., LOVÁSZ L., PÁLFY P.P., RECSKI A., STIPSICZ A., SZÁSZ D., MIKLÓS D.O., GRÖTSCHEL M., KATONA G.O.H., SGI G. (eds), Building Bridges, vol. 19 of Bolyai Society Mathematical Studies, Springer Berlin Heidelberg, pp. 333–368, 2008.

[KUM 07] KUMAR T.R., RAVIKUMAR C., GOVINDARAJAN R., “MAX: a multi objective memory architecture eXploration framework for embedded systems-on-chip”, Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference on Embedded Systems, Bangalore, India, pp. 527–533, 2007.

[KUR 87] KURDAHI F.J., PARKER A.C., “REAL: a program for REgister ALlocation”, Proceedings of the 24th ACM/IEEE Design Automation Conference, New York, pp. 210–215, 1987.

[LAB 06] LAB-STICC, Soft Explorer, 2006, available at http://www.softexplorer.fr/.

[LAB 11] LAB-STICC, 2011, available at http://www.lab-sticc.fr/.

[LAC 03] LACOMME P., PRINS C., SEVAUX M., Algorithmes de graphes, Eyrolles, 2003.

[LEE 02] LEE W., CHANG M., “A study of dynamic memory management in C++ programs”, Computer Languages Systems and Structures, vol. 28, no. 3, pp. 237–272, 2002.

[LIP 93] LIPPENS P., VAN MEERBERGEN J., VERHAEGH W., VAN DER WERF A., “Allocation of multiport memories for hierarchical data streams”, Proceedings of the International Conference on Computer-Aided Design, IEEE/ACM, Santa Clara CA, pp. 728–735, 1993.

[LUI 07a] LUICAN I., ZHU H., BALASA F., “Mapping model with inter-array memory sharing for multidimensional signal processing”, Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, Piscataway, NJ, pp. 160–165, 2007.

[LUI 07b] LUICAN I., ZHU H., BALASA F., “Signal-to-memory mapping analysis for multimedia signal processing”, Proceedings of the 2007 Asia and South Pacific Design Automation Conference, Washington, DC, pp. 486–491, 2007.

[MÉN 08] MÉNDEZ-DÍAZ I., ZABALA P., “A cutting plane algorithm for graph coloring”, Discrete Applied Mathematics, vol. 156, no. 2, pp. 159–179, 2008.

[MAC 05] MACCI A., “Memory organization for low-energy embedded systems”, Low-Power Electronics Design, Computer Engineering Series, CRC Press LLC, pp. 26:1–26:12, 2005.

[MAH 09] MAHAJAN A., ALI M., “Hybrid evolutionary algorithm for the graph coloring register allocation problem for embedded systems”, Transactions on Computational Science V, vol. 5540 of Lecture Notes in Computer Science, Springer Berlin / Heidelberg, pp. 206–219, 2009.

[MAN 09] MANIEZZO V., STÜTZLE T., VOSS S., Matheuristics: Hybridizing Metaheuristics and Mathematical Programming, vol. 10 of Annals of information systems, Springer, New York, 2009.

[MAR 03] MARKOVSKIY Y., Distributed Memory Allocation Problem, 2003, available at http://www.eng.ucy.ac.cy/theocharides/Courses/ECE656/memory_problem.pdf.

[MAR 10a] MARCHETTI O., Problématiques d’optimisation discrète en micro-électronique, GDR-RO micro-électronique, 2010.

[MAR 10b] MARCHETTI O., Synthèse du projet problématiques d’optimisation discrète en micro-électronique, GDR-RO micro-électronique, 2010.

[MAS 99] MASSELOS K., CATTHOOR F., GOUTIS C., DEMAN H., “A performance-oriented use methodology of power optimizing code transformations for multimedia applications realized on programmable multimedia processors”, Proceedings of the IEEE Workshop on Signal Processing Systems, Taipei, Taiwan, pp. 261–270, 1999.

[MEH 96] MEHROTRA A., TRICK M., “A column generation approach for graph coloring”, INFORMS Journal on Computing, vol. 8, no. 4, pp. 344–354, 1996.

[MEN 95] MENG T., GORDON B., TSERN E., HUNG A., “Portable video-on-demand in wireless communication”, Proceedings of the IEEE, vol. 83, no. 4, pp. 659–680, 1995.

[MLA 97] MLADENOVIĆ N., HANSEN P., “Variable neighbourhood decomposition search”, Computers and Operations Research, vol. 24, no. 11, pp. 1097–1100, 1997.

[MUR 08] MURRAY A., FRANKE B., “Fast source-level data assignment to dual memory banks”, Proceedings of the 11th International Workshop on Software and Compilers for Embedded Systems, New York, pp. 43–52, 2008.

[NAC 96] NACHTERGAELE L., CATTHOOR F., KAPOOR B., JANSSENS S., MOOLENAAR D., “Low power storage exploration for H.263 video decoder”, Proceedings VLSI Signal Processing, IX, San Francisco, California, pp. 115–124, October 1996.

[NAC 01] NACHTERGAELE L., CATTHOOR F., KULKARNI C., “Random-access data storage components in customized architectures”, Design Test of Computers, IEEE, vol. 18, no. 3, pp. 40–54, 2001.

[NAM 04] NAMHOON K., PENG R., “A memory allocation assignment method using multiway partitioning”, Proceedings of the Conference, Newtonmore, Scotland, pp. 143–144, 2004.

[NOE 05] NOERGAARD T., Embedded Systems Architecture, Embedded Technology, Elsevier, 2005.

[OZT 09] OZTURK O., KANDEMIR M., IRWIN M., “Using data compression for increasing memory system utilization”, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 28, no. 6, pp. 901–914, 2009.

[PAN 97a] PANDA P., DUTT N., NICOLAU A., “Architectural exploration and optimization of local memory in embedded systems”, Proceedings of the 10th International Symposium on System Synthesis, Antwerp, Belgium, pp. 90–97, 17–19 September 1997.

[PAN 97b] PANDA P., DUTT N., NICOLAU A., “Efficient utilization of scratch-pad memory in embedded processor applications”, Proceedings of the European Design and Test Conference, Paris, France, pp. 7–11, 1997.

[PAN 99] PANDA P., NICOLAU A., DUTT N., Memory Issues in Embedded Systems-on-Chip: Optimizations and Exploration, Kluwer Academic Publishers, Hingham, MA, 1999.

[PAN 00] PANDA P., DUTT N., NICOLAU A., “On-chip vs. off-chip memory: the data partitioning problem in embedded processor-based systems”, ACM Transactions on Design Automation of Electronic Systems, vol. 5, no. 3, pp. 682–704, 2000.

[PAN 01a] PANDA P., DUTT N., NICOLAU A., CATTHOOR F., VANDECAPPELLE A., BROCKMEYER E., KULKARNI C., DE GREEF E., “Data Memory Organization and Optimizations in Application-Specific Systems”, IEEE Design & Test of Computers, vol. 18, no. 3, pp. 56–68, 2001.

[PAN 01b] PANDA P.R., CATTHOOR F., DUTT N.D., DANCKAERT K., BROCKMEYER E., KULKARNI C., VANDERCAPPELLE A., KJELDSBERG P.G., “Data and memory optimization techniques for embedded systems”, ACM Transactions on Design Automation of Electronic Systems, vol. 6, no. 2, pp. 149–206, 2001.

[PER 08] PEREIRA Q., F. M., JENS P., “Register allocation by puzzle solving”, SIGPLAN Not, vol. 43, no. 6, pp. 216–226, 2008.

[PEY 09] PEYER S., RAUTENBACH D., VYGEN J., “A generalization of Dijkstra’s shortest path algorithm with applications to VLSI routing”, Journal of Discrete Algorithms, vol. 7, no. 4, pp. 377–390, 2009.

[PIN 93] PINTER S., “Register allocation with instruction scheduling”, SIGPLAN Notices, vol. 28, no. 6, pp. 248–257, 1993.

[POR 09a] PORUMBEL D., “DIMACS graphs: benchmark instances and best upper bound”, 2009, available at http://www.info.univ-angers.fr/pub/porumbel/graphs/.

[POR 09b] PORUMBEL D., HAO J.-K., KUNTZ. P., “Diversity control and multi-parent recombination for evolutionary graph coloring algorithms”, Proceedings of the 9th Conference on Evolutionay Computation in Combinatorial Optimization, Tübingen, Germany, pp. 121–132, 2009.

[POR 10] PORUMBEL D., HAO J.-K., KUNTZ P., “A search space cartography for guiding graph coloring heuristics”, Computers and Operations Research, vol. 37, no. 4, pp. 769–778, 2010.

[RAB 02] RABAEY J., CHANDRAKASAN A., NIKOLIC B., Digital Integrated Circuits: A Design Perspective, 2nd ed., Prentice-Hall, 2002.

[RAM 05] RAMACHANDRAN A., JACOME M., “Xtream-fit: an energy-delay efficient data memory subsystem for embedded media processing”, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 24, no. 6, pp. 832–848, 2005.

[REG 04] REGO C., GLOVER F., “Local search and metaheuristics”, in DU D.-Z., PARDALOS P. M., GUTIN G., PUNNEN A., (eds), The Traveling Salesman Problem and Its Variations, vol. 12 of Combinatorial Optimization, Springer pp. 309–368, 2004.

[ROS 08] ROSSI A., SEVAUX M., “Mixed-integer linear programming formulation for High Level Synthesis”, Proceedings of the 11th International Workshop on Project Management and Scheduling, PMS 2008, Istanbul, Turkey, pp. 222–226, 2008.

[SCH 92] SCHÖNFELD M., SCHWIEGERSHAUSEN M., PIRSCH P., “Synthesis of intermediate memories for the data supply to processor arrays”, Proceedings of the International Workshop on Algorithms and Parallel VLSI Architectures II, Amsterdam, The Netherlands, pp. 365–370, 1992.

[SEN 09] SENN E., MONNEREAU D., ROSSI A., JULIEN N., “Using integer linear programming in test-bench generation for evaluating communication processors”, Proceedings of the 2009 12th Euromicro Conference on Digital System Design, Architectures, Methods and Tools, Washington, DC, pp. 217–220, 2009.

[SEV 11] SEVAUX M., SINGH A., ROSSI A., “Tabu search for multiprocessor scheduling: application to high level synthesis”, Asia-Pacific Journal of Operational Research, vol. 28, no. 2, pp. 201–212, 2011.

[SHE 07] SHENGNING W., SIKUN L., “Extending traditional graph-coloring register allocation exploiting meta-heuristics for embedded systems”, Proceedings of the 3rd International Conference on Natural Computation, Haikou, China, pp. 324–329, 2007.

[SHI 93] SHIN H., KIM C., “A simple yet effective technique for partitioning”, IEEE Transactions on Very Large Scale Integration Systems, vol. 1, no. 3, pp. 380–386, 1993.

[SHY 07] SHYAM K., GOVINDARAJAN R., “An array allocation scheme for energy reduction in partitioned memory architectures”, Proceedings of the 16th International Conference on Compiler Construction, Berlin, Heidelberg, pp. 32–47, 2007.

[SIN 03] SINGH M., PRASANNA V., “Algorithmic techniques for memory energy reduction”, Proceedings of the 2nd International Conference on Experimental and Efficient Algorithms, Berlin, Heidelberg, pp. 237–252, 2003.

[SIP 03] SIPKOVÀ V., “Efficient variable allocation to dual memory banks of DSPs”, Proceedings of the 7th International Workshop on Software and Compilers for Embedded Systems, Vienna, Austria, pp. 359–372, 2003.

[SLO 97] SLOCK P., WUYTACK S., CATTHOOR F., JONG G., “Fast and extensive system-level memory exploration for ATM applications”, Proceedings of the 10th International Symposium on System Synthesis, Anthwerp, Belgium, pp. 74–81, 1997.

[SÖR 03] SÖRENSEN K., A framework for robust and flexible optimization using metaheuristics, PhD Thesis, Universiteit Antwerpen, 2003.

[SOT 09] SOTO M., ROSSI A., SEVAUX M., “Two upper bounds on the chromatic number”, Proceedings of 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Paris, France, pp. 191–194, 2009.

[SOT 10] SOTO M., ROSSI A., SEVAUX M., “Métaheuristiques pour l’allocation de mémoire dans les systèmes embarqués”, Proceedings of the 11e congrès de la société Française de Recherche Opérationnelle et d’Aide à la Décision, Toulouse, France, pp. 35–43, 2010.

[SOT 11a] SOTO M., ROSSI A., SEVAUX M., “A mathematical model and a metaheuristic approach for a memory allocation problem”, Journal of Heuristics, Springer, The Netherlands, pp. 1–19, 2011.

[SOT 11b] SOTO M., ROSSI A., SEVAUX M., “Three new upper bounds on the chromatic number”, Discrete Applied Mathematics, vol. 159, no.18, pp. 2281–2289, 2011.

[SOT 11c] SOTO M., ROSSI A., SEVAUX M., “Two iterative metaheuristic approaches to dynamic memory allocation for embedded systems”, in MERZ P., HAO J.-K. (eds), Evolutionary Computation in Combinatorial Optimization, vol. 6622 of Lecture Notes in Computer Science, Springer, Berlin/Heidelberg, pp. 250–261, 2011.

[STA 01] STACHO L., “New upper bounds for the chromatic number of a graph”, Journal of Graph Theory, vol. 36, no. 2, pp. 117–120, 2001.

[STA 02] STACHO L., “A note on upper bound for the chromatic number of a graph”, Acta Mathematica Universitatis Comenianae, vol. 71, no. 1, pp. 1–2, 2002.

[STE 02] STEINKE S., WEHMEYER L., LEE B., MARWEDEL P., “Assigning program and data objects to scratchpad for energy reduction”, Proceedings of the Conference on Design, Automation and Test in Europe, Washington DC, pp. 409–415, 2002.

[STO 92] STOK L., JESS J.A.G., “Foreground memory management in data path synthesis”, International Journal of Circuit Theory and Applications, vol. 20, no. 3, pp. 235–255, 1992.

[TIW 94] TIWARI V., MALIK S., WOLFE A., “Power analysis of embedded software: a first step towards software power minimization”, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 2, no. 4, pp. 437–445, 1994.

[TOP 07] TOPCUOGLU H., DEMIROZ B., KANDEMIR M., “Solving the register allocation problem for embedded systems using a hybrid evolutionary algorithm”, Evolutionary Computation, vol. 11, no. 5, pp. 620–634, 2007.

[TOV 04] TOVEY C., “Honey bee algorithm: a biologically inspired approach to internet server optimization”, Engineering Enterprise: The Alumni Magazine for ISyE at Georgia Institute of Technology, Spring, pp. 13–15, 2004.

[TRA 08] TRABELSI K., COUSSY P., ROSSI A., SEVAUX M., “Ordonnancement et Assignation en Synthèse de Haut Niveau”, Congrès de la Société Française de Recherche Opérationnelle et d’Aide à la Décision, Clermont-Ferrand, France, 2008.

[TRA 10] TRABELSI K., SEVAUX M., COUSSY P., ROSSI A., SÖRENSEN K., “Advanced metaheuristics, for high-level synthesis”, Metaheuristics Springer, Berlin, 2010.

[TRO 02] TRONÇON R., BRUYNOOGHE M., JANSSENS G., CATTHOOR F., “Storage size reduction by in-place mapping of arrays”, Proceedings of the 3rd International Workshop on Verification, Model Checking, and Abstract Interpretation, London, pp. 167–181, 2002.

[TSE 86] TSENG C., SIEWIOREK D., “Automated synthesis of data paths in digital systems”, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 5, no. 3, pp. 379–395, 1986.

[VER 91] VERBAUWHEDE I., CATTHOOR F., VANDEWALLE J., MAN H., “In-place memory management of algebraic algorithms on application specific ICs”, The Journal of VLSI Signal Processing, vol. 3, no. 3, pp. 193–200, 1991.

[VER 04] VERMA M., WEHMEYER L., MARWECLEL P., “Dynamic overlay of scratchpad memory for energy minimization”, Proceedings of the International Conference on Hardware/Software Codesign and System Synthesis, Washington DC, pp. 104–109, 2004.

[VRE 03] VREDEVELD T., LENSTRA J., “On local search for the generalized graph coloring problem”, Operations Research Letters, vol. 31, no. 1, pp. 28–34, 2003.

[WEL 67] WELSH D. J.A., POWELL M.B., “An upper bound for the chromatic number of a graph and its application to timetabling problems”, The Computer Journal, vol. 10, no. 1, pp. 85–86, 1967.

[WUY 96] WUYTACK S., CATTHOOR F., NACHTERGAELE L., DE MAN H., “Power exploration for data dominated video applications”, Proceedings of the International Symposium on Low Power Electronics and Design, Monterey, CA, pp. 359–364, 1996.

[XIK 07] XIKUI L., YAN L., “Efficient DNA algorithms for chromatic number of graph problems”, Proceedings of the IEEE International Conference on Automation and Logistics, Jinan, China, pp. 450–454, 2007.

[ZEI 04] ZEITLHOFER T., WESS B., “A comparison of graph coloring heuristics for register allocation based on coalescing in interval graphs”, Proceedings of the International Symposium on Circuits and Systems, Vancouver, Canada, pp. 529–32, 2004.

[ZHA 11] ZHANG L., QIU M., SHA E., ZHUGE Q., “Variable assignment and instruction scheduling for processor with multi-module memory”, Microprocessors and Microsystems, vol. 35, no. 3, pp. 308–317, 2011.