LEADER 05579nam 2200757 a 450 001 9910828308103321 005 20240313134124.0 010 $a9781118577585 010 $a1118577582 010 $a9781299146303 010 $a1299146309 010 $a9781118577769 010 $a1118577760 010 $a9781118577660 010 $a1118577663 035 $a(CKB)2670000000327411 035 $a(EBL)1117268 035 $a(OCoLC)827208496 035 $a(SSID)ssj0000904833 035 $a(PQKBManifestationID)11494231 035 $a(PQKBTitleCode)TC0000904833 035 $a(PQKBWorkID)10924298 035 $a(PQKB)10774565 035 $a(OCoLC)828100066 035 $a(MiAaPQ)EBC1117268 035 $a(Au-PeEL)EBL1117268 035 $a(CaPaEBR)ebr10653848 035 $a(CaONFJC)MIL445880 035 $a(OCoLC)812570943 035 $a(FINmELB)ELB178707 035 $a(Perlego)1001169 035 $a(EXLCZ)992670000000327411 100 $a20121017d2013 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 00$aMemory allocation problems in embedded systems $eoptimization methods /$fMari?a Soto ... [et al.] 205 $a1st ed. 210 $aLondon $cISTE ;$aHoboken, N.J. $cWiley$d2013 215 $a1 online resource (198 p.) 225 0 $aComputer engineering series 300 $aDescription based upon print version of record. 311 08$a9781848214286 311 08$a1848214286 320 $aIncludes bibliographical references and index. 327 $aTitle Page; Contents; Introduction; Chapter 1. Context; 1.1. Embedded systems; 1.1.1. Main components of embedded systems; 1.2. Memory management for decreasing power consumption; 1.3. State of the art in optimization techniques for memory management and data assignment; 1.3.1. Software optimization; 1.3.2. Hardware optimization; 1.3.3. Data binding; 1.3.3.1. Memory partitioning problem for low energy; 1.3.3.2. Constraints on memory bank capacities and number of accesses to variables; 1.3.3.3. Using external memory; 1.4. Operations research and electronics 327 $a1.4.1. Main challenges in applying operations research to electronicsChapter 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.3.1. Bounds on the chromatic number; 2.4. An illustrative example; 2.5. Three new upper bounds on the chromatic number; 2.6. Theoretical 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 327 $a3.1. Introduction3.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.4.1. A tabu search procedure; 3.4.2. A memetic algorithm; 3.5. Computational results and discussion; 3.5.1. Instances; 3.5.2. Implementation; 3.5.3. Results; 3.5.4. 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 327 $a4.4.1. Generating initial solutions4.4.1.1. Random initial solutions; 4.4.1.2. Greedy initial solutions; 4.4.2. A tabu search procedure; 4.4.3. Exploration of neighborhoods; 4.4.4. A variable neighborhood search hybridized with a tabu search; 4.5. Computational results and discussion; 4.5.1. Instances used; 4.5.2. Implementation; 4.5.3. Results; 4.5.4. Discussion; 4.5.5. Assessing TabuMemex; 4.6. Statistical analysis; 4.6.1. Post hoc paired comparisons; 4.7. Conclusion; Chapter 5. Dynamic Memory Allocation Problem; 5.1. Introduction; 5.2. ILP formulation for dynamic memory allocation problem 327 $a5.3. An illustrative example5.4. Iterative metaheuristic approaches; 5.4.1. Long-term approach; 5.4.2. Short-term approach; 5.5. Computational results and discussion; 5.5.1. Results; 5.5.2. Discussion; 5.6. Statistical analysis; 5.6.1. Post hoc paired comparisons; 5.7. Conclusion; Chapter 6. MemExplorer: Cases Studies; 6.1. The design flow; 6.1.1. Architecture used; 6.1.2. MemExplorer design flow; 6.1.3. Memory conflict graph; 6.2. Example of MemExplorer utilization; Chapter 7. General Conclusions and Future Work 147; 7.1. Summary of the memory allocation problem versions 327 $a7.2. Intensification and diversification 330 $a Embedded systems are everywhere in contemporary life and are supposed to make our lives more comfortable. In industry, embedded systems are used to manage and control complex systems (e.g. nuclear power plants, telecommunications and flight control) and they are also taking an important place in our daily activities (e.g. smartphones, security alarms and traffic lights).In the design of embedded systems, memory allocation and data assignment are among the main challenges that electronic designers have to face. In fact, they impact heavily on the main cost metrics (power consumption, p 410 0$aISTE 606 $aEmbedded computer systems 615 0$aEmbedded computer systems. 676 $a006.22 701 $aSoto$b Mari?a$0920609 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910828308103321 996 $aMemory allocation problems in embedded systems$94100746 997 $aUNINA