Skip Navigation

The Computer Journal 1981 24(1):29-30; doi:10.1093/comjnl/24.1.29
© 1981 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (7)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Kollias, J. G.
Right arrow Articles by Hatzopoulos, M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Criteria to aid in solving the problem of allocating copies of a file in a computer network

J. G. Kollias1 * and M. Hatzopoulos2 §

1 School of Engineering, Department of Computer Science, University of Patras, Patras, Greece, 2 Unit of Applied Mathematics, University of Athens, Athens, Greece

The paper presents three criteria which aid in solving the problem of allocating copies of a file in a computer network. The criteria simplify the problem because (a) they can be applied a priori to determine that certain sites will (or will not) be included in the optimal allocation, and (b) they can become an integral part and accelerate a search procedure for finding an optimal allocation.

Received October 1979.

* School of Engineering, Department of Computer Science, University of Patras, Patras, Greece.

§ Unit of Applied Mathematics, University of Athens, Athens, Greece.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.