Supersizing the supercomputers: What's next?

Supercomputers excel at highly calculation-intensive tasks, such as molecular modeling and large-scale simulations, and have enabled significant scientific breakthroughs.
Yet supercomputers themselves are subject to technological advancements and redesigns that allow them to keep pace with the science they support.

The current vision of future supercomputers calls for them to be very heterogeneous--for example, rather than a central processing unit (CPU) with memory, disk and interconnect, the CPU will contain cores of smaller CPUs making up a larger whole--and have different types of processors, such as vectors and field programmable gate arrays (FPGAs). The location and type of memory will be more complex as well.

High performance components--encapsulated chunks of software that perform specific tasks--will be coupled to a dynamic framework that allows the scientists and the software to dynamically determine the algorithms or modifications to algorithms that will perform well on a particular architecture.

Multiple levels of parallelism will be explored, including parallelism at the component level, parallelism within the component, parallelism within a subroutine and threading.

These supercomputers of the future will provide orders of magnitude more computing power, but their increasing complexity also requires experts in computational science, mathematics and computer science working together to develop the software needed for the science.

Source: Pacific Northwest National Laboratory

Citation: Supersizing the supercomputers: What's next? (2005, August 30) retrieved 24 April 2024 from https://phys.org/news/2005-08-supersizing-supercomputers.html
This document is subject to copyright. Apart from any fair dealing for the purpose of private study or research, no part may be reproduced without the written permission. The content is provided for information purposes only.

Explore further

Report shows most people in Australia support lifting incomes for those with the least

0 shares

Feedback to editors