Skip to Main Content
In this paper, we described three methods of globally assigning data items to register: one-one, many-one, and many-few. Each method is a particular single-valued mapping of a set of data items into a set of registers. We developed a formulation of each method as an integer programming problem, and showed the one-one and many-one global assignment problems to be special cases of the global many-few assignment problem.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.