Taming complexity in high-performance computing

Rod Oldehoeft

Mathematics and Computers in Simulation (MATCOM), 2000, vol. 54, issue 4, 341-357

Abstract: Today’s high-performance computing environments, and the applications that must exploit them, have become much more complex than ever. We now build ensembles of large, shared-memory parallel computers, linked together with high-speed networks, in an attempt to achieve previously unheard-of speeds and still retain a ‘general-purpose’ capability for running diverse applications.

Keywords: High-performance computing; Object-orientated frameworks; Run-time systems; Scientific visualization; Software component architecture; Linux clusters (search for similar items in EconPapers)
Date: 2000
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475400001932
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:54:y:2000:i:4:p:341-357

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().