IBM Systems Journal · 1970 · 26 citations · 7 references
Mathematical ProgrammingEngineeringCompiler TechnologyComputer ArchitectureSoftware AnalysisCombinatorial Data AnalysisOperations ResearchConstraint ProgrammingData ScienceManagementData IntegrationParallel ComputingCompilersCombinatorial OptimizationData ManagementInteger Programming ProblemParticular Single-valued MappingCompiler SupportComputer EngineeringComputer ScienceOptimizing CompilerInteger ProgrammingCompiler AssignmentData ItemsProgram AnalysisFormal MethodsParallel ProgrammingData Modeling
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.
7
Edward S. Lowry, C. W. Medlock · Communications of the ACM · 1969 · 229 citations · Full text
L. P. Horwitz, Richard M. Karp, Raymond E. Miller et al. · Journal of the ACM · 1966 · 77 citations · Full text