Show simple item record

Dynamic programming for computer register allocation

dc.contributor.authorAgresti, William W.en_US
dc.date.accessioned2006-04-07T17:14:27Z
dc.date.available2006-04-07T17:14:27Z
dc.date.issued1977en_US
dc.identifier.citationAgresti, William W. (1977)."Dynamic programming for computer register allocation." Computers &amp; Operations Research 4(2): 101-110. <http://hdl.handle.net/2027.42/23023>en_US
dc.identifier.urihttp://www.sciencedirect.com/science/article/B6VC5-48MPC71-47/2/7828bf1f8d99e9cbed65eae740344009en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/23023
dc.description.abstractA procedure for optimal index register allocation in loops is described. The procedure is a result of the dynamic programming formulation of the index register allocation problem for other than straightline code. An example involving a simple loop is solved.en_US
dc.format.extent890147 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherElsevieren_US
dc.titleDynamic programming for computer register allocationen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelManagementen_US
dc.subject.hlbsecondlevelIndustrial and Operations Engineeringen_US
dc.subject.hlbsecondlevelEconomicsen_US
dc.subject.hlbtoplevelBusinessen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumUniversity of Michigan-Dearborn Campus, Dearborn, Michigan 48128, U.S.A.en_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/23023/1/0000592.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1016/0305-0548(77)90031-4en_US
dc.identifier.sourceComputers &amp; Operations Researchen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.