Home // INFOCOMP 2012, The Second International Conference on Advanced Communications and Computation // View article
Authors:
Lutz Schubert
Stefan Wesner
Keywords: high performance computing, NP, scalability, non-determinism, parallel computing
Abstract:
Supercomputers can reach an unprecedented degree of scale and miniaturization reaches the quantum level of manufacturing. Non-regarding this progress, however, computing capabilities are and will remain insufficient to meet the demands of many compute intensive scenarios. The major obstacle thereby consists in the non-deterministic polynomial (NP) nature of these problems. Recent research and development seems to have almost forgotten about this intrinsic problem. With this paper we want to remind of the relevance of NP for supercomputing by exploring its impact on future computing development and discuss potential approaches to relieving (not solving) this issue.
Pages: 94 to 99
Copyright: Copyright (c) IARIA, 2012
Publication date: October 21, 2012
Published in: conference
ISSN: 2308-3484
ISBN: 978-1-61208-226-4
Location: Venice, Italy
Dates: from October 21, 2012 to October 26, 2012