A Combinatorial Problem Related to Multimodule Memory Organizations-Reference-Cited by-同舟云学术

A Combinatorial Problem Related to Multimodule Memory Organizations

Published:1974-07 Issue:3 Volume:21 Page:392-402
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Wong C. K.¹,Coppersmith Don²

Affiliation:

1. IBM Thomas J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY and University of Illinois, Urbana, Illinois

2. Department of Mathematics, Harvard University, Science Center, One Oxford Street, Cambridege, MA and IBM Thomas J. Watson Research Center, Yorktown Heights, New York

Abstract

This paper deals with a combinatorial minimization problem arising from studies on multimodule memory organizations. Instead of searching for an optimum solution, a particular solution is proposed and it is demonstrated that it is close to optimum. Lower bounds for the objective functions are obtained and compared with the corresponding values of the particular solution. The maximum percentage deviation of this solution from optimum is also established.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/321832.321838

Reference10 articles.

Cited by 189 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Achromatic number of some classes of digraphs;Discrete Mathematics, Algorithms and Applications;2023-10-31

2. Lower Bounds on Lattice Covering Densities of Simplices;SIAM Journal on Discrete Mathematics;2023-08-10

3. On Optimal Embeddings in 3-Ary n-Cubes;Mathematics;2023-04-03

4. Vertex-Colouring of Some 3-Chromatic Circulant Graphs Cn(A, B, C) with Gcd(N, a) Mod 3 = 0;2023

5. Construction of Dual Optimal Bidirectional Double-Loop Networks for Optimal Routing;Mathematics;2022-10-29