[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"doc-detail-179855-es":3,"doc-seo-179855-110":31,"detail-sidebar-cat-0-es-110":92},{"code":4,"msg":5,"data":6},0,"success",{"doc_id":7,"user_id":8,"nickname":9,"user_avatar":10,"doc_module":4,"category_id":11,"category_name":12,"doc_title":13,"doc_description":14,"doc_content":15,"file_id":16,"file_url":17,"file_type":18,"file_size":19,"view_count":20,"is_deleted":4,"is_public":21,"is_downloadable":21,"audit_status":21,"page_count":22,"language":23,"language_code":24,"site_id":25,"html_lang":24,"table_of_contents":26,"faqs":27,"seo_title":28,"seo_description":14,"update_tm":29,"read_time":30},179855,7971461741311,"Ophelia","https://ap-avatar.wpscdn.com/avatar/74000253aff267980c6?x-image-process=image/resize,m_fixed,w_180,h_180&k=1779345379180704826",41,"Investigación e Informes","PEDRO JOSE MALAGON MARZO 02","Este documento presenta un análisis detallado del rendimiento de varios algoritmos, incluyendo 'tb041', 'nlftb041', 'gentb041', 'anf', 'bitslice' y 'sec-bitslice'. Se evalúan métricas clave como los ciclos de ejecución, el tamaño del código en bytes, el uso de registros y el acceso a memoria (estático y dinámico). Las tablas proporcionan datos específicos para cada algoritmo, desglosando los ciclos de ejecución mínimos y máximos, el tamaño del código, y un resumen de los accesos a memoria. Adicionalmente, se presentan resultados de accesos a memoria para bucles internos y externos, y se analizan bits específicos (31, 26, 20, 9, 1, 32) para cada algoritmo. Se incluye información sobre muestras mínimas, estabilidad y valores que superan el 5% del máximo, junto con coeficientes de correlación en función de los ciclos de reloj, ilustrando picos y caídas que indican patrones de rendimiento. El objetivo es comparar la eficiencia y las características de cada algoritmo en términos de uso de recursos computacionales. El análisis detallado de estos parámetros permite una comprensión profunda de las fortalezas y debilidades de cada método, facilitando la selección del algoritmo más adecuado para aplicaciones específicas que requieran optimización de rendimiento y uso de memoria.","|  | exec cycles |  | Code size\u003Cbr>(bytes) | Register\u003Cbr>usage | Memory |  |\n| --- | --- | --- | --- | --- | --- | --- |\n|  | min | max |  |  | static | dynamic |\n| bitslice | 14189 | 14189 | 408 | 12 | 0 | 80 |\n\n\n|  | bit 31 | bit 26 | bit 20 | bit 9 | bit 1 | bit32 |\n| --- | --- | --- | --- | --- | --- | --- |\n| bitslice | 0 | 0 | 0 | 0 | 0 | 0 |\n\n|  | exec cycles |  | Code size\u003Cbr>(bytes) | Register\u003Cbr>usage | Memory |  |\n| --- | --- | --- | --- | --- | --- | --- |\n|  | min | max |  |  | static | dynamic |\n| sec-bitslice | 33531 | 36723 | 1094 | 12 | 34 | 108 |\n\n|  | exec cycles |  | Code size\u003Cbr>(bytes) | Register\u003Cbr>usage | Memory |  |\n| --- | --- | --- | --- | --- | --- | --- |\n|  | min | max |  |  | static | dynamic |\n\n\n| tb041 | 42850 | 43849 | 244 | 11 | 0 | 62 |\n| --- | --- | --- | --- | --- | --- | --- |\n| nlftb041 | 43206 | 44470 | 252 | 11 | 0 | 62 |\n| gentb041 | 31850 | 32311 | 188 | 10 | 64 | 60 |\n| anf | 57411 | 57482 | 328 | 12 | 0 | 76 |\n| bitslice | 14189 | 14189 | 408 | 12 | 0 | 80 |\n| sec-bitslice | 33531 | 36723 | 1094 | 12 | 34 | 108 |\n\n|  | bit 31 | bit 26 | bit 20 | bit 9 | bit 1 | bit32 |\n| --- | --- | --- | --- | --- | --- | --- |\n\n\n| tb041 | 0 | 1 | 5 | 3 | 5 | 0 |\n| --- | --- | --- | --- | --- | --- | --- |\n| nlftb041 | 0 | 8 | 4 | 2 | 0 | 4 |\n| gentb041 | 2 | 1 | 1 | 1 | 0 | 0 |\n| anf | 0 | 0 | 0 | 0 | 0 | 1 |\n| bitslice | 0 | 0 | 0 | 0 | 0 | 0 |\n| sec-bitslice | 0 | 0 | 0 | 0 | 0 | 0 |\n\n\n|  | Maximum |  | More than 5% over max |  | 􀀚 @ 2000 samples |\n| --- | --- | --- | --- | --- | --- |\n|  | Min. samples | Stable | Min. samples | Stable |  |\n| tb041 | 43 | 710 | 79 | 1850 | 0.329175 |\n| nlftb041 | 117 | 136 | 440 | 810 | 0.449899 |\n| gentb041 | 23 | 91 | 103 | 153 | 0.666491 |\n| anf | 14 | 58 | 15 | 144 | 0.767303 |\n| bitslice | 17 | 19 | 77 | 77 | 0.967898 |\n| sec-bitslice | - | - | - | - | 0.825810 |","cbCaiqkBUQL6QBHF","https://ap.wps.com/l/cbCaiqkBUQL6QBHF","pdf",28476606,2,1,25,"Spanish","es",110,"# Algoritmos y Rendimiento\n# Análisis de Métricas\n## Ciclos de Ejecución\n## Tamaño del Código y Uso de Registros\n## Acceso a Memoria (Estático y Dinámico)\n## Análisis por Bit\n# Coeficientes de Correlación","[{\"question\":\"¿Cuáles son las métricas de rendimiento evaluadas para los algoritmos?\",\"answer\":\"Las métricas evaluadas incluyen ciclos de ejecución, tamaño del código en bytes, uso de registros y acceso a memoria (estático y dinámico).\"},{\"question\":\"¿Qué algoritmos se comparan en el documento?\",\"answer\":\"Los algoritmos comparados son tb041, nlftb041, gentb041, anf, bitslice y sec-bitslice.\"},{\"question\":\"¿Se proporciona información sobre el comportamiento del rendimiento a lo largo del tiempo?\",\"answer\":\"Sí, se presentan gráficos de coeficientes de correlación en función de los ciclos de reloj, mostrando picos y caídas que indican patrones dinámicos de rendimiento.\"}]","PEDRO JOSE MALAGON MARZO 02 | PDF",1788338484,39,{"code":4,"msg":32,"data":33},"ok",{"site_id":25,"language":24,"slug":34,"title":13,"keywords":35,"description":14,"schema_data":36,"social_meta":87,"head_meta":89,"extra_data":91,"updated_unix":29},"pedro-jose-malagon-marzo-02","",{"@graph":37,"@context":86},[38,54,69],{"@type":39,"itemListElement":40},"BreadcrumbList",[41,45,48,51],{"item":42,"name":43,"@type":44,"position":21},"https://docshare.wps.com","Home","ListItem",{"item":46,"name":47,"@type":44,"position":20},"https://docshare.wps.com/es/document/","Document",{"item":49,"name":12,"@type":44,"position":50},"https://docshare.wps.com/es/document/investigación-e-informes/",3,{"item":52,"name":13,"@type":44,"position":53},"https://docshare.wps.com/es/document/pedro-jose-malagon-marzo-02/179855/",4,{"url":52,"name":13,"@type":55,"author":56,"headline":13,"publisher":58,"fileFormat":61,"inLanguage":24,"description":14,"dateModified":62,"datePublished":63,"encodingFormat":61,"isAccessibleForFree":64,"interactionStatistic":65},"DigitalDocument",{"name":9,"@type":57},"Person",{"url":42,"name":59,"@type":60},"DocShare","Organization","application/pdf","2026-09-08","2026-09-02",true,{"@type":66,"interactionType":67,"userInteractionCount":20},"InteractionCounter",{"@type":68},"ViewAction",{"@type":70,"mainEntity":71},"FAQPage",[72,78,82],{"name":73,"@type":74,"acceptedAnswer":75},"¿Cuáles son las métricas de rendimiento evaluadas para los algoritmos?","Question",{"text":76,"@type":77},"Las métricas evaluadas incluyen ciclos de ejecución, tamaño del código en bytes, uso de registros y acceso a memoria (estático y dinámico).","Answer",{"name":79,"@type":74,"acceptedAnswer":80},"¿Qué algoritmos se comparan en el documento?",{"text":81,"@type":77},"Los algoritmos comparados son tb041, nlftb041, gentb041, anf, bitslice y sec-bitslice.",{"name":83,"@type":74,"acceptedAnswer":84},"¿Se proporciona información sobre el comportamiento del rendimiento a lo largo del tiempo?",{"text":85,"@type":77},"Sí, se presentan gráficos de coeficientes de correlación en función de los ciclos de reloj, mostrando picos y caídas que indican patrones dinámicos de rendimiento.","https://schema.org",{"og:url":52,"og:type":88,"og:title":13,"og:site_name":59,"og:description":14},"article",{"robots":90,"canonical":52},"index,follow",{"doc_id":7,"site_id":25},{"code":4,"msg":5,"data":93},[94,98,102,106,110,112,116,120,124,128],{"id":30,"doc_module":4,"doc_module_name":47,"category_name":95,"show_sort_weight":96,"slug":97},"Cómic",60,"comic",{"id":99,"doc_module":4,"doc_module_name":47,"category_name":100,"show_sort_weight":96,"slug":101},43,"Estilo de Vida","lifestyle",{"id":103,"doc_module":4,"doc_module_name":47,"category_name":104,"show_sort_weight":96,"slug":105},38,"Examen","exam",{"id":107,"doc_module":4,"doc_module_name":47,"category_name":108,"show_sort_weight":96,"slug":109},44,"General","general",{"id":11,"doc_module":4,"doc_module_name":47,"category_name":12,"show_sort_weight":96,"slug":111},"research-report",{"id":113,"doc_module":4,"doc_module_name":47,"category_name":114,"show_sort_weight":96,"slug":115},37,"Literatura","literature",{"id":117,"doc_module":4,"doc_module_name":47,"category_name":118,"show_sort_weight":96,"slug":119},22,"Relatos y Novelas","story-novel",{"id":121,"doc_module":4,"doc_module_name":47,"category_name":122,"show_sort_weight":96,"slug":123},42,"Religión y Espiritualidad","religion-spirituality",{"id":125,"doc_module":4,"doc_module_name":47,"category_name":126,"show_sort_weight":96,"slug":127},40,"Salud y Atención Médica","healthcare",{"id":129,"doc_module":4,"doc_module_name":47,"category_name":130,"show_sort_weight":96,"slug":131},24,"Tecnología","technology"]