Skip Navigation

The Computer Journal 1984 27(4):315-320; doi:10.1093/comjnl/27.4.315
© 1984 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 (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bell, D. A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Difficult Data Placement Problems

D. A. Bell *

School of Computer Science, Ulster Polytechnic, Ulster, UK

The problems of data placement are investigated abstractly, and we use the theory of NP-completeness to prove some results which indicate the level of difficulty of some increasingly realistic data placement problems. As a consequence of these theorems it is established that the likelihood of finding a deterministic algorithm to solve any of these data placement problems with acceptable performance is very small, and other, possibly heuristic, methods are suggested. A particularly interesting data placement problem considered in this study is formulated as the layered data placement problem, which is shown to be NP-complete.

Received June 1983.

* School of Computer Science, Ulster Polytechnic, UK


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.