Optimal selection of compression entries for compressing program instructions

Optimal selection of compression entries for compressing program instructions

A method of compressing instructions in a program may include extracting unique bit patterns from the instructions in the program and constructing a linear programming formulation or an integer programming formulation from the unique bit patterns, the instructions, and/or the size of a memory storag...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Lim, Chu-Cheow, Lueh, Guei-Yuan, Zheng, Bixia, Jiang, Hong
Format: Patent
Sprache:eng
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Lim, Chu-Cheow
Lueh, Guei-Yuan
Zheng, Bixia
Jiang, Hong
description A method of compressing instructions in a program may include extracting unique bit patterns from the instructions in the program and constructing a linear programming formulation or an integer programming formulation from the unique bit patterns, the instructions, and/or the size of a memory storage. The linear programming formulation or the integer programming formulation may be solved to produce a solution. The method may include compressing at least some of the instructions based on the solution by storing at least some of the unique bit patterns in a memory and placing corresponding indices to the memory in new compressed instructions.
format Patent
fullrecord <record><control><sourceid>uspatents_EFH</sourceid><recordid>TN_cdi_uspatents_grants_07688232</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>07688232</sourcerecordid><originalsourceid>FETCH-uspatents_grants_076882323</originalsourceid><addsrcrecordid>eNrjZPD1LyjJzE3MUShOzUlNLsnMz1PIT1NIzs8tKEotLgZxU_NKijJTixXS8osQ4nnpCgVF-elFibkKmXnFJUWlYK3FPAysaYk5xam8UJqbQcHNNcTZQ7e0uCCxBGhScTxQD4gyMDezsDAyNjImQgkAKtQ4ZQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Optimal selection of compression entries for compressing program instructions</title><source>USPTO Issued Patents</source><creator>Lim, Chu-Cheow ; Lueh, Guei-Yuan ; Zheng, Bixia ; Jiang, Hong</creator><creatorcontrib>Lim, Chu-Cheow ; Lueh, Guei-Yuan ; Zheng, Bixia ; Jiang, Hong ; Intel Corporation</creatorcontrib><description>A method of compressing instructions in a program may include extracting unique bit patterns from the instructions in the program and constructing a linear programming formulation or an integer programming formulation from the unique bit patterns, the instructions, and/or the size of a memory storage. The linear programming formulation or the integer programming formulation may be solved to produce a solution. The method may include compressing at least some of the instructions based on the solution by storing at least some of the unique bit patterns in a memory and placing corresponding indices to the memory in new compressed instructions.</description><language>eng</language><creationdate>2010</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://image-ppubs.uspto.gov/dirsearch-public/print/downloadPdf/7688232$$EPDF$$P50$$Guspatents$$Hfree_for_read</linktopdf><link.rule.ids>230,308,780,802,885,64039</link.rule.ids><linktorsrc>$$Uhttps://image-ppubs.uspto.gov/dirsearch-public/print/downloadPdf/7688232$$EView_record_in_USPTO$$FView_record_in_$$GUSPTO$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Lim, Chu-Cheow</creatorcontrib><creatorcontrib>Lueh, Guei-Yuan</creatorcontrib><creatorcontrib>Zheng, Bixia</creatorcontrib><creatorcontrib>Jiang, Hong</creatorcontrib><creatorcontrib>Intel Corporation</creatorcontrib><title>Optimal selection of compression entries for compressing program instructions</title><description>A method of compressing instructions in a program may include extracting unique bit patterns from the instructions in the program and constructing a linear programming formulation or an integer programming formulation from the unique bit patterns, the instructions, and/or the size of a memory storage. The linear programming formulation or the integer programming formulation may be solved to produce a solution. The method may include compressing at least some of the instructions based on the solution by storing at least some of the unique bit patterns in a memory and placing corresponding indices to the memory in new compressed instructions.</description><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2010</creationdate><recordtype>patent</recordtype><sourceid>EFH</sourceid><recordid>eNrjZPD1LyjJzE3MUShOzUlNLsnMz1PIT1NIzs8tKEotLgZxU_NKijJTixXS8osQ4nnpCgVF-elFibkKmXnFJUWlYK3FPAysaYk5xam8UJqbQcHNNcTZQ7e0uCCxBGhScTxQD4gyMDezsDAyNjImQgkAKtQ4ZQ</recordid><startdate>20100330</startdate><enddate>20100330</enddate><creator>Lim, Chu-Cheow</creator><creator>Lueh, Guei-Yuan</creator><creator>Zheng, Bixia</creator><creator>Jiang, Hong</creator><scope>EFH</scope></search><sort><creationdate>20100330</creationdate><title>Optimal selection of compression entries for compressing program instructions</title><author>Lim, Chu-Cheow ; Lueh, Guei-Yuan ; Zheng, Bixia ; Jiang, Hong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-uspatents_grants_076882323</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2010</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Lim, Chu-Cheow</creatorcontrib><creatorcontrib>Lueh, Guei-Yuan</creatorcontrib><creatorcontrib>Zheng, Bixia</creatorcontrib><creatorcontrib>Jiang, Hong</creatorcontrib><creatorcontrib>Intel Corporation</creatorcontrib><collection>USPTO Issued Patents</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Lim, Chu-Cheow</au><au>Lueh, Guei-Yuan</au><au>Zheng, Bixia</au><au>Jiang, Hong</au><aucorp>Intel Corporation</aucorp><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Optimal selection of compression entries for compressing program instructions</title><date>2010-03-30</date><risdate>2010</risdate><abstract>A method of compressing instructions in a program may include extracting unique bit patterns from the instructions in the program and constructing a linear programming formulation or an integer programming formulation from the unique bit patterns, the instructions, and/or the size of a memory storage. The linear programming formulation or the integer programming formulation may be solved to produce a solution. The method may include compressing at least some of the instructions based on the solution by storing at least some of the unique bit patterns in a memory and placing corresponding indices to the memory in new compressed instructions.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_uspatents_grants_07688232
source USPTO Issued Patents
title Optimal selection of compression entries for compressing program instructions
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-20T18%3A18%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-uspatents_EFH&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Lim,%20Chu-Cheow&rft.aucorp=Intel%20Corporation&rft.date=2010-03-30&rft_id=info:doi/&rft_dat=%3Cuspatents_EFH%3E07688232%3C/uspatents_EFH%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true