A parallel evolutionary algorithm to optimize dynamic memory managers in embedded systems
For the last thirty years, several Dynamic Memory Managers (DMMs) have been proposed. Such DMMs include first fit, best fit, segregated fit and buddy systems. Since the performance, memory usage and energy consumption of each DMM differs, software engineers often face difficult choices in selecting...
Uloženo v:
| Vydáno v: | arXiv.org |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Paper |
| Jazyk: | angličtina |
| Vydáno: |
Ithaca
Cornell University Library, arXiv.org
28.06.2024
|
| Témata: | |
| ISSN: | 2331-8422 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | For the last thirty years, several Dynamic Memory Managers (DMMs) have been proposed. Such DMMs include first fit, best fit, segregated fit and buddy systems. Since the performance, memory usage and energy consumption of each DMM differs, software engineers often face difficult choices in selecting the most suitable approach for their applications. This issue has special impact in the field of portable consumer embedded systems, that must execute a limited amount of multimedia applications (e.g., 3D games, video players and signal processing software, etc.), demanding high performance and extensive memory usage at a low energy consumption. Recently, we have developed a novel methodology based on genetic programming to automatically design custom DMMs, optimizing performance, memory usage and energy consumption. However, although this process is automatic and faster than state-of-the-art optimizations, it demands intensive computation, resulting in a time consuming process. Thus, parallel processing can be very useful to enable to explore more solutions spending the same time, as well as to implement new algorithms. In this paper we present a novel parallel evolutionary algorithm for DMMs optimization in embedded systems, based on the Discrete Event Specification (DEVS) formalism over a Service Oriented Architecture (SOA) framework. Parallelism significantly improves the performance of the sequential exploration algorithm. On the one hand, when the number of generations are the same in both approaches, our parallel optimization framework is able to reach a speed-up of 86.40x when compared with other state-of-the-art approaches. On the other, it improves the global quality (i.e., level of performance, low memory usage and low energy consumption) of the final DMM obtained in a 36.36% with respect to two well-known general-purpose DMMs and two state-of-the-art optimization methodologies. |
|---|---|
| AbstractList | For the last thirty years, several Dynamic Memory Managers (DMMs) have been proposed. Such DMMs include first fit, best fit, segregated fit and buddy systems. Since the performance, memory usage and energy consumption of each DMM differs, software engineers often face difficult choices in selecting the most suitable approach for their applications. This issue has special impact in the field of portable consumer embedded systems, that must execute a limited amount of multimedia applications (e.g., 3D games, video players and signal processing software, etc.), demanding high performance and extensive memory usage at a low energy consumption. Recently, we have developed a novel methodology based on genetic programming to automatically design custom DMMs, optimizing performance, memory usage and energy consumption. However, although this process is automatic and faster than state-of-the-art optimizations, it demands intensive computation, resulting in a time consuming process. Thus, parallel processing can be very useful to enable to explore more solutions spending the same time, as well as to implement new algorithms. In this paper we present a novel parallel evolutionary algorithm for DMMs optimization in embedded systems, based on the Discrete Event Specification (DEVS) formalism over a Service Oriented Architecture (SOA) framework. Parallelism significantly improves the performance of the sequential exploration algorithm. On the one hand, when the number of generations are the same in both approaches, our parallel optimization framework is able to reach a speed-up of 86.40x when compared with other state-of-the-art approaches. On the other, it improves the global quality (i.e., level of performance, low memory usage and low energy consumption) of the final DMM obtained in a 36.36% with respect to two well-known general-purpose DMMs and two state-of-the-art optimization methodologies. |
| Author | Colmenar, J Manuel Risco-Martín, José L Garnica, Oscar Atienza, David |
| Author_xml | – sequence: 1 givenname: José surname: Risco-Martín middlename: L fullname: Risco-Martín, José L – sequence: 2 givenname: David surname: Atienza fullname: Atienza, David – sequence: 3 givenname: J surname: Colmenar middlename: Manuel fullname: Colmenar, J Manuel – sequence: 4 givenname: Oscar surname: Garnica fullname: Garnica, Oscar |
| BookMark | eNotzk1LAzEYBOAgCtbaH-At4HlrvpM9lqJWKHjpxVN5N5utKZukJrvF-utd0NNchmfmDl3HFB1CD5QshZGSPEH-9uclE0QvSS2lvEIzxjmtjGDsFi1KORJCmNJMSj5DHyt8ggx973rszqkfB58i5AuG_pCyHz4DHhJOp8EH_-Nwe4kQvMXBhTSVAkQ4uFywj9iFxrWta3G5lMGFco9uOuiLW_znHO1ennfrTbV9f31br7YVSEYrzagQNTe0IczKWgkuTKuU1cLYbnrIpeWsa4zV0FjVAlFQM0W15J2mDBo-R49_7Cmnr9GVYX9MY47T4p4TM-Fswvkvx59VnA |
| ContentType | Paper |
| Copyright | 2024. This work is published under http://creativecommons.org/licenses/by-sa/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: 2024. This work is published under http://creativecommons.org/licenses/by-sa/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | 8FE 8FG ABJCF ABUWG AFKRA AZQEC BENPR BGLVJ CCPQU DWQXO HCIFZ L6V M7S PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| DOI | 10.48550/arxiv.2407.09555 |
| DatabaseName | ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central ProQuest Central UK/Ireland ProQuest Central Essentials ProQuest Central Technology Collection ProQuest One ProQuest Central Korea SciTech Premium Collection ProQuest Engineering Collection Engineering Database ProQuest Central Premium ProQuest One Academic (New) ProQuest Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection |
| DatabaseTitle | Publicly Available Content Database Engineering Database Technology Collection ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest One Academic UKI Edition ProQuest Central Korea Materials Science & Engineering Collection ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) Engineering Collection |
| DatabaseTitleList | Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: PIMPY name: ProQuest Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Physics |
| EISSN | 2331-8422 |
| Genre | Working Paper/Pre-Print |
| GroupedDBID | 8FE 8FG ABJCF ABUWG AFKRA ALMA_UNASSIGNED_HOLDINGS AZQEC BENPR BGLVJ CCPQU DWQXO FRJ HCIFZ L6V M7S M~E PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| ID | FETCH-LOGICAL-a521-721449381b02c5964348d66c748cf55335c32fb8c7abc6da06a9261753f712ab3 |
| IEDL.DBID | PIMPY |
| IngestDate | Mon Jun 30 09:12:33 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a521-721449381b02c5964348d66c748cf55335c32fb8c7abc6da06a9261753f712ab3 |
| Notes | SourceType-Working Papers-1 ObjectType-Working Paper/Pre-Print-1 content type line 50 |
| OpenAccessLink | https://www.proquest.com/publiccontent/docview/3081442381?pq-origsite=%requestingapplication% |
| PQID | 3081442381 |
| PQPubID | 2050157 |
| ParticipantIDs | proquest_journals_3081442381 |
| PublicationCentury | 2000 |
| PublicationDate | 20240628 |
| PublicationDateYYYYMMDD | 2024-06-28 |
| PublicationDate_xml | – month: 06 year: 2024 text: 20240628 day: 28 |
| PublicationDecade | 2020 |
| PublicationPlace | Ithaca |
| PublicationPlace_xml | – name: Ithaca |
| PublicationTitle | arXiv.org |
| PublicationYear | 2024 |
| Publisher | Cornell University Library, arXiv.org |
| Publisher_xml | – name: Cornell University Library, arXiv.org |
| SSID | ssj0002672553 |
| Score | 1.8748622 |
| SecondaryResourceType | preprint |
| Snippet | For the last thirty years, several Dynamic Memory Managers (DMMs) have been proposed. Such DMMs include first fit, best fit, segregated fit and buddy systems.... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| SubjectTerms | Design optimization Embedded systems Energy consumption Evolutionary algorithms Genetic algorithms Managers Multimedia Optimization Parallel processing Performance enhancement Service oriented architecture Software |
| Title | A parallel evolutionary algorithm to optimize dynamic memory managers in embedded systems |
| URI | https://www.proquest.com/docview/3081442381 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV27TsMwFLWgBYmJt3iUygNr2tR2YmdCgIpgoIqgQztVfgUq5VGSUFG-HjtJYUBiYo5kXV07517bx-cAcIkxxTjw7AwQ6ZCB2acEmHtOZKqB9oiiAvHKbIKORmwyCcLmeXTR0CrXmFgBda32bHnbBoT7KpP2xLyPTSUjxJabq8WbYz2k7F1rY6ixCdpWeMttgXb48BhOv89ckE9NB43ry81KyqvP84_5sme3NT0rxub9guSqztzt_m-EeyYyvtD5PtjQ6QHYrtiesjgE02toJb_jWMdQL5vFx_MV5PGLGaN8TWCZwcygSTL_1FDVrvUwsazcFawJr3kB5ynUidAGuhSsFaGLIzC-G45v753GY8HhpnA71CqmBSZI4SLpWW0uwpTvS0qYjEyqsCcxigSTlAvpK-76PLAa7h6O6ABxgY9BK81SfQIgVzhiUkgxUIhoxpl2BeXcNGACaRr4p6CzTtus-U-K2U-Wzv7-fA52kGknLEkLsQ5olfm7vgBbclnOi7wL2jfDUfjUtczN524z7V_PN72E |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V09T8MwED1BAcHEt_jGA4yB1o7jZEAIARUVbdWhA0yV7TgQqUlLUgrlP_EfOactDEhsHZgtWbaf_e7OPr8DOGFMMBZwi4CrHbeCcUrAJHcitAaGu6FQVBbFJkSz6T88BK05-Jz-hbFplVNOLIg67Gl7R37O0Ha5rjUwl_0Xx1aNsq-r0xIa421xb0ZvGLLlF7UbxPeU0upt-_rOmVQVcCSaKkdYjbAAu1FlqrlVo3L90PO0cH0dcXR-uGY0Ur4WUmkvlGVPBla1nLNIVKhUDLudhwUcCi-XYKFVa7Qevy91qCfQRWfj19NCK-xcZu_x8MzGTWdW7Y3_4vzCkFVX_9kSrOHUZd9k6zBn0g1YKvJVdb4Jj1fEipZ3u6ZLzHByfGQ2IrL7hEMePCdk0CM95MMk_jAkHKUyiTVJbF7xiIxTdrOcxCkxiTJIviEZa1rnW9CexWS2oZT2UrMDRIYs8rXSqhJS1_jSN2UlpEQXUlEjAm8XDqa4dCYnPe_8gLL3d_MxLN-1G_VOvda834cVis6RTTmj_gGUBtmrOYRFPRzEeXY02VUEOjMG8Qsqlwfx |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+parallel+evolutionary+algorithm+to+optimize+dynamic+memory+managers+in+embedded+systems&rft.jtitle=arXiv.org&rft.au=Risco-Mart%C3%ADn%2C+Jos%C3%A9+L&rft.au=Atienza%2C+David&rft.au=Colmenar%2C+J+Manuel&rft.au=Garnica%2C+Oscar&rft.date=2024-06-28&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.2407.09555 |